- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper proposes T-GVR, which asks a model to generate a task category, task type, and constraints before answering. These predictions are matched against offline annotations to provide an auxiliary reward alongside answer-level feedback. The method is evaluated on reasoning, tool-use, and open-ended generation tasks.
Critical strengths
Improving supervision beyond final-answer correctness is a useful problem. The structured task description and one-to-one constraint matching are straightforward design choices, and the experiments cover several task domains.
Critical weaknesses
-
The method is not described clearly enough to establish what is actually being compared. Section 3.4 disables answer-level rewards when deterministic verification is unavailable, while Appendix A.4.6 enables them for open-ended tasks using a separate evaluator. What rewards and evaluators are used in those experiments?
-
The main contribution is not sufficiently isolated. The method combines a task-analysis prefix, additional annotations, and auxiliary rewards. It is unclear whether the RLVR baseline generates the same prefix. A comparison using the same prefix with outcome reward alone is needed to establish the benefit of the proposed reward.
-
The choice of category, type, and constraints is weakly justified. The TACO ablations show performance drops, but do not clearly explain what was removed or how reward weights were adjusted. They also do not establish why this representation is preferable to ordinary task analysis.
-
The evidence does not support the broader claims of reliable, general task understanding. Lexical similarity does not establish semantic correctness, the key results lack training-run variability, and BLEU/ROUGE provide limited evidence of improved empathy.
Questions for authors
See weaknesses.
rebuttal
We thank the reviewer for the detailed feedback.
Q-1: What rewards and evaluators are actually used for open-ended tasks?
A-1: We clarify that open-ended tasks use rubric-based answer rewards evaluated by an independently deployed, frozen Qwen3-8B judge. The judge operates in a separate vLLM process, and policy/LoRA updates are never synchronized to it. Meanwhile, the proposed reference-matching reward RU remains deterministic and requires no online judge inference. Thus, the model-call-free property applies specifically to RU, not the entire training pipeline. We will correct the inconsistency in Section 3.4.
Importantly, the direct Rubric-only baseline uses the same training examples and policy initialization. On WebNovelBench, T-GVR improves Reward from 0.3992 to 0.5108 and Percentile from 0.1165 to 0.3571, demonstrating the additional value of structured task supervision under the reported evaluation protocol.
Q-2: Is the contribution sufficiently isolated from the structured prefix?
A-2: The distinction is fundamental: generating a task-analysis prefix does not guarantee that the identified requirements are correct. T-GVR explicitly evaluates this intermediate representation against offline references and incorporates the resulting feedback into RL optimization. Thus, the contribution is not merely adding a reasoning prefix, but making requirement identification a directly rewarded objective.
The TACO ablations demonstrate that removing individual supervision components substantially reduces complete-program correctness. While a same-prefix control would isolate the reward contribution more precisely, the existing evidence supports the effectiveness of the proposed framework rather than mere prompting.
Q-3: Why Category, Type, and Constraints? How are ablations implemented?
A-3: The three components serve complementary purposes: Category identifies the broad task domain, Type specifies the fine-grained objective, and Constraints capture instance-specific requirements. This decomposition enables exact verification of predefined labels and flexible alignment of variable-length requirements, which ordinary free-form task analysis does not directly provide.
TACO ablations use group-wise redistribution rather than simply zeroing coefficients:
Corresponding prompt fields and format checks are also removed where applicable, while the outer reward weights remain 0.1/0.8/0.1.
The ablations reveal a meaningful distinction between partial and complete correctness. Removing Constraints preserves much of Case Accuracy (0.2854 vs. 0.2698) but reduces Program Accuracy from 0.0990 to 0.0588. Removing Matching similarly reduces Program Accuracy to 0.0580 despite higher Case Accuracy. These results support the role of constraint supervision and alignment in satisfying complete task specifications.
Q-4: Is there sufficient evidence for generality and reliability?
A-4: T-GVR's generality concerns the applicability of a shared reward-construction mechanism across heterogeneous tasks, rather than a claim of perfect semantic verification. The framework is evaluated on five benchmarks spanning mathematical reasoning, code generation, tool use, empathetic dialogue, and creative writing.
The improvements are not limited to lexical evaluation: T-GVR exceeds RLVR on Dapo-Math (0.4785 vs. 0.3955), TACO Program Accuracy (0.0990 vs. 0.0610), and BFCL V4 (0.4094 vs. 0.3105). It also outperforms Rubric-only on WebNovelBench and improves BLEU-1 and ROUGE-L on EmpatheticDialogues. These results provide consistent evidence of usefulness across distinct task settings and evaluation mechanisms. Broader model coverage and multi-seed evaluation would strengthen statistical generalization claims, but do not invalidate the observed results.