- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Q-REACT, a test-time query embedding adaptation method for visual document retrieval. The approach learns query-dependent low-rank residual transformations from limited reranker feedback while keeping the retrieval encoders and document index frozen. It further incorporates document-context scoring and full-index distillation to improve retrieval performance. Experiments on eight ViDoRe V3 tasks with five multimodal retrieval backbones demonstrate improvements over direct reranking and TTT-Embed across different feedback budgets.
Critical strengths
1.The paper addresses an important problem: improving retrieval performance with limited reranker feedback without modifying pretrained encoders or rebuilding document indexes. This setting is particularly relevant to proprietary embedding APIs and large-scale retrieval systems.
2.The experiments cover eight ViDoRe V3 tasks, five retrieval backbones, and multiple feedback budgets and reward models. Q-REACT achieves substantial improvements over direct reranking and TTT-Embed.
Critical weaknesses
1.The proposed query-dependent low-rank residual, Δ(x)=BAx/√r, is essentially a shared low-rank linear transformation with a fixed transformation matrix after adaptation. Prior methods have explored more explicitly conditioned retrieval transformations. For example, QuARI (NeurIPS 2025) employs a hypernetwork to generate query-specific low-rank projections, while CAST (CVPR 2026) introduces context-conditioned latent space transformations for interactive retrieval. Although their tasks and training settings differ from Q-REACT, these studies are closely related to its central transformation mechanism. The paper does not adequately discuss these connections or compare against simpler, parameter-matched transformation alternatives, making the novelty of the proposed representation adaptation less convincing.
Related papers:
QuARI(NIPS 2025)https://papers.neurips.cc/paper_files/paper/2025/file/5ae6634cb92414dc34d24e863e8d0809-Paper-Conference.pdf
2.The authors motivate the proposed low-rank transformation by arguing that a fixed residual vector cannot adequately accommodate heterogeneous query intents. However, this primarily motivates a more expressive parameterization rather than explaining why transforming query embeddings is an effective solution to the underlying retrieval problem. The paper does not clearly identify specific semantic or geometric misalignments in the frozen query–document embedding space, nor does it explain why the required corrections should be captured by a shared low-rank linear mapping. Although the ablations demonstrate empirical improvements over fixed residuals, they provide limited insight into the underlying mechanism.
3.The paper argues that full-index normalization improves retrieval by introducing competition from unscored pages. However, Table 3 shows that, with document context enabled, full-index normalization improves the Task setting by 1.14 points but reduces the Global setting by 0.38 points compared with Top-10 normalization. Moreover, the full-index objective encourages the rewarded Top-K candidates to receive greater probability mass, implicitly treating unscored pages as competitors despite their potentially containing relevant documents. This introduces a possible false-negative issue. The paper lacks sufficient empirical analysis of this assumption, particularly across sparse feedback budgets.
Questions for authors
1.How does the proposed low-rank query transformation fundamentally differ from existing query-adaptive retrieval methods such as QuARI and CAST? Why are these closely related studies not discussed, and could the authors provide comparisons with parameter-matched query transformation baselines?
2.Beyond increased representational capacity compared with a fixed residual vector, what specific limitations of the frozen query–document embedding space motivate the proposed transformation? Could the authors provide empirical evidence that the learned mapping addresses particular semantic or geometric misalignments?
3.Table 3 shows that full-index normalization underperforms Top-10 normalization in the Global setting. Why is full-index normalization adopted for both sharing modes? How does its effectiveness change under sparse feedback, especially when initially unscored pages may be relevant?