- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper mainly introduces the GUI state of the next frame that can be observed in the training trajectory into the model training process. The aim is to enable the model to utilize the future information learned during the training stage to assist in the current action decision-making even when it cannot see the actual future scene during deployment. Specifically, the authors proposed a two-stage training paradigm: Firstly, they constructed a specific data form based on the existing trajectory for SFT, enabling the model to simultaneously learn the action prediction under the current state and the tasks related to the next state; subsequently, they adopted a similar teacher-student dual-branch structure for distillation, leaving a CopyState slot in the model and having the hidden representation at that position learn the future representation corresponding to the real next frame. The main contributions of the paper are also quite clear: Firstly, it proposed TASI, which is initialized and trained through the successor-related data constructed by the authors; Secondly, it proposed URFD, which controls the distillation of future information at the two levels of hidden representation and action policy, so that the deployed model, which can only see the current state, can learn part of the future information. The ablation experiments are also quite solid, verifying the effectiveness of each component.
Critical strengths
One of the main advantages of this paper is that the overall method design is quite comprehensive. The authors first establish successor-aware initialization through TASI, and then use URFD to selectively distill the hidden representation and action policy based on future utility. The motivation between the two stages is relatively coherent. At the same time, the method utilizes the naturally existing information of the next frame in the existing GUI trajectory, without the need to generate future images additionally. Deployment does not rely on the actual future state. The experimental part is well done, apart from the conventional component ablation, the authors also systematically analyzed the effects of utility, alignment layer, slot size, and different action types, and simultaneously verified it on offline and online benchmarks. Overall, although the innovation of the method itself is not particularly strong, the completeness of method design, experimental verification, and analysis is relatively high.
Critical weaknesses
I consider this to be a well-structured and well-conducted study. The innovation of the method itself is not particularly strong, but from the overall method design to the ablation experiments and further analysis, the author has done a comprehensive job. My current evaluation is somewhere between "weak reject" and "weak accept"; if the author can provide clear explanations for several key issues in the rebuttal and supplement necessary control experiments, I would be more inclined to "weak accept". My main concern is that the current experiments have not fully demonstrated how much of the performance improvement comes from the proposed method itself. Although URFD has achieved good results compared to existing methods, compared to the most critical backbone Qwen3-VL-SFT baseline, the improvement is actually relatively limited, and the paper's explanation of the training configuration and training budget for this SFT baseline is not sufficient. At the same time, URFD introduces an additional 32-token CopyState slot during training and deployment, which is not completely consistent with the input format of the standard SFT. Therefore, the current results are still difficult to completely rule out the benefits brought by additional training budget or changes in input structure. Overall, I believe the main problem with this work is not that the method is ineffective, but that the current experiments have not sufficiently separated the contribution of the method itself from the impact of training and input settings. If these issues can be properly clarified, the entire paper is persuasive.
Questions for authors
Qwen3-VL-SFT is the most important counterpart to the backbone baseline in this paper, and it has already surpassed most of the existing methods in the table. The author is requested to further explain the specific training settings of this SFT baseline. Does it use the same data and optimization configuration as TASI/URFD? If the training budget is different, how much of the improvement of URFD compared to SFT might come from the additional training itself?
URFD uses an additional 32-token CopyState slot during training and deployment, while the ordinary baseline uses a single current screenshot and text history. Please ask the author if they have tried an input-matched Qwen3-VL-SFT, that is, using the same 32-token low-resolution copy of the current screenshot and text as the input, but only performing ordinary action SFT? This comparison can help determine whether the input structure of CopyState has already brought some benefits.
The symbol definitions in Eq. 10 of the main text seem to be in contradiction with the content stated in the paper.
Compared to Qwen3-VL-SFT, the overall improvement of URFD on AndroidWorld comes entirely from the Medium split, while Easy and Hard do not have any improvement. How does the author understand this phenomenon? Does this mean that the current one-step future supervision mainly improves local action decisions, and has limited help for longer horizon tasks?
Please ask the author if they can add a control group starting from the same TASI checkpoint, using the same CopyState input and the same number of training steps, but only performing action CE? The existing component ablation shows that each module has an effect, but this control group can more directly isolate the contribution of the second stage future distillation itself.
4 comments
Response to Reviewer XN8M (2/2)
Q4: Why the AndroidWorld gain concentrates on Medium tasks.
We thanks for this insightful question. We analyzed this phenomenon (pass@3) using the official AndroidWorld task metadata (optimal number of steps and task tags):
| Difficulty | Tasks | SFT | URFD | URFD wins / losses | Median optimal steps | Tasks requiring cross-step state* |
|---|---|---|---|---|---|---|
| Easy | 61 | 50 | 50 | 4 / 4 | 4 | 8% |
| Medium | 36 | 17 | 21 | 6 / 2 | 6 | 19% |
| Hard | 19 | 4 | 4 | 1 / 1 | 13 | 63% |
URFD distills future-state information and mainly improves navigation decisions, i.e., where to tap and where to go next (in the offline analysis, Scroll and Press show the largest gains, while Click contributes the most to the overall improvement; see Figure 5 and Appendix D). This mechanism interacts differently with the main bottleneck of each difficulty level:
- Easy. The paths are short (median of 4 steps), and both models already solve 50 of the 61 tasks. A small improvement in per-step accuracy rarely changes the task outcome, especially under pass@3; the 8 tasks with changed outcomes are evenly split between wins and losses.
- Hard. The paths are long (median of 13 steps), and 63% of the tasks require maintaining state across steps (e.g., passing information across apps, memorization, or repeated operations); both models fail on 14 of the 19 tasks. The bottleneck lies in long-horizon state management.
- Medium. The paths are of moderate length with fewer cross-step state requirements, so success depends mainly on whether the model reaches the expected pages. Here, improvements in individual steps translate most readily into task success.
We would also like to note that long-horizon tasks involve two different kinds of difficulty. The first kind requires multi-step navigation to reach the target page, where every step involves deciding where to go next, and URFD is particularly effective on such tasks. Examples include FilesMoveFile, SimpleCalendarAddOneEventInTwoWeeks, and the Hard task SaveCopyOfReceiptTaskEval, which URFD solves but SFT does not; all of them require the agent to move through a sequence of new pages. The second kind requires repeating the same workflow while keeping track of completed progress (e.g., ExpenseAddMultiple and RetroSavePlaylist); here, the difficulty lies in retaining historical information rather than anticipating the next step, which is beyond the scope of future-state supervision. In essence, the former tests whether the model can anticipate the future states that its actions lead to, whereas the latter tests whether it can retain historical information over a long horizon; URFD is designed for the former. This is also reflected in the trajectories of the AndroidWorld tasks with changed outcomes: among the 11 tasks that SFT fails but URFD solves, SFT reaches the target page in only 4 tasks, whereas among the 7 tasks that URFD fails, URFD has already reached the target page in 6 tasks. In other words, SFT mostly fails at navigation, while URFD mostly fails after the target page has been reached. We therefore believe that URFD helps navigation-dominated long-horizon tasks but provides limited benefit for long-horizon tasks that rely on memory of past progress; combining URFD with memory mechanisms is a direction for our future work.
We hope that the added control experiments and analyses address your concern about the contribution of the method. Once again, we sincerely thank you for the time and effort devoted to reviewing our paper and for the valuable suggestions. If our responses have resolved your concerns, we would be very grateful if you could consider raising your score. If you have any further questions, we would be more than happy to engage in further discussion.
Summary of rebuttal to Reviewer XN8M
Dear Reviewer XN8M,
Thank you again for your thoughtful feedback. As the discussion period is nearing its end, we would be grateful if you could review our response.
We showed that the SFT baseline uses the same TASI initialization, data, and update budget as URFD, and added the control you suggested in Q2/Q5 (same TASI checkpoint and CopyState input, CE only), which URFD still outperforms by 2.06 points. We also clarified the sign typo in Eq. (10) and explained, using AndroidWorld task metadata, why the gains concentrate on Medium tasks.
We would greatly appreciate your feedback. If our responses have addressed your concerns, we would be grateful if you could kindly consider raising your score; if not, we would be glad to discuss further. Thank you again for your time and valuable comments.
Response
Thank you to the author for providing a detailed Rebuttal response, and for supplementing the training configuration description and key control experiments to address the questions I raised previously.
However, after further examination of the training paradigm of the paper, I still have the following doubts about its core mechanism.
The paper emphasizes that the Student can approximate future-conditioned hidden representations without observing the actual future state. However, TASI primarily relies on successor selection among visible candidates and action prediction conditioned on real future screenshots, while URFD transfers the resulting representations through Hidden-State Alignment and Policy Distillation.
Although this approach improves action prediction, it remains unclear whether the Student genuinely learns representations containing predictive information about future states, or merely acquires better action-discriminative features.
In particular, the FutureState Teacher's hidden states may encode both future-state information and action-related discriminative features. Therefore, improvements in downstream Action Accuracy and Hidden Alignment Loss alone do not sufficiently establish that the Student has learned meaningful future-state representations.
Since learning future-conditioned representations is a central claim of the paper, I believe a more direct Embedding-Level Evaluation would be valuable.
Overall, I acknowledge the effectiveness of the additional experiments and the improvements in action prediction. However, I remain concerned that the proposed mechanism of future-state representation learning has not been directly validated. Therefore, I am currently inclined to maintain my original score.
Response to Reviewer XN8M (1/2)
We sincerely thank you for the positive assessment of our method design and the completeness of our experiments and analyses. To address yout central concern about how much of URFD's improvement comes from the method itself, we have added the control experiments and will respond to each point below.
The SFT baseline shares the initialization, training data, and optimization configuration of URFD; the two differ only in the stage-2 input and training objective:
Therefore, URFD's improvement over SFT does not come from additional training data or training steps. We will include these details in Section 4.1 and Appendix B.
Since our SFT baseline is itself initialized from the TASI checkpoint, the two controls suggested in Q2 and Q5 correspond to the same experiment in our setting: starting from the same TASI checkpoint, using the same input as URFD (the current screenshot plus a 32-token low-resolution CopyState slot), the same data, and the same 4,893 updates, and training with action cross-entropy only. The results (action match, %) are as follows:
The CopyState input structure alone contributes only 0.20 points on average. With identical input, data, and number of updates, URFD still outperforms this control by 2.06 points (3.09 points on GUI-Odyssey), indicating that the improvement stems mainly from the stage-2 future distillation, not the additional CopyState input.
We thanks for pointing this out. The two terms in Eq. (10) were inadvertently swapped. The utility is intended to measure the token-averaged increase in the log-likelihood of the demonstrated action when the real successor screen is visible, and the correct expression is
ui=∣Ai∣1∑j∈Ai[logqi,jF(ai,j)−logqi,jC(ai,j)]
A positive ui indicates that the successor is helpful, in which case the routing weight wi increases and the student is aligned more closely with the FutureState teacher, consistent with the main text and Appendix B. For example, with qC(a)=0.50 and qF(a)=0.60, we obtain u=+0.182 and w=1 under the routing interval [0,0.01]; with qF(a)=0.45, we obtain u=−0.105 and w=0, so the student remains anchored to the CopyState teacher. The implementation and all experiments use this correct expression, and we will correct Eq. (10) and the corresponding formula in Figure 1 in the revision.
(Continued in Part 2/2.)