- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
Question answering over high-resolution images requires fine-grained evidence from pictures far larger than the model input, and the common recipe is to let the model look again at a single local region. The paper proposes a parallel inspection framework. The main model first splits the current image into a grid and dispatches a question-conditioned reader to every tile in parallel, gathers the evidence records they return, and then decides whether to zoom into a region for a closer look before answering. The same interface is used both for direct inference and for post-training, where the sub-model's region supervision is synthesized from two data sources and the main and sub models are trained with supervised fine-tuning and paired role-specific reinforcement learning. On several high-resolution visual-search benchmarks the paper compares against a baseline that only views a single region, reports paired uncertainty and an analysis of the training objective, and finds that parallel inspection combined with zoom-in re-examination gives higher accuracy at the same model size.
Critical strengths
- The paper discloses the limits of its own evidence far more completely than is common in submissions of this scale.
Critical weaknesses
Writing:
- Poor presentation: The paper contains excessive whitespace and fails to fill the full 9-page limit. The main text is cluttered with trivial details and overly defensive writing, raising suspicions that it may be unreviewed AI-generated content.
- Insufficient experiments: Despite extensive prior work in this direction, the paper lacks comparative experiments against these existing baselines.
Methodology:
- Limited novelty: The core insight of employing a multi-agent search framework to address fine-grained perception has been extensively explored in prior literature. This work offers only incremental improvements over existing methods.
- Missing efficiency analysis: The proposed multi-agent search approach inherently introduces computational overhead, yet the paper provides no latency or runtime analysis to evaluate its practical cost.
Questions for authors
Please see weakness