TRACE: Trajectory-robust Admission with Evidence Ordering for Efficient GUI Agents

• URL: http://arxiv.org/abs/2609.10297v1
• Date: Wed, 09 Sep 2026 15:12:48 GMT
• Title: TRACE: Trajectory-robust Admission with Evidence Ordering for Efficient GUI Agents
• Abstract summary: Training-free visual token pruning can reduce this cost, but cache reuse introduces a fundamental constraint.<n>We propose textbfmethod, a training-free framework for emphtextbfTrajectory-textbfrobust textbfAdmission and textbfCoverage-aware textbfEvidence ordering.
• Score: 54.88208747581851
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: GUI agents accumulate high-resolution screenshots as the trajectory unfolds, increasing inference latency and memory usage. Training-free visual token pruning can reduce this cost, but cache reuse introduces a fundamental constraint. Once tokens are discarded, the corresponding visual evidence cannot be recovered without re-encoding. Pruning therefore becomes an \textit{irreversible admission decision} that must remain useful for unknown future targets while preserving coverage of operable regions under tight budgets. To address these challenges, we propose \textbf{\method{}}, a training-free framework for \emph{\textbf{T}rajectory-\textbf{r}obust \textbf{A}dmission and \textbf{C}overage-aware \textbf{E}vidence ordering}. Specifically, we combine a query-independent layout-derived interaction prior with instruction relevance and feature novelty to rank visual evidence according to both potential future utility and diversity. Then, we reserve part of the budget for native visual tokens distributed across the screen, repairing missing spatial coverage without breaking the ordering. Together, these mechanisms produce a nested token order, allowing retained visual evidence to shrink monotonically across budgets while remaining reusable throughout the trajectory. Finally, our monotone KV contraction incrementally contracts retired frames into compact session state, avoiding repeated visual encoding or pruning. Extensive experiments across six GUI benchmarks and diverse models verify the effectiveness of our proposed \method{} under tight budgets. The source code will be released.

Related papers

• Less can be More: Relieving RAG Bottlenecks via Evidence Frontloading and Pressure-Adaptive Budgeting [3.685453775072903]
  We show that upstream reranking can become the dominant bottleneck under high query rates or large reranking budgets.<n>Reducing the reranking budget can relieve this bottleneck, but it may also drop supporting evidence and degrade recall.<n>We propose textbftextsfPACE, a training-free framework that combines textitevidence frontloading with textitpressure-adaptive budgeting.
  arXiv  Detail & Related papers  (2026-08-25T20:10:06Z)
• Enhancing Software Engineering Through Closed-Loop Memory Optimization [50.418699819003486]
  We introduce ours, a closed-loop framework for memory augmentation in software engineering (SE) agents.<n>ours grounds memory utility in textitvalidated downstream impact, establishing utility as a task-agnostic textbf benchmark and an annotation-free textbfoptimization signal.<n>Results demonstrate that ours consistently improves SE agents across settings, achieving absolute gains of up to $uparrow5.25%$ in success rate and $uparrow4.63%$ in resolve efficiency.
  arXiv  Detail & Related papers  (2026-06-04T03:17:21Z)
• Learning to Solve, Forgetting to Retain: Correct-Set Turnover in RLVR [16.681943272535104]
  Reinforcement learning with verifiable rewards (RLVR) improves the ability of large language model, yet headline accuracy gains often conceal a hidden cost.<n>We propose textbfmethod, a retention-aware review mechanism that tracks mastered prompts and periodically reintroduces them to textbfremind the model of previous solutions.
  arXiv  Detail & Related papers  (2026-06-02T03:17:34Z)
• Affordance Agent Harness: Verification-Gated Skill Orchestration [45.231685718099264]
  Affordance grounding requires identifying where and how an agent should interact in open-world scenes.<n>We propose Affordance Agent Harness, a closed-loop runtime that unifies skills with an evidence store and cost control.
  arXiv  Detail & Related papers  (2026-05-01T13:45:16Z)
• Towards Joint Quantization and Token Pruning of Vision-Language Models [53.978753457744055]
  Token pruning and low-bit quantization are complementary for reducing inference costs.<n>We present a collaborative quantization-and-pruning framework that unifies low-bit inference and deterministic visual-token pruning.<n> Experiments on standard VLM benchmarks show improved robustness over stage-wise baselines under the same low-bit regime.
  arXiv  Detail & Related papers  (2026-04-19T08:18:29Z)
