- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies credit assignment for multi-turn table agents trained with GRPO. The proposed method, TACO, assigns credit in two stages. Across turns, it compares each turn with turns from other rollouts that saw the same observation history, as in GiGPO. Within a turn, a periodically synchronized copy of the policy re-scores the code and answer tokens with hindsight context: the turn's execution feedback and a correct sibling trajectory. The teacher–policy log-probability gap then scales each token's advantage within a bounded range, with the sign set by the turn credit. Experiments train Qwen2.5-Coder-Instruct at 3B, 7B and 14B on TableInstruct and WikiTQ. They evaluate on TableBench and WikiTQ (in-domain) and FinQA and HiTab (out-of-domain). TACO improves the four-benchmark average over GRPO by 2.0–2.5 points and over the best credit-assignment baseline by 0.9–1.7 points.
Critical strengths
- Section 3 asks why existing credit methods underperform on code agents. The error taxonomy and the per-token credit comparison in Figs. 2–3 motivate the design directly.
- TACO needs no value model and no extra rollouts. Its only overhead is one gradient-free teacher pass, and inference cost is unchanged.
- Fig. 5 is useful as it keeps GiGPO's turn credit fixed and swaps only the source of the intra-turn signal. The hindsight-context study in Table 3 is also informative.
Critical weaknesses
-
Nothing in the method uses table structure. It relies on agents that write code, get deterministic execution and see informative printed output. Text-to-SQL agents, data-science notebook agents, math agents with a Python tool and coding agents all have that. So the "not designed for table agents" in the motivation doesn’t mark a real difference.
-
Appendix B.3 states that TACO without the intra-turn credit equals GiGPO. The only change is defining the anchor as the full observation history. The contribution list should credit this stage to GiGPO explicitly.
-
The intra-turn credit is incremental over self-distillation. SDPO (Hübotter et al., 2026) already conditions a self-teacher on runtime errors and a successful sibling's solution. The paper cites this, but mainly as motivation.
-
As reported in Section 5.4, the tasks considered in the experiments in this paper average up to 4 turns per task - this brings into question the effectiveness of turn-level credit assignment for short-horizon tasks and if the experiments demonstrate the effectiveness of the algorithm TACO proposed in this paper. The introduction cites ReasonTabQA and CompTab as motivation but never evaluates on them. Further lack of variance reporting makes it unclear whether a part of the gain is noise of experimentation.
-
Everything is on one model family (Qwen2.5-Coder) that is outdated.
Questions for authors
- How does TACO compare with SDPO-style training in the same multi-turn setup? What does the bounded, sign-from-A_t weighting add?
- What is the distribution of sibling-group sizes by turn index? What fraction of turns after turn 0 have a non-singleton group?
- How do gains over GRPO and GiGPO vary with the number of turns and operations per turn?