- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The work moves beyond fixed Rank- retrieval and asks how many identities should be returned for each query. The authors connect standard conformal scores to a similarity-margin formulation and use this margin to build query-adaptive identity sets without retraining the retriever. Experiments on several TPR models and datasets evaluate the trade-off between coverage and set size.
Critical strengths
1. Clear presentation.
The paper is reasonably well organized and easy to follow. The progression from the practical motivation, to the conformal analysis, and then to the margin-based method is presented in a relatively clear way.
2. Interesting motivation.
The paper looks beyond standard Rank- evaluation and considers the practical question of how many candidate identities should be returned for different queries. This is a meaningful direction that is less explored in existing TPR work.
3. Reasonable theoretical analysis.
The paper provides a clear analysis of the temperature dependence of LAC and APS and derives their common low-temperature connection to the similarity margin. The theoretical development is generally coherent and helps motivate the final construction.
4. Comprehensive experiments. The evaluation covers multiple frozen retrievers and three TPR benchmarks, and reports several metrics related to coverage and set efficiency. The paper also includes analyses of temperature behavior, query adaptivity, and different retrieval difficulty groups.
Critical weaknesses
1. Mismatch Between the Query-Ambiguity Motivation and the Actual Adaptation Mechanism
The paper motivates adaptive identity sets from the perspective of query ambiguity, arguing that ambiguous queries should return larger sets while distinctive queries should return smaller ones. However, the proposed method never explicitly estimates query ambiguity. Instead, the set size is determined entirely by the similarity profile produced by the frozen retriever, through the margin between each identity and the top-ranked identity. Therefore, the method is more accurately adapting to retriever uncertainty or score crowding rather than to query ambiguity itself. These two factors are not necessarily equivalent, and the current experiments do not establish a clear connection between them.
2. Limited Methodological Novelty
The final method is relatively straightforward: it calibrates the similarity gap between the target identity and the top-ranked identity on a held-out set, and then returns all identities within the calibrated margin at inference time. While the theoretical connection between LAC, APS, and the similarity margin is interesting, the resulting retrieval mechanism itself is essentially a calibrated thresholding rule over top-1 similarity gaps. The methodological contribution therefore appears limited relative to the development of this task.
3. Strong Dependence on the Identity-Level Max Aggregation
The identity similarity is defined as the maximum similarity over all gallery images belonging to that identity. This seems to discard the remaining observations of the same identity and makes the identity score potentially sensitive to a single spuriously high-matching image.
4. Strong Assumption of Known Gallery Identity Labels
The proposed formulation requires the gallery to be partitioned into identity groups in advance, since identity-level similarity is computed over all images belonging to each known identity. This assumption may be restrictive in practical person retrieval scenarios, where gallery identity labels are typically unavailable.
5. Unclear Practical Benefit of Adaptive Set Sizes
The practical advantage of returning query-dependent set sizes is not sufficiently justified. In many retrieval scenarios, the user has a fixed inspection budget, such as examining only the top-5 or top-10 candidates. Under such a setting, returning a larger set for difficult queries does not necessarily provide additional value: if the target falls outside the inspection budget, the retrieval is still effectively unsuccessful. Therefore, it is unclear under what practical setting the proposed adaptive identity set is preferable to a fixed top- retrieval protocol.
6. Gap Between the Low-Temperature Theory and Finite-Temperature Practice
The theoretical motivation for direct margin calibration relies on the limit , where transformed LAC and APS scores converge to the similarity margin. However, the practical LAC and APS baselines operate at finite temperatures selected by calibration. It is therefore unclear whether the fitted operating temperatures actually lie in a regime where the margin provides a close approximation.
Questions for authors
Please refer to the Weaknesses section for the main concerns. I have a few questions that I hope the authors can clarify:
- The paper motivates adaptive identity sets in terms of query ambiguity, while the proposed method adapts only to the retriever’s similarity profile. Could the authors clarify why similarity-margin structure should be considered a reliable proxy for query ambiguity?
- The method assumes that gallery images are already grouped by identity and defines each identity using only its maximum image similarity. How realistic is this assumption in deployment, and how sensitive are the results to alternative identity-level aggregation strategies?
- The theoretical motivation relies on the limit, whereas LAC and APS are used at finite, calibrated temperatures in practice. Could the authors report how close the proposed Margin sets are to LAC/APS specifically at their selected operating temperatures?
Authors' rebuttal has submitted
Dear reviewer, this is a kind reminder that the authors have posted their responses to your reviews. Please review their rebuttal, engage in any necessary follow-up discussion with the authors, and confirm whether your concerns have been addressed by updating your review/scores. Thank you for you colaboration.