- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes AutoRegressive Retriever (ARR), which repeatedly encodes the query and retrieved items to refine the query embedding without generating textual rewrites. SFT uses stepwise contrastive supervision and a degradation penalty, while RL learns feedback selection from the final reciprocal rank. Query-side LoRA keeps the item index fixed during RL. Results on M-BEIR and seven zero-shot benchmarks improve over the compared methods, with zero-shot gains already present before any feedback.
Critical strengths
-
Retrieval performance is strong, with ARR-RL-8B reaching 61.0 on M-BEIR and 79.01 on the zero-shot evaluation, exceeding the compared baselines.
-
The SFT and RL objectives are well designed. Stepwise supervision and the degradation penalty address query drift, while RL learns which feedback items improve the final ranking.
-
The ablations distinguish training-time feedback from inference-time refinement and show that simply appending retrieved content without appropriate training can hurt retrieval.
Critical weaknesses
-
My main concern is that comparisons with ELVA and TRACE use different initial models. ARR starts from the retrieval-pretrained Qwen3-VL-Embedding, but its original results are not reported. In particular, the zero-shot gains may reflect base-model differences rather than ARR's training. A same-initialization comparison with matched training budgets is needed to isolate ARR's contribution.
-
The core idea overlaps with [1], who already learn to refine query embeddings using retrieved multimodal feedback across multiple rounds. This work is not cited. Although ARR's architecture and losses differ, its added value over existing multimodal feedback refinement is not established.
-
Iterative inference adds only 0.38 points for ARR-RL-2B on M-BEIR and 0.59 points for ARR-RL-8B on zero-shot evaluation. A matched 8B single-step training control and end-to-end latency measurements are missing, leaving the training benefit and accuracy-cost trade-off unclear.
-
Results use one training seed, despite some differences being only 0.10 points. These small gains need an uncertainty analysis.
[1] Bulat Khaertdinov, Mirela Popa, and Nava Tintarev. A Little More Like This: Text-to-Image Retrieval with Vision-Language Models Using Relevance Feedback. WACV 2026.
Questions for authors
-
Can you report the original Qwen3-VL-Embedding results and compare ARR with ELVA or TRACE from the same initialization and training budget, including an 8B single-step control? Alternatively, can you train both ARR and ELVA from ELVA's embedding-pretrained checkpoint under matched training budgets?
-
How does ARR differ from the multimodal feedback refinement approach in [1]?
-
How does ARR compare with feeding the initial top-k retrieved items together and refining the query embedding only once, using the same backbone and matched training and input budgets?
-
What are the end-to-end latency and throughput for one, two, and four query states?
Please read the rebuttal and engage in discussion
Dear Reviewers,
The authors have posted their rebuttal. Please read it and engage in discussion, in particular:
Thanks for your time and contribution.
Best, Your AC