aiqbench analysis
This research introduces CausalCache, a method that optimizes visual memory for long-horizon GUI agents by intelligently allocating limited high-fidelity image budgets across an entire interaction trace rather than just recent events. By using a history-gated adapter to selectively restore distant screenshots only when they offer higher conditional utility, the approach achieves significant performance gains on OSWorld-Verified benchmarks without increasing computational overhead. The findings demonstrate that strategic management of visual context is critical for improving agent success rates in complex, multi-step tasks.
CausalCache: Conditional High-Fidelity Restoration for Long-Horizon GUI Agents
arXiv:2608.22577v1 Announce Type: new Abstract: Long-horizon GUI agents can retain a complete interaction trace cheaply as textual action records, but expose only a few past events to the policy in high-fidelity pixels. We formulate this as conditional fidelity restoration: each event persists in summary-only form and is linked to an archived screenshot, while an active visual-context budget $B$ limits how many events may be promoted to summary-plus-image form. Recent-$B$ spends every slot on the latest events. CausalCache instead reallocates the same $B$ promotions over the complete trace, evicting a recent image only when a distant event has higher conditional marginal utility. Its history-gated key/value (HGKV) adapter modifies only restored history-image tokens and is exactly bypassed with no history image. Matched-budget replacement groups and per-arm-anchored difference-in-differences supervision make uniform history amplification worth zero; a budget-aware selector then chooses which summarized events to restore. On desktop, the frozen policy shows no reliable preference for a task-relevant archived screenshot over the recent frame it would displace; HGKV learns exactly that selectivity inside a pre-specified drift envelope. On OSWorld-Verified, restoring history to high fidelity is worth about $13$ success points over summary-only memory, while same-budget allocations remain indistinguishable. Zero-shot on a cross-application mobile benchmark, CausalCache significantly improves overall success over the same-budget recent allocation ($+3.7$ points on the full roster), and the gain concentrates where it should: $+8.6$ points on the memory-critical split fixed by benchmark metadata at construction, no detectable effect on matched controls, and a significant split-by-method interaction.
Abstract:Long-horizon GUI agents can retain a complete interaction trace cheaply as textual action records, but expose only a few past events to the policy in high-fidelity pixels. We formulate this as conditional fidelity restoration: each event persists in summary-only form and is linked to an archived screenshot, while an active visual-context budget $B$ limits how many events may be promoted to summary-plus-image form. Recent-$B$ spends every slot on the latest events. CausalCache instead reallocates the same $B$ promotions over the complete trace, evicting a recent image only when a distant event has higher conditional marginal utility. Its history-gated key/value (HGKV) adapter modifies only restored history-image tokens and is exactly bypassed with no history image. Matched-budget replacement groups and per-arm-anchored difference-in-differences supervision make uniform history amplification worth zero; a budget-aware selector then chooses which summarized events to restore. On desktop, the frozen policy shows no reliable preference for a task-relevant archived screenshot over the recent frame it would displace; HGKV learns exactly that selectivity inside a pre-specified drift envelope. On OSWorld-Verified, restoring history to high fidelity is worth about $13$ success points over summary-only memory, while same-budget allocations remain indistinguishable. Zero-shot on a cross-application mobile benchmark, CausalCache significantly improves overall success over the same-budget recent allocation ($+3.7$ points on the full roster), and the gain concentrates where it should: $+8.6$ points on the memory-critical split fixed by benchmark metadata at construction, no detectable effect on matched controls, and a significant split-by-method interaction.
Artificial Intelligence (cs.AI)
arXiv:2608.22577 [cs.AI]
(or arXiv:2608.22577v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2608.22577 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 335 words
Related coverage

[AINews] not much happened today
Latent Space · Oct 3, 2026

News
Quantum Computing Report · Jul 25, 2026
Diffusion-corrected Autoregressive Fourier Neural Operator for Droplet Evolution Prediction
arXiv · Jul 21, 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · Sep 18, 2026