- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes GEAR, a training-free framework for 3D object retrieval that exploits unlabeled gallery structure through transductive diffusion. It adopts an offline-online pipeline consisting of gallery centering, multi-scale neighborhood refinement, single-query calibration, and anchored score diffusion. GEAR enables independent query processing without downstream training or gradient optimization. Experiments on four open-set 3D retrieval benchmarks demonstrate consistent improvements across multiple pretrained backbones, with additional evaluations on point-cloud, cross-modal, and scene-level retrieval tasks.
Critical strengths
- GEAR addresses a practical setting where gallery objects are available in advance while queries arrive independently. Its offline-online design avoids batch-query dependencies and enables efficient single-query retrieval without downstream training.
- GEAR consistently improves frozen representations across CLIP, DINOv2, and DINOv3. It also achieves competitive or superior performance compared with supervised adaptation methods such as DEC (CVPR 2026) and transductive methods such as TeDA in the reported settings.
- The paper provides extensive ablation studies, parameter sensitivity analyses, statistical evaluations, and efficiency measurements. The unified hyperparameter configuration across datasets and backbones is appreciated. Additional experiments on different retrieval tasks further demonstrate the flexibility of the framework.
Critical weaknesses
- The main components of GEAR are closely related to established techniques, including query expansion, database-side augmentation, and graph diffusion. However, comparisons with these classical training-free retrieval methods are missing. The related work also overlooks several recent studies, such as Source-Free Model Adaptation for Unsupervised 3D Object Retrieval (TVCG 2025), Uni-Adapter (AAAI 2026), and PASR (CVPRF 2026), although their task settings differ from GEAR.
- The proposed anchored diffusion provides only marginal improvements (+0.34 mAP points), while ordinary diffusion achieves better mAP (68.74 vs. 68.53) at the default L=2 (Table 9). Similarly, Multi-K refinement slightly underperforms single-K refinement (66.66 vs. 66.71 mAP, Table 7), despite additional computation. These results raise concerns about the necessity of these components.
Questions for authors
- Could the authors provide comparisons against established training-free retrieval enhancement methods, such as QE, DBA, and conventional graph diffusion or re-ranking, using identical frozen descriptors? What are the main methodological advantages of GEAR over existing offline-online diffusion frameworks?
- Given that ordinary diffusion outperforms iterative anchoring at L=2, what justifies choosing anchored diffusion as the default strategy? Similarly, since Multi-K refinement does not consistently outperform single-K refinement, could the authors provide a more detailed accuracy-efficiency analysis to justify its additional computational cost?
- Could the authors clarify whether GEAR and DEC follow identical rendering, feature extraction, and evaluation protocols? Can additional backbone-matched comparisons be provided, particularly with stronger DINO representations? Furthermore, would applying GEAR to DEC-adapted representations yield additional improvements, thereby supporting its claimed plug-and-play generality?
8 comments
Response to Reviewer L38M [2/4]
Weakness 2 and Question 2: Justification of Multi-K and Anchored Diffusion [1/2]
Regarding Multi-K: Neighborhood-Scale Heterogeneity and Accuracy-Efficiency Trade-off
Thank you for your constructive comments. Our choice of Multi-K is motivated by heterogeneous neighborhood structures within real-world galleries, where incoming queries may target objects with different amounts of reliable neighboring support. We examine whether multi-scale refinement offers practical benefits that justify its additional offline computation.
1. Neighborhood-scale heterogeneity. Different gallery regions favor different refinement scales. Multi-K independently refines representations at multiple scales before fusion, rather than relying on a single trajectory. Density-stratified analyses reveal the following preferences:
| Gallery Density | Low | Medium | High |
|---|---|---|---|
| 3 | 1 | 1 | |
| 6 | 5 | 0 | |
| 0 | 2 | 5 | |
| 3 | 4 | 6 |
Number of backbone-dataset settings where each Single-K achieves the highest mAP. Density groups are determined from frozen gallery features; labels are used only for post-hoc evaluation.
Smaller scales are preferred in 9/12 low-density settings, while larger scales are favored in 11/12 high-density settings. A complementary mixed-gallery experiment confirms that these opposing preferences coexist within the same gallery: outperforms by +0.964 mAP points in the 24-object group, whereas outperforms by +0.884 points in the high-capacity group. These findings show that similar aggregate mAP can conceal distinct local refinement requirements.
2. Cross-dataset scale selection and practical applicability. In heterogeneous asset libraries, future queries may originate from any gallery region, making reliance on a single neighborhood scale potentially restrictive. Multi-K integrates complementary scale-specific refinement trajectories into a unified gallery representation without requiring target relevance labels for regional scale selection. Under leave-one-dataset-out (LODO) validation, Multi-K improves mAP over the selected Single-K by +0.134, +0.149, and +0.220 points for CLIP, DINOv2, and DINOv3, with a positive paired 95% confidence interval on DINOv3 [+0.098, +0.347].
3. Accuracy-efficiency trade-off. The central consideration is whether multi-scale refinement's additional computation affects practical retrieval efficiency. We compare Single-K and Multi-K using matched implementations on ModelNet40 with 9,329 gallery objects and DINOv2.
| Method | mAP (%) | Offline Preparation | Online P50 (ms) | Final Cache |
|---|---|---|---|---|
| Single-K () | 74.41 | 12.56 s | 4.99 | 29.28 MiB |
| Multi-K | 74.40 | 58.07 s | 4.90 | 29.27 MiB |
Multi-K requires approximately 4.6× the offline preparation time, but this additional computation does not increase online inference cost. The independently refined representations are fused into a single gallery representation offline. Once cached, each query uses this unified representation without executing multiple scale-specific refinement branches. Consequently, online latency remains approximately 5 ms per query, with virtually identical cache requirements.
This separation matches GEAR's practical retrieval setting: the gallery is prepared in advance, while queries arrive independently over time. For relatively stable galleries serving repeated queries, multi-scale preparation is performed once and reused across subsequent retrievals. In return, the gallery representation integrates structural information from multiple neighborhood ranges without relying on a single scale for all objects. The trade-off is less favorable for frequently changing galleries that require repeated preparation.
Overall, Multi-K deliberately allocates additional offline computation to integrating heterogeneous neighborhood structures into a reusable representation while preserving efficient online single-query retrieval. The density-stratified and cross-dataset analyses support this design, even though Multi-K does not consistently improve aggregate mAP over . We will incorporate these analyses and computational measurements into the revised Appendix.
Response to Reviewer L38M [3/4]
Weakness 2 and Question 2: Justification of Multi-K and Anchored Diffusion [2/2]
Regarding Anchored Diffusion: Top-Rank Preservation and Robustness
Thank you for your valuable feedback. Our choice of anchoring reflects a deliberate trade-off between aggregate ranking accuracy and top-rank reliability. In practical single-query 3D asset retrieval, users typically inspect the highest-ranked results first. Although graph propagation can improve overall ranking, unreliable connections may also overturn initially correct top-ranked results. Anchored diffusion addresses this by reintroducing the initial query scores at each propagation step, limiting harmful score drift while retaining the benefits of gallery structure. We conducted controlled experiments to evaluate this design choice.
1. Top-Rank Preservation. We compare ordinary and anchored diffusion at the submitted fixed .
| Backbone | Initial P@1 | Ordinary P@1 | Anchored P@1 | Ordinary mAP | Anchored mAP |
|---|---|---|---|---|---|
| CLIP | 84.84 | 78.79 | 84.60 | 65.85 | 65.65 |
| DINOv2 | 87.14 | 82.46 | 86.75 | 68.74 | 68.53 |
| DINOv3 | 87.71 | 82.47 | 87.95 | 68.07 | 67.96 |
Anchoring improves P@1 over ordinary diffusion by 5.81, 4.30, and 5.48 points, with all paired 95% confidence intervals above zero, while sacrificing only approximately 0.1–0.2 mAP points. Ordinary diffusion substantially reduces the initially strong P@1, whereas anchoring largely preserves it. Per-query analysis shows that anchoring protects 56, 39, and 45 initially correct top-ranked results disrupted by ordinary diffusion. Meanwhile, anchored diffusion still improves mAP over no diffusion by 0.35, 0.35, and 0.38 points. Thus, the marginal mAP trade-off yields a substantial top-rank reliability benefit while retaining the overall gains from graph propagation.
2. Robustness to Unreliable Graph Connections. To examine robustness to unreliable graphs, we keep the refined gallery, initial scores, and fixed, perturbing only the final graph. We evaluate random edge rewiring and wrong-class edge rewiring at a 25% perturbation rate using three fixed seeds.
| Backbone | Random Rewiring: Ordinary / Anchored | Wrong-Class Rewiring: Ordinary / Anchored |
|---|---|---|
| CLIP | 7.97 / 0.69 | 8.72 / 0.79 |
| DINOv2 | 7.81 / 0.64 | 8.57 / 0.71 |
| DINOv3 | 7.86 / 0.69 | 8.51 / 0.73 |
Values report mAP degradation relative to each method's clean graph; lower is better. All six paired confidence intervals for the reduction in degradation are positive.
Anchoring reduces mAP degradation by 7.17–7.93 points under these controlled perturbations, supporting its role in limiting the influence of erroneous graph connections on query-specific scores. Wrong-class rewiring is solely diagnostic; class labels are never required during inference.
3. Stability across Propagation Depths. We further evaluate depths of 1, 2, 5, 10, and 20 across 12 backbone-dataset settings. At the submitted fixed , anchored diffusion is only 0.015 mAP points below its post-hoc optimal depth on average, compared with 0.618 points for ordinary diffusion. This indicates substantially lower depth sensitivity, which is valuable for unlabeled galleries where target-label-based depth selection is impractical.
Overall, we retain anchored diffusion because its small sacrifice in aggregate mAP provides measurable benefits in top-rank accuracy, resistance to erroneous graph propagation, and fixed-depth stability. These properties address the reliability requirements of online single-query retrieval, where preserving initially correct results is important and target-specific parameter selection is unavailable. We will incorporate the supporting analyses into the revised Appendix.
Response to Reviewer L38M [1/4]
Weakness 1 and Question 1: Classical Retrieval Baselines and Related Work
Thank you for your thorough and constructive review, which helps us clarify and strengthen our work.
1. Comparisons with Classical Retrieval Methods. We compare GEAR with query expansion, database-side augmentation, standard graph diffusion, and a classical full pipeline combining gallery centering, weighted AQE/DBA, and restart-based graph propagation. All methods use identical frozen descriptors, dataset splits, and evaluation protocols. Classical hyperparameters follow strict leave-one-dataset-out validation, while GEAR retains its submitted fixed configuration. The table reports macro mAP.
Classical refinements substantially improve frozen descriptors, confirming the value of gallery structure. GEAR achieves the highest macro mAP among the reported baselines, outperforming standard global diffusion by +0.29, +1.54, and +1.91 points, respectively. Against the classical full pipeline, gains reach +1.66, +2.26, and +2.76 points, with all paired 95% confidence intervals above zero. Individual baseline variants and protocols are detailed in Appendix D.6.
2. Differences from Existing Offline-Online Diffusion Frameworks. Existing frameworks, such as the 2019 AAAI study by Yang and colleagues, mainly exploit database-side graph precomputation for efficient online ranking. GEAR instead uses offline computation to refine gallery representations and adapts each incoming query against the refined gallery. This distinction involves two mechanisms.
First, gallery refinement iteratively recomputes neighborhoods, controls residual updates through local agreement, and fuses independently refined multi-scale representations. The resulting embeddings and transition graph are cached offline as a reusable structural prior.
Second, rather than directly propagating frozen query-gallery similarity scores, GEAR recalibrates each query against the refined gallery through an agreement-dependent residual update before anchored score propagation. This supports independent, query-specific adaptation without downstream optimization or interactions between queries.
To isolate this mechanism, we conducted a controlled module-replacement experiment under a shared diffusion-free setup. Holding gallery representations fixed, replacing conventional query refinement with GEAR's recalibration improves mAP by 0.44–0.55 points, with positive paired 95% confidence intervals. This directly supports the value of gallery-conditioned query recalibration.
3. Addition of Recent Related Work. We have incorporated all three suggested studies. Source-Free Model Adaptation for Unsupervised 3D Object Retrieval (TVCG 2025) studies prototype-based source-free adaptation and distillation; PASR (CVPR Findings 2026) addresses single-view image-to-3D retrieval using test-time pose optimization; and Uni-Adapter (AAAI 2026) explores training-free online adaptation of 3D vision-language models through dynamic class-prototype caches and graph-based label smoothing. The first two are discussed in Section 2.1 and Uni-Adapter in Section 2.2, with their task settings distinguished from GEAR.
Overall, these additional comparisons substantiate GEAR's performance under matched frozen representations, clarify its gallery-refinement and single-query adaptation mechanisms, and address the missing recent literature.