- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper models the lifecycle of a single GUI-agent response as four events—environment change (E), observation availability (O), decision commitment (D), and action receipt (A)—and distinguishes four timing failures accordingly: Missed, Stale (outdated at commitment), Invalidated, and Late. The authors build ChronotopeGym, a benchmark of five dynamic tasks under three execution conditions (Paused / Replay / Live) that makes these temporal relations experimentally controllable, and propose Chronotope, a controller that continues observing during inference, reconciles unfinished decisions before commitment (preserve / revise / late-bind / re-decide), and keeps the latency-sensitive control path resident on the GPU accelerator. The paper advances three core claims: (1) configurations that achieve perfect scores under Paused/Replay can fail completely under Live; (2) with the model call and the commitment/receipt times held fixed, changing only the observation that supplies the click coordinate flips success from 0/100 to 100/100, showing that response speed is not the sole determinant of success; (3) lightweight pre-commitment argument updates recover success without additional model calls, whereas full model restarts fail in 100/100 trials on continuously moving targets.
Critical strengths
-
The EODA decomposition answers a question that a single latency number obscures: with the same O→A = 400 ms, different splits into (O→D, D→A) yield two distinct failures—invalidated-after-commitment versus missed-evidence (Fig 4). The four failure modes are mutually exclusive, and each calls for a different remedy (the intervention-selectivity validation in Table 3 and Fig 12 is elegant: updating state repairs only pre-D changes, earlier receipt repairs only deadline-type failures, and continuous drift requires both).
-
The experimental protocol is rigorous and reproducible. Qualification gating (Paused ≥ 8/10) separates timing failures from ordinary task incompetence (Table 16 honestly reports all configurations that failed the gate and excludes them from every claim); held-out seeds are disjoint from development seeds; Wilson intervals (which remain informative at 0/n and n/n), exact McNemar tests, and permutation tests are used throughout; the scorer is validated on hand-authored traces and recomputed by a second, independent minimal scorer; manifests are hash-frozen; and oracle results are verified cell-by-cell against closed-form predictions written independently of the harness. Code and seeds are open-sourced.
Critical weaknesses
-
The evaluation is confined to synthetic toy tasks, so the transferability of the conclusions to real GUI scenarios is unverified. All five tasks are synthetic, single-step, small-canvas tasks. Real GUI tasks are multi-step, semantically complex, and causally coupled across actions, which limits the transferability of the conclusions to real-world deployment. The core increment of this paper is the EODA four-event decomposition, which refines "failure" into four timing-failure modes. However, the diagnostic value of this decomposition is demonstrated mainly through oracle validation in a controlled synthetic environment.
-
Most analytical experiments verify the self-consistency of the EODA framework itself, rather than discovering properties of real agent behavior. The experimental design is rigorous, but most of the analytical experiments employ scripted controllers to verify the self-consistency of the EODA framework and its intervention strategies—i.e., that each intervention repairs only its corresponding failure mode (Table 3). These experiments are in essence correctness checks of the harness itself rather than discovery-oriented analyses of real agent behavior.
Questions for authors
-
Can the findings of this paper guide GUI agents in handling dynamic environments in real-world scenarios?
-
Do the findings still hold when transferred to real-world scenarios?
-
The paper's discussion of pre-commitment decision revision (late binding vs. restart) coincides with the classical replanning/plan-commitment problem studied in anytime planning, deliberation scheduling, and receding-horizon control, yet none of this literature is cited or compared against. How does the paper position its contribution and novelty relative to these classical results?
8 comments
Official Response to Reviewer ErHS (Part 2 of 3)
**2. (W2) "Most analytical experiments verify the self-consistency of the EODA framework itself, rather than discovering properties of real agent behavior...correctness checks of the harness itself rather than discovery-oriented analyses of real agent behavior."
We thank the reviewer for raising the questions of whether Chronotope's findings transfer to realistic GUI applications and whether its experiments reveal properties of agent behavior beyond controlled validation.
To investigate Chronotope's real-world benefits, we extend our evaluation to DynaCU-Bench and a new War Thunder live application study. DynaCU-Bench evaluates semantically complex, multi-step GUI interactions, while War Thunder introduces continuously changing environments with stateful, causally coupled actions. The full Chronotope controller achieves 67.5% success on DynaCU-Bench and 10.9% on War Thunder, compared with 62.3% and 0% for Agent S3, respectively (Table R4a). These evaluations extend beyond the original controlled, single-step tasks.
Table R4a. Realistic task performance and matched ablations.
| Controller | Meta-control | History | DynaCU-Bench SR | War Thunder SR |
|---|---|---|---|---|
| Agent S3 | Native | None | 24.0% | 0% |
| Agent S3 | Native | Native (Chronological text) | 62.3% | 0% |
| Chronotope | Always KEEP | EODA/EDM | 64.1% | 7.6% |
| Chronotope | Always REDECIDE | EODA/EDM | 67.5% | 6.8% |
| Chronotope | Always UPDATE | EODA/EDM | 67.3% | 10.4% |
| Chronotope | Selective | None | 28.1% | 7.9% |
| Chronotope | Selective | Chronological text | 67.0% | 9.3% |
| Chronotope | Selective | EODA/EDM | 67.5% | 10.9% |
All Chronotope configurations use the same Qwen3.8-27B planner, with for retained histories. Selective denotes KEEP/UPDATE/REDECIDE meta-control.
Matched ablations further isolate the contributions of interaction history and meta-control. On DynaCU-Bench, retaining chronological history increases success from 28.1% to 67.0%, while EODA/EDM further improves success to 67.5%. On War Thunder, EODA/EDM improves success by 17.2% relative to chronological history. With EODA/EDM fixed, selective meta-control improves success over Always KEEP by 5.3% and 43.4% on DynaCU-Bench and War Thunder, respectively. It matches the strongest fixed policy on DynaCU-Bench and outperforms all fixed policies on War Thunder. These results establish the complementary benefits of interaction history and selective temporal adaptation.
Beyond validating the EODA framework, our experiments reveal empirical properties of model-based agents under temporal constraints. While controlled interventions isolate individual failure mechanisms, our performance-envelope experiments measure end-to-end latency, response deadlines, and task success. Using the same Qwen3.8-27B (NVFP4) planner, Chronotope reduces median end-to-end latency () by 85.5% relative to Agent S3. At 8-second and 2-second deadlines, Chronotope achieves 100% and 81% Live task success, respectively, compared with 0% for Agent S3. Neither succeeds at a 1-second deadline (Figure 7). Moreover, Moving Balloon and Reversing Trading Signal demonstrate that agents can fail despite meeting deadlines when environmental changes invalidate their actions. Thus, faster control expands the performance envelope, while maintaining decision validity requires temporal adaptation.
Our evaluations further yield two practical findings for dynamic GUI agent design. First, multi-step dynamic GUI tasks benefit substantially from interaction history. The 28.1% to 67.0% improvement on DynaCU-Bench demonstrates the importance of retaining previous interactions rather than relying solely on the latest observation and pending-action state. Second, latency-sensitive applications benefit from concise, causally structured histories. At , EODA/EDM reduces token consumption by 45.2% relative to chronological text, reduces median latency by 3.6%, and improves War Thunder success by 17.2%. Preserving dependencies among previous actions, receipts, and subsequent observations helps agents recognize ineffective actions rather than repeatedly acting on outdated assumptions.
Together, these results provide concrete guidance for dynamic GUI agents: preserve causally relevant interaction history, distinguish latency failures from outdated decisions, and selectively KEEP, UPDATE, or REDECIDE before commitment. Although the current updaters remain task-specific, the findings demonstrate the practical relevance of Chronotope's temporal control principles beyond synthetic environments.
Official Response to Reviewer ErHS (Part 3 of 3)
3. (Q3) "The paper's discussion of pre-commitment decision revision (late binding vs. restart) coincides with the classical replanning/plan-commitment problem studied in anytime planning, deliberation scheduling, and receding-horizon control, yet none of this literature is cited or compared against. How does the paper position its contribution and novelty relative to these classical results?
We thank the reviewer for highlighting these connections to classical planning and meta-reasoning. We clarify the conceptual distinctions below. We have also revised our manuscript to include this discussion in the Extended Related Works section in Appendix A.3.
Anytime planning. Anytime planning produces a usable plan quickly, then continues searching for a better plan if more time is available (Dean and Boddy, 1988, Zilberstein, 1996). Its central concern is the tradeoff between computation time and the quality of the available solution. In contrast, Chronotope studies the temporal coordination of observation, decision-making, and action execution in continuously changing environments. An action can meet its deadline yet fail because the environment has changed, independently of the computation-quality tradeoff addressed by anytime planning.
Deliberation scheduling. Deliberation scheduling determines which reasoning processes to run and for how long based on their expected benefits (Russell and Wefald, 1991, Boddy and Dean, 1994). Its central problem is allocating limited computation among competing reasoning processes to maximize decision utility. In contrast, dynamic, latency-sensitive GUI agents must act in changing environments without knowing in advance how long their intended actions will remain valid. Even under identical computation schedules, actions can succeed or fail depending on whether environmental changes invalidate them before execution.
Receding-horizon control. Receding-horizon control repeatedly optimizes future control actions using updated system states and executes the next action (García et al., 1989, Mayne et al., 2000). Its central problem is future-trajectory optimization, typically using a predictive model of how the system evolves. In contrast, dynamic, latency-sensitive GUI agents operate without necessarily knowing the environment's dynamics, future states, or action-validity windows. The key challenge in our setting is not predicting an optimal future trajectory, but ensuring that an immediate action remains valid as the environment changes unpredictably.
We thank the reviewer again for the thoughtful feedback and constructive suggestions. We hope that our new experiments, additional comparisons, and expanded discussion of related work address your concerns about Chronotope's generalizability, practical benefits, and novelty. We would be happy to provide any further clarification. If these additions have sufficiently addressed your concerns, we would be grateful if you would consider revisiting your assessment.
Official Response to Reviewer ErHS (Part 1 of 3)
Dear Reviewer ErHS,
Thank you for your constructive feedback. We have substantially revised the manuscript with new evaluations, architectural ablations, and clearer experimental distinctions. We address your comments below.
1. (W1 & Q1 & Q2) “The evaluation is confined to synthetic toy tasks, so the transferability of the conclusions to real GUI scenarios is unverified... However, the diagnostic value of this decomposition is demonstrated mainly through oracle validation in a controlled synthetic environment.” / “Can the findings of this paper guide GUI agents in handling dynamic environments in real-world scenarios?” / “Do the findings still hold when transferred to real-world scenarios?”
We thank the reviewer for raising questions about the transferability and practical relevance of Chronotope's findings. We extend our evaluation to DynaCU-Bench, featuring complex, multi-step GUI interactions, and introduce a fully live War Thunder application study, featuring continuously evolving states and causally coupled actions. Chronotope achieves 67.5% versus 62.3% success on DynaCU-Bench relative to Agent S3 and 10.9% versus 0% on War Thunder. These results demonstrate benefits beyond the original controlled tasks.
Table R4a. Matched ablations of history representation and meta-control policies.
All configurations use the same Qwen3.8-27B planner, with history capacity N=8 where applicable.
Matched ablations isolate the contributions of interaction history and selective meta-control. On DynaCU-Bench, retaining chronological text history increases success from 28.1% to 67.0%, while EODA/EDM further improves success to 67.5%. On War Thunder, EODA/EDM improves success by 17.2% relative to chronological text. With EODA/EDM fixed, selective meta-control improves success over Always KEEP by 32.6%, 5.3%, and 43.4% across ChronotopeGym, DynaCU-Bench, and War Thunder, respectively. It also outperforms Always REDECIDE on ChronotopeGym and War Thunder while matching it on DynaCU-Bench. These comparisons establish the distinct roles of retaining history, structuring event dependencies, and selecting an appropriate control policy.
Beyond controller performance, our experiments reveal generalizable properties of model-based agents under temporal constraints. The controlled interventions isolate distinct failure mechanisms without relying on evaluator-only information during agent execution. Our performance-envelope experiments complement these diagnostics by measuring end-to-end latency, response deadlines, and Live task success. Using the same Qwen3.8-27B (NVFP4) planner, Chronotope reduces median end-to-end latency (E→A) by 85.5% relative to Agent S3. At 8-second and 2-second deadlines, Chronotope achieves 100% and 81% Live task success, compared with 0% for Agent S3 at both deadlines. Neither succeeds at a 1-second deadline (Figure 7). Meanwhile, Moving Balloon and Reversing Trading Signal demonstrate that agents can fail despite meeting deadlines when environmental changes invalidate their actions. Thus, faster control expands the performance envelope, but maintaining decision validity requires temporal adaptation.
The new evaluations provide two practical findings for dynamic GUI agent design. First, multi-step tasks benefit substantially from interaction history. On DynaCU-Bench, retaining chronological history improves success by 138.4% under identical selective meta-control, demonstrating the importance of previous interactions beyond the latest observation. Second, latency-sensitive applications benefit from concise, causally structured histories. At N=8, EODA reduces token consumption by 45.2% relative to chronological text, reduces median latency by 3.6%, and improves War Thunder success by 5.3%. In War Thunder, preserving dependencies between firing decisions, action receipts, and subsequent observations helps the agent recognize ineffective actions rather than repeatedly firing at obscured targets.
Together, these evaluations support three practical principles for dynamic GUI agents: distinguish latency failures from outdated decisions, preserve causally relevant interaction history, and selectively KEEP, UPDATE, or REDECIDE before commitment. Although the current updaters remain task-specific, these results demonstrate the relevance of Chronotope's temporal control principles beyond synthetic environments.