AI & ML
Can LLM Agents Learn to Test? Maintaining Scoped Experience as Testing Evidence for Mobile GUI Testing
arXiv cs.SE0 views
arXiv:2611.05873v1 Announce Type: new Abstract: Repeated mobile GUI tests can reuse routes, locators, and recovery strategies from earlier executions. However, a route that worked in one workflow or app version may be irrelevant or misleading in another. We study how an LLM-based tester can retain useful experience while withholding entries contradicted by current observations. We present a maintenance contract for AdaptiTest in which reusable experience has an explicit applicability scope, trace provenance, and a lifecycle for confirmation, revalidation, and withdrawal. The contract reserves persistence for a Reflector role and treats recalled experience as advice. The archived implementation does not establish end-to-end enforcement of every specified mechanism. The design changes retrieved context, not model weights. The evaluation uses read-only Android workflows and archived internal comparisons. A six-task, three-repeat ready subset reports 18/18 completed runs with memory versus 3/18 without it, but a grounded single-agent control also solves the earlier hard-task slice. A separate cross-session probe is excluded from efficacy conclusions because of confounded route schedules and unvalidated state labels. We examine 13 selected real-update hazard records across nine subjects, distinguishing stale-locator observations from policy-based withholding and offline retrieval diagnostics. The latter do not measure live-device failures or actions saved. These events are UI changes, not confirmed regression bugs. The evidence supports a bounded design and case study; it does not establish general efficacy, superiority over independent GUI-agent systems, or unrestricted exploration.
Source:https://arxiv.org/abs/2611.05873PreviousDARE: Difficulty Analysis for Repair EnhancementNextRetrieval Supersedes Scale: Efficient Log Level Prediction via Multiplex Socio-Technical Context
Related posts
Uniform Race: Parameter-Free Approximate Rejection Sampling
0arXiv stat.ML
Efficient Robust Learning at the Information-Theoretic Limit
0arXiv stat.ML
Algorithmic Principles For Multiclass Learning Are Hard To Come By: Limits of Regularization and Proper Learning
0arXiv stat.ML
More Expressive Feedforward Layers: Part I. Token-Adaptive Mixing of Activations
0arXiv stat.ML
Fr\'echet Regression on the Bures-Wasserstein Manifold
0arXiv stat.ML
Decoupling Distance and Networks: Hybrid Graph Attention-Geostatistical Methods for Spatio-temporal Risk Mapping
0arXiv stat.ML