Region-R1: Reinforcing Query-Side Region Cropping for Multi-Modal Re-Ranking

Chan-Wei Hu, Zhengzhong Tu
4/7/2026
cs.CVcs.AIcs.CL

No official code found. Best implementation: taco-group/Region-R1 (3 stars, Apache-2.0, last commit 2026-04-08).

Abstract

Multi-modal retrieval-augmented generation (MM-RAG) relies heavily on re-rankers to surface the most relevant evidence for image-question queries. However, standard re-rankers typically process the full query image as a global embedding, making them susceptible to visual distractors (e.g., background clutter) that skew similarity scores. We propose Region-R1, a query-side region cropping framework that formulates region selection as a decision-making problem during re-ranking, allowing the system to learn to retain the full image or focus only on a question-relevant region before scoring the retrieved candidates. Region-R1 learns a policy with a novel region-aware group relative policy optimization (r-GRPO) to dynamically crop a discriminative region. Across two challenging benchmarks, E-VQA and InfoSeek, Region-R1 delivers consistent gains, achieving state-of-the-art performances by increasing conditional Recall@1 by up to 20%. These results show the great promise of query-side adaptation as a simple but effective way to strengthen MM-RAG re-ranking.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

[ACL 2026 Findings] Region-R1: Reinforcing Query-Side Region Cropping for Multi-Modal Re-Ranking

30Shell, PythonApr 8, 20266 months agoApache-2.0

Similar Papers

Cite this paper

@article{hu2026regionr,
  title  = {Region-R1: Reinforcing Query-Side Region Cropping for Multi-Modal Re-Ranking},
  author = {Chan-Wei Hu and Zhengzhong Tu},
  year   = {2026},
  eprint = {2604.05268},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2604.05268v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2604.05268.svg)](https://codeofpaper.com/paper/2604.05268)

Discussion