- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes CODA, a reinforcement learning framework for unified text-to-image generation that addresses ambiguous semantic credit assignment and sparse visual supervision. CODA introduces two components: Semantic Reasoning Guidance, which estimates the benefit of prompt optimization through paired generations with shared randomness, and Masked Trajectory Guidance, which evaluates visual token commitments against alternative commitments and weights their outcome differences using KL-based distributional influence. Experiments on GenEval, T2I-CompBench, and WISE demonstrate substantial improvements over the Show-o baseline.
Critical strengths
The paper addresses an important limitation of outcome-based RL for unified image generation, where semantic reasoning and visual generation decisions receive the same trajectory-level reward despite their different contributions.
Critical weaknesses
CODA incurs substantial computational overhead from additional counterfactual rollouts. Without training-cost analysis or compute-matched comparisons with standard outcome-based RL, it remains unclear whether the improvements stem from better credit assignment or increased sampling budgets.
Questions for authors
How does CODA compare with Mask-GRPO or outcome-only RL under matched GPU-hours or total sampling budgets?
3 comments
Thanks for your rebuttal. I maintain my positive score.
We sincerely thank the reviewer for the positive feedback. Your comments are very valuable for improving our work. We will ensure that these revisions are incorporated in the subsequent version. We sincerely appreciate your time and effort in supporting the review of our paper.
Evaluating CODA under matched computational budgets
Q1. Comparison under matched GPU-hours or sampling budgets
We thank the reviewer for raising this important concern. To ensure a fair comparison, we evaluate CODA against GRPO, Mask-GRPO, and outcome-only RL using the same Show-o 1.3B backbone, training data, and evaluation settings, with a matched budget of 80 GPU-hours. GRPO and Mask-GRPO are algorithm baselines. The outcome-only ablation retains CODA's visual-update formulation and uses only Lout supervision on visual actions. Its rewriter is the shared Show-o model, matching Table 4 and our response to Reviewer gKdN.
Notably, GRPO, Mask-GRPO, and outcome-only RL reach their best performance with less training time than CODA. Extending their training to the matched budget yields no substantial further improvements, suggesting that their performance has largely saturated. In contrast, CODA achieves 84.25% under the same 80 GPU-hour budget, outperforming GRPO, Mask-GRPO, and outcome-only RL by 9.64pp, 5.67pp, and 12.10pp, respectively. These results demonstrate that CODA provides consistent performance gains beyond simply increasing training computation, highlighting the effectiveness of its contrastive semantic and visual process supervision.