- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies interactive person re-identification, where follow-up questions progressively enrich an initially incomplete description. It proposes PAIReID with two components: a Progressive Query-Aligned Retriever, which learns low-rank text-encoder adaptations from progressive query states and mixes them through a query-conditioned router; and a State-Aware Reflective Questioner, which maintains structured attribute coverage, checks candidate-image visibility, and selectively redirects unsuitable questions without task-specific questioner fine-tuning. Experiments on Interactive-PEDES show promising interactive retrieval performance, while evaluations on three additional person-retrieval benchmarks and component ablations provide further evidence of applicability.
Critical strengths
-
The framework connects query-dependent retrieval adaptation with explicit tracking of unresolved appearance information. These address complementary aspects of the interaction loop, making the overall design relevant to the task rather than a collection of disconnected modules.
-
The retriever mixes complete low-rank updates within the text encoder while keeping the visual branch frozen. This permits query-dependent reconfiguration without recomputing gallery embeddings, and avoids the cross-expert terms that would arise from separately mixing the low-rank factors.
Critical weaknesses
-
The experiments do not sufficiently establish the need for progressive, query-dependent alignment. Table 3 lacks a single adapter trained on pooled progressive queries, and uniform anchor mixing already accounts for much of the reported improvement. Moreover, round-indexed hard selection is compared against semantic soft mixing, changing both the conditioning signal and composition mechanism. Consequently, the results do not clearly distinguish evolving-query adaptation from additional training or adapter aggregation.
-
The reflective pipeline introduces forced refinement, deterministic validity checks, regeneration, and a canonical fallback. Table 4 does not explain which safeguards remain active without reflection or compare against a rule-based rejection/regeneration baseline. Since candidate-conditioned redundancy filtering already exists in prior work, the current evidence does not establish how much benefit specifically requires the proposed Reflector.
Questions for authors
-
How does the proposed retriever compare with a single LoRA adapter trained on pooled progressive queries and with a round-conditioned soft mixture using the same anchors? Are the questioning policy and dialogue trajectories held fixed in Table 3 so that retrieval adaptation can be assessed separately?
-
When reflection is disabled in Table 4, which deterministic safeguards remain active? Can a rule-based validity filter followed by regeneration, using the same generator and comparable inference budget, recover the reported reflection benefit?
-
Section 3.2 and Appendix A.2 allow partially specified factors to remain eligible for refinement, whereas Appendices A.4–A.5 redirect or prohibit previously queried factors. With an "asked" flag stored at the appearance-group level, it is unclear how an incomplete answer about a bag can be followed by a question about its unresolved properties. This ambiguity concerns a central capability motivating the method. Can an already queried appearance group remain eligible when its answer is only coarse-grained? Please specify the precedence between "asked" and "fact_type" and show a concrete state transition in which an incomplete bag description is subsequently refined.
4 comments
Response to the Reviewer o8Es(2/2)
Q3: State-Guided Refinement and Query Eligibility
(1) Clarification of eligibility. We thank the reviewer for identifying this ambiguity. Our coverage state distinguishes information granularity (fact_type) from questioning history (asked). Specifically, asked=yes records a prior targeted inquiry rather than complete attribute knowledge. Under the current group-level policy, asked takes precedence over fact_type in determining eligibility for further targeted questioning.
(2) Illustrative state transition. An initial description of "carrying a bag" corresponds to (asked=no, fact_type=coarse), allowing a targeted question such as "What type of bag is the person carrying?". An answer such as "A black backpack" enriches the description and updates the state to (asked=yes, fact_type=fine). Even if the answer remains coarse, the group is no longer eligible for another targeted inquiry. Thus, our method supports refinement of initially coarse descriptions, but not repeated property-level refinement within an already queried group.
Under a limited interaction budget, our coverage state guides the refinement of initially incomplete descriptions while distributing questioning opportunities across appearance groups. This conservative strategy is intended to reduce repeated questioning and broaden appearance coverage. We will revise Section 3.2 and Appendices A.2–A.5 to clarify the eligibility rules and their scope. Repeated property-level refinement remains a possible extension of our current framework.
I thank the authors for for providing these additional experiments and explanations in the rebuttal. My questions about retrieval ablation and reflective questioner compared with rule‑based baselines are mostly solved by new experiment results. The authors also explain how the asked flag and fact_type work in state transition. But the proposed method still has one inherent limitation: it can not do further fine‑grained refinement for an appearance group that has already been queried. Besides, some misleading descriptions of ablation in the original paper need to be revised carefully. Considering these remaining problems, I will keep my original score.
Response to the Reviewer o8Es
We sincerely thank the reviewer for recognizing our additional experimental results and clarifications. We particularly appreciate this insightful observation, which raises an important question about the trade-off between within-group refinement and broader appearance coverage.
(1) Practical relevance of within-group refinement. In interactive person Re-ID, we observe that even when models are allowed to revisit previously queried appearance groups, scenarios requiring such revisits appear to be relatively rare. Specifically, we conduct a rule-based analysis of 7,373 five-round dialogues (36,865 questions) from our reproduced LLaVA-ReID baseline, where within-group refinement is permitted. A same-group revisit is defined as a question targeting an appearance group that has already been queried within the same dialogue.
Table R1. Within-dialogue question revisit statistics in LLaVA-ReID.
| Metric per Question | Rate (%) |
|---|---|
| Same-group revisits | 3.11 |
| 1st same-group revisit question | 3.07 |
| 2ed same-group revisit question | 0.04 |
| Exact or paraphrased repeats | 0.11 |
Even without hard group-level exclusion, only 3.11% of questions revisit previously queried appearance groups, with second revisits accounting for merely 0.04% of all questions. These observations support our decision to restrict within-group revisits and prioritize broader appearance coverage, with the aim of improving retrieval accuracy across a wider range of queries under a limited interaction budget.
(2) Empirical effectiveness of our design. Furthermore, despite this restriction, the ablation studies in Table 4 and our additional comparisons with rule-based baselines demonstrate the overall effectiveness of our state-aware reflective questioning mechanism. In particular, our full method outperforms Rule + Regeneration by 5.48/2.59 percentage points in R@1/mAP. Together, these results support the practical value of our current design, while leaving selective within-group refinement as a potential direction for further improvement.
We will incorporate this additional analysis and explicitly discuss the limitation in the revised manuscript. We sincerely hope that these empirical findings and clarifications address the reviewer's remaining concern and further strengthen their confidence in the rationale and effectiveness of our approach.
Response to the Reviewer o8Es(1/2)
Thank you for your insightful review and valuable feedback. We address your key concerns in detail below and provide additional clarification to further demonstrate the effectiveness of our proposed approach.
[W1, Q1]: Retriever Comparisons under Fixed Dialogue Trajectories
(1) Controlled evaluation. Yes, both the questioning policy and dialogue trajectories are held fixed in Table 3. All retriever variants are evaluated on identical initial descriptions and accumulated question–answer histories at each round, isolating retrieval adaptation from differences in information acquisition.
(2) Additional comparisons. Following the reviewer's suggestion, we evaluate (i) a single LoRA adapter trained on pooled progressive queries from Rounds 0–5 and (ii) a round-conditioned soft mixture using the same six alignment anchors, under the identical fixed-dialogue protocol.
Under zero-shot questioning, queries at the same round may differ in their semantic composition and granularity. Unlike pooled LoRA, which applies a shared adaptation, or round-conditioned mixtures, which assign shared mixture weights within each round, our router enables query-specific alignment through semantic anchor composition. Our method outperforms these two alternatives by 1.22/0.71 and 0.68/0.62 percentage points in R@1/mAP, respectively. These results support the benefit of conditioning retrieval adaptation on query semantics rather than interaction rounds alone.
[W2, Q2]: Effectiveness of Reflection Beyond Deterministic Safeguards
(1) Clarification of the original ablation. We acknowledge that Table 4 did not sufficiently distinguish reflection from its associated deterministic safeguards. Specifically, Coverage w/o Reflection retains structured memory construction, visual gating, and answer processing, but bypasses both the runtime question-validity guard and generator coverage fallback. Thus, the original ablation evaluates their joint removal rather than reflection alone. We will clarify this distinction in the revised manuscript.
(2) Additional controlled comparisons. Following the reviewer's suggestion, we evaluate two reflection-free alternatives using the same generator: (i) Rule-only, applying deterministic validity checks followed by template fallback; and (ii) Rule + Regeneration, allowing up to four generation attempts under the same validity checks and fallback mechanism.
The regeneration baseline averages 3.05 generator calls per query-round, with a nominal maximum output allowance of 512 tokens, comparable in configuration to that of the full method.
Questions satisfying predefined constraints may still provide limited information for subsequent retrieval. Unlike deterministic filtering and regeneration, which enforce rule compliance, our reflection mechanism additionally evaluates contextual relevance, semantic redundancy, and visual support. Although regeneration reduces the fallback rate from 73.44% to 59.30%, it improves R@1 by only 0.35 percentage points, while our full method outperforms it by 5.48/2.59 percentage points in R@1/mAP. These results support the benefit of contextual semantic verification beyond deterministic validity checks and repeated generation.