atlas

Research map / Multi-agent systems and games / LLM agents

Executable Agentic Memory for GUI Agent

ICML 2026 · Multi-agent systems and games › LLM agents · approach: GUI agent memory and trajectories · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Executable Agentic Memory, a GUI logic knowledge graph built by DFS exploration and BPE-style action-group mining, with a Q-model-guided MCTS for path extraction that reaches 52.6% on AndroidWorld and cuts token cost ~6x vs GPT-4o.

Problem

GUI agents rely on step-wise LLM re-decision at every screen, which is fragile and costly in long-horizon tasks; in-context memory injection does not reliably yield executable paths.

Approach

Store GUI interaction logic as a knowledge graph of states and actions (with mined multi-step action groups), and extract executable paths by running MCTS over the graph guided by a lightweight Q-model trained with uniform-random-policy success probabilities, plus theoretical bias and sample-complexity bounds.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: AndroidWorld MobileMiniWob++ DroidTask

Benchmarks: AndroidWorld MobileMiniWob++ DroidTask

Metrics: success rate latency API token cost

Baselines: GPT-4o Qwen 2.5-VL-3B UI-TARS-2B UI-TARS-7B M3A AutoDroid-V2 AppAgentX GUI-Explorer

Builds on: Monte Carlo Tree Search Byte Pair Encoding AppAgentX GUI-Explorer UCT

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy