- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Trajectories as Programs (TaP), a framework for reusing LLM agent experience in resettable, deterministic environments. For failed trajectories, TaP replays recorded action prefixes and evaluates task progress to identify recovery points, then uses short probes and adaptive attempt allocation to generate continuations. For successful trajectories, it produces verified, pruned programs that can be replayed directly, avoiding regressions caused by regenerating actions. The paper evaluates the framework on AppWorld and BFCL-V3 using multiple models, component ablations, and budget-matched comparisons.
Critical strengths
-
The method addresses a clear problem and offers a practically useful design.
The paper distinguishes two needs in experience reuse: preserving successful behavior and retaining useful progress from failed attempts. Executable trajectory records reduce reliance on the model to regenerate previous actions faithfully. Restoring both the environment state and the corresponding context also provides a well-defined starting point for continuation. Recovery-point selection, probe-guided allocation, and verified replay form a coherent framework.
-
The experiments support the effectiveness of the overall framework under the studied conditions.
Table 1 reports improvements in both Avg@4 and Pass@4 across two benchmarks and multiple model configurations. For example, with Qwen3-8B on AppWorld, TaP improves Avg@4 from 24.70 to 34.47 and Pass@4 from 42.06 to 48.02 over dynamic ReMe. Improvements in both metrics indicate that the gains include solving more tasks, beyond preserving previously achieved success. The budget-matched comparisons further suggest that the advantage over the tested baselines cannot be explained simply by additional model calls.
-
The component analyses help explain where the gains come from.
Figure 4 compares textual summaries, verbatim transcripts, and executable replay of the same successful experience, directly demonstrating that regeneration can lose previously verified behavior. Table 2 examines replay, recovery-point localization, probing, and attempt allocation separately. Removing state localization reduces Avg@4 by 2.43 and 3.55 percentage points on the two benchmarks. Section 4.5 further examines how the benefits of probing and allocation vary with the search budget, helping clarify when these components are most useful.
Critical weaknesses
-
The budget-matched comparison does not fully separate the benefits of state recovery from those of budget reallocation.
In Table A4, the baselines continue attempting already-solved tasks, whereas TaP concentrates additional search on unsolved tasks. The observed gap may therefore reflect both intermediate-state recovery and differences in budget allocation. Would TaP retain its advantage if the baselines also preserved successful solutions and redirected the remaining budget to unsolved tasks? Alternatively, do existing control experiments show that intermediate-state recovery provides additional benefits beyond budget reallocation?
-
It is unclear whether the text-only control changes only how trajectories are reused.
Table 2 compares TaP with text-only experience, but it is not clear whether this variant retains the same recovery-point selection, probing, and attempt-allocation rules, replacing only program replay with re-execution based on textual records. If these search rules also change, the performance gap cannot be attributed specifically to accurate restoration of previous states rather than differences in search strategy.
-
The distinction from prior recovery methods should be made more explicit.
RePoT: Recoverable Program-of-Thought via Checkpoint Repair already preserves valid prefixes through verified replay and repairs suffixes from verified states. The paper should clarify its additional contributions in recovery-point selection, probe-guided allocation, and reuse of successful programs across evaluation passes. This is primarily a related-work positioning issue and does not independently justify rejection.
Questions for authors
-
Is there a control that separates the benefits of intermediate-state recovery from those of budget reallocation?
For example, a baseline could preserve successful solutions and spend the remaining budget only on unsolved tasks, allowing a comparison between restarting from the initial state and using TaP. Other existing experiments that distinguish these two effects would also be helpful.