- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes OPR-EMBED, which is a reasoning-enhanced UME model with a single MLLM serving as both the reasoner and student. The main contribution is to replace the existing SFT stage with on-policy distillation (OPD), followed by the GRPO stage similar to UME-R1.
Critical strengths
I don't feel there are critical strengths from the paper.
Critical weaknesses
- Novelty. The biggest contribution claimed by the paper is the data-free OPD stage, which replaces SFT. However I do not feel this is particularly novel. Besides OPD, the GRPO stage seems to be directly adopted from UME-R1.
- Limited gain. In table 1 OPR-EMBED barely outperforms MMEmb-R1 (+0.008), and this margin can be even smaller if we consider the two eval sets bugs which is fixed in this work but not in the previous ones (https://github.com/TIGER-AI-Lab/VLM2Vec/issues/167). Each component's gain is also marginal. For instance, the proposed attentive OPSD vs OPSD has 0.005 improvement, with GRPO it's +0.001, and with the proposed verifier it's +0.002. These marginal improvements do not justify the design.
- Limited ablations. There is no ablation on the OPD's effect on the final accuracy after GRPO stage, and little ablations on each design choices of OPD stage. Also, there is no analysis on failure cases (for instance, it seems that the model performs particularly poor on video tasks compared to previous works).
Questions for authors
Please see weaknesses.
Thank you for reading our paper and for your comments and suggestions. We address your concerns below.
W1. Novelty and contribution
We respectfully disagree with the characterization of our work as merely "replacing SFT with OPD, followed by GRPO." We first identify and analyze the trajectory gap in joint training, then develop a training scheme around this diagnosis, which is a central empirical contribution of the paper.
Figure 1 shows that Oracle-CoT SFT achieves 54.0 with self-generated reasoning, below Self-CoT SFT's 61.3, despite the stronger annotation model and verification used for Oracle CoTs. This comparison holds initialization, training pairs, the joint objective, and optimization settings fixed. Supplying target-assisted Oracle trajectories to the same Oracle-SFT checkpoint raises the score to 78.1 without updating parameters or changing the encoder and embedding readout. This separates the ability to exploit supplied reasoning from the ability to generate reasoning that supports retrieval. Appendix B.3 provides complementary evidence: the Oracle-trained model has a larger train-to-self NLL gap than the Self-CoT-trained model (0.58 versus 0.08 nats).
To address this gap, we jointly supervise reasoning and embeddings on the same current-student trajectories. The teacher evaluates the student's own prefixes rather than providing a fixed corpus to imitate, while embedding-readout attention weights token-level supervision toward the final representation. This connects the diagnosis to the training design and removes the separate offline CoT generation and curation pipeline.
Stage II also goes beyond directly adopting UME-R1: building on GRPO and retrieval rewards, we introduce candidate-match feedback to adjust trajectory advantages and withhold positive credit from mismatched trajectories (Eqs. 8-9). Retrieval rewards assess embedding rankings but do not directly evaluate rationale-target matching. The verifier addresses this distinction, and the constraint is applied to advantages because penalizing rewards alone need not prevent a rejected trajectory from receiving positive group-relative credit. Together, the two stages tailor token-level supervision and trajectory-level credit assignment to retrieval.
W2. Performance gains and evaluation versions
The final margin over MMEmb-R1 and the incremental gains from subsequent components do not fully capture this work's contribution. Identifying and analyzing the trajectory gap has independent empirical value; our method experiments further show that competitive retrieval performance can be achieved without pre-built CoT annotations.
Against our own no-CoT control, Overall improves from 61.1 to 65.8. Basic OPSD alone reaches 65.0, accounting for the main gain; attention and verifier guidance further refine supervision. These components refine the core on-policy training scheme through retrieval-specific supervision. The practical result is a competitive reasoning embedder trained without an offline CoT annotation pipeline. The verifier is used only during training and adds no query-time inference cost.
Regarding the evaluation bug, the benchmark maintainers released the fixes on November 4, 2025, before MMEmb-R1 appeared on arxiv in April 2026. Because its code and checkpoints have not been released, we cannot independently verify which evaluation version it used. It is therefore not justified to assume that it used the old evaluation or to infer that our margin over it would shrink on that basis.
W3. Ablations and failure cases
Thank you for your suggestions on additional ablations and failure-case analysis.
Table 2 compares uniform and attentive OPSD, while Table 4 examines removing OPD, target access, and teacher capacity. Removing the OPD objective lowers Overall from 65.5 to 62.7 and produces 100% truncation, whereas removing target access retains 64.9. These results help distinguish the role of on-policy language supervision in maintaining generation from the additional guidance provided by the paired target.
We further tested target access with three seeds per setting: Overall is 65.01 +/- 0.06 without target access and 65.49 +/- 0.05 with it (mean +/- across-seed SD), supporting a stable additional gain of 0.48 points.
Regarding OPD's effect on final performance after GRPO, Table 2 reports continued GRPO training from attentive OPSD. We would appreciate your suggestions on where additional ablations would strengthen the evidence, and welcome further discussion. And we will add failure-case analyses in the revision.