- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper presents MATE, a post-training method for unified multimodal models. The generation and understanding branches take turns producing inputs for each other. After filtering candidates for consistency with the source, the method selects the candidate that the other branch performs worst on and updates that branch with GRPO. The selected candidates then become the source inputs for the next epoch. On Janus-Pro-1B, MATE improves GenEval by 2.4 points, DPG-Bench by 1.7 points, and the average over nine understanding benchmarks by 0.7 points. The paper also evaluates consistency over repeated image-text cycles.
Critical strengths
-
The method is straightforward and makes good use of having generation and understanding in the same model. Selecting valid examples that the other branch struggles with is a reasonable way to focus training, and passing these examples into the next epoch gives a concrete mechanism for adapting the training data. The procedure is clearly described and does not require training a separate adversary.
-
The results show improvements in both generation and understanding, rather than improving one at the expense of the other. MATE outperforms the reimplemented UniRL and SUDER baselines on both generation benchmarks and the understanding average. I also appreciate that the paper explicitly acknowledges the small ablation differences and the overlap between the consistency reward and the round-trip evaluation.
Critical weaknesses
lack of computational comparison. MATE samples four candidates and up to eight rollouts per candidate, and training takes about 29 hours on six B200 GPUs. Sharing the optimizer, dataset, and batch size does not establish that the baselines have comparable sampling or training budgets. Without a compute-matched comparison, it is hard to judge whether MATE is a better use of resources than spending the same budget on a simpler post-training method. This matters particularly because the gains are relatively modest and the main results are limited to one base model.
Questions for authors
Could author report the rollout counts, reward-model calls, optimizer updates, and GPU hours for MATE and the main baselines? A comparison under a matched total compute budget would materially affect my assessment.
2 comments
Thank you for your reply, that solved my concerns.
Removal of the reward model. In the submitted version, we used a frozen external reward model to provide consistent scoring for stable training. To assess whether MATE’s gains depend on external supervision, we additionally trained it using its own cross-branch likelihoods as rewards, without an external reward model, and adopted this version as our main model in the revised paper. This changes the reward source while preserving MATE’s core mutual-challenge and data-evolution mechanisms.
W1&Q1
UniRL already uses more resources and SUDER does not gain with more compute. Our updated MATE uses rewards from the model itself without an external reward model. All three methods train Janus-Pro-1B for 1,040 steps on six B200 GPUs, with their computational costs reported below.
UniRL matches MATE’s sampled-sequence count and optimizer updates but consumes more GPU-hours because of its data construction recipe and performs worse on both generation and understanding averages.
SUDER uses four rollouts per prompt without candidate selection, resulting in lower computational cost. Matching MATE’s GPU-hours would require approximately 1.8× as much training; however, SUDER’s generation and understanding averages change by less than 0.1 points over the final third of training, suggesting limited benefit from extending the run.
We acknowledge that the methods’ different sampling procedures make it difficult to match training steps, rollout counts, and GPU-hours simultaneously.