• Rethinking Token Reduction for Large Vision-Language Models [95.48478689025696]
  Large-Language Models (LVLMs) excel in visual understanding and reasoning, but the excessive visual tokens lead to high inference costs.<n>We propose a learning-based prompt-agnostic, termed MetaCompress, overcoming the limitations of generalization designs.
  arXiv  Detail & Related papers  (2026-03-23T08:40:08Z)
• Boosting Quantitive and Spatial Awareness for Zero-Shot Object Counting [21.127727991498244]
  Zero-shot object counting (ZSOC) aims to enumerate objects of arbitrary categories specified by text descriptions without requiring visual exemplars.<n>Existing methods often treat counting as a coarse retrieval task, suffering from a lack of fine-grained quantity awareness.<n>We present textbfQICA, a novel framework that synergizes underlinequantity perceptunderlineion with robust spatial underlinecast underlineaggregation.
  arXiv  Detail & Related papers  (2026-03-17T05:32:09Z)
• ConsensusDrop: Fusing Visual and Cross-Modal Saliency for Efficient Vision Language Models [4.273730624882391]
  Vision-Language Models (VLMs) are expensive because the LLM processes hundreds of largely redundant visual tokens.<n>We show that neither signal alone is sufficient: fusing them consistently improves performance compared to unimodal visual token selection (ranking)<n>We propose textbfConsensusDrop, a training-free framework that derives a emphconsensus ranking by reconciling vision encoder saliency with query-aware cross-attention.
  arXiv  Detail & Related papers  (2026-02-01T00:28:55Z)
• $A^3$: Attention-Aware Accurate KV Cache Fusion for Fast Large Language Model Serving [42.02864241423696]
  Large language models (LLMs) have demonstrated strong capabilities in processing long contexts.<n>Despite their ability to handle long sequences, the resulting decoding latency and memory overhead remain substantial.<n>Recent advances in KV Cache reuse have shown potential to mitigate these costs, but still suffer from notable performance degradation.
  arXiv  Detail & Related papers  (2025-11-13T07:28:59Z)
• ZSPAPrune: Zero-Shot Prompt-Aware Token Pruning for Vision-Language Models [7.7352936204066]
  We propose a novel, zero-shot method to model visual token pruning as a balance between task relevance and information diversity.<n>Our method achieves performance that matches or surpasses the state-of-the-art with only minimal accuracy loss.<n>These gains are accompanied by significant reductions in GPU memory footprint and inference latency.
  arXiv  Detail & Related papers  (2025-10-20T06:18:47Z)
• QuantSparse: Comprehensively Compressing Video Diffusion Transformer with Model Quantization and Attention Sparsification [67.15451442018258]
  Diffusion transformers exhibit remarkable video generation capability, yet their prohibitive computational and memory costs hinder practical deployment.<n>Model quantization and attention sparsification are two promising directions for compression, but each alone suffers severe performance degradation under aggressive compression.<n>We propose textbfQuantSparse, a unified framework that integrates model quantization with attention sparsification.
  arXiv  Detail & Related papers  (2025-09-28T06:49:44Z)
• CODA: Repurposing Continuous VAEs for Discrete Tokenization [31.932323809073477]
  textbfCODA(textbfCOntinuous-to-textbfDiscrete textbfAdaptation) is a framework that decouples compression and discretization.<n>Our approach achieves a remarkable codebook utilization of 100% and notable reconstruction FID (rFID) of $mathbf0.43$ and $mathbf1.34$ for $8 times$ and $16 times$ compression on ImageNet 256$times$ 256 benchmark.
  arXiv  Detail & Related papers  (2025-03-22T12:59:00Z)
• Activation-aware Probe-Query: Effective Key-Value Retrieval for Long-Context LLMs Inference [56.71209737306054]
  We propose textbfActQKV, a training-free, textbfActivation-aware approach that dynamically determines probe-textbfQuery and leverages it to retrieve the relevant textbfKV pairs for inference.<n>Experiments on the Long-Bench and $infty$ Benchmarks demonstrate its state-of-the-art performance with competitive inference quality and resource efficiency.
  arXiv  Detail & Related papers  (2025-02-19T08:50:44Z)
• Gumbel Reranking: Differentiable End-to-End Reranker Optimization [61.16471123356738]
  RAG systems rely on rerankers to identify relevant documents.<n> fine-tuning these models remains challenging due to the scarcity of annotated query-document pairs.<n>We propose Gumbel Reranking, an end-to-end training framework for rerankers aimed at minimizing the training-inference gap.
  arXiv  Detail & Related papers  (2025-02-16T13:23:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.