- Rating
- 4
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper investigates early token pruning for efficient visual place recognition (VPR). The authors first demonstrate through an oracle study that final-block attention provides reliable token rankings for nearly lossless early pruning, although obtaining such rankings requires an additional forward pass. To address this limitation, they propose OraP, a ranking-aware self-distillation framework that predicts late-emerging token rankings from early representations. Specifically, OraP employs a lightweight global-local predictor and a pruning-aware ranking loss to guide token selection within the first transformer block in a single forward pass. Extensive experiments across diverse VPR benchmarks show that OraP substantially improves inference efficiency while largely preserving retrieval accuracy under 50% token pruning. Additional evaluations investigate different pruning strategies, distillation objectives, and practical acceleration on edge devices. The method also demonstrates applicability across different transformer-based VPR models.
Critical strengths
- Clear Motivation from Oracle Study. The authors decouple the pruning location from the source of token importance and demonstrate that final-block attention rankings enable nearly lossless pruning within the first transformer block. This observation provides convincing evidence for the feasibility of aggressive early pruning and establishes a clear motivation for the proposed ranking prediction framework.
- Strong Experimental Validation and Practical Efficiency. OraP consistently outperforms representative token reduction methods across diverse VPR benchmarks under the same early pruning setting. With 50% token pruning, it reduces FLOPs by 48.9%, achieves 2.05× throughput and 1.68× edge-device speedup, while limiting the average R@1 degradation to 0.8 percentage points. Additional experiments across different VPR aggregators and transformer backbones further support its generalizability and practical relevance.
Critical weaknesses
The comparison with the most closely related VPR method could be strengthened.
Although the paper provides extensive comparisons with representative token reduction methods, WeiToP, a closely related approach for early token pruning in VPR, is discussed but not experimentally evaluated. Since both methods aim to learn reliable token importance for early pruning, a direct comparison would help clarify OraP's advantages over the most relevant prior work. Additionally, the unified early pruning setting may not fully reflect the optimal configurations of some baselines. Further comparisons under consistent computational budgets would strengthen the experimental conclusions.
Questions for authors
Q1. WeiToP is discussed as a closely related VPR token pruning method, but a direct quantitative comparison does not appear to be included. Could the authors kindly clarify the reason for this?
Q2. Does the score predictor need to be retrained for each VPR model or backbone, or can a predictor trained with one aggregation model be directly reused with another model sharing the same backbone?
Q3. How closely do OraP's predicted token rankings align with the final-block oracle rankings? Could the authors provide quantitative evidence, such as Top-K overlap or rank correlation, to further validate the proposed ranking prediction mechanism?
4 comments
Rebuttal by Authors (2/2)
Q3. Degree of Overlap with Oracle Token Rankings
We sincerely appreciate your attention to this detail. To directly quantify the agreement between OraP's predictions and the oracle, we measure Top-K overlap between the tokens selected using OraP's predicted scores and those selected using final-block attention from a full-token forward pass. For each query, the overlap is calculated as the number of shared retained tokens divided by K. We report the average overlap over all queries in each dataset. The following results report Top-K overlap (%) between OraP and the oracle at a 50% pruning ratio, retaining 264 of the original 529 patch tokens.
| Pruning Ratio | Pitts30k-test | MSLS-val | MSLS-test | Tokyo24/7 | Nordland |
|---|---|---|---|---|---|
| 50% | 73.4 | 81.9 | 82.2 | 69.3 | 80.6 |
OraP achieves Top-K overlap of 69.3%–82.2% across the five benchmarks, showing that its predictions recover a substantial fraction of the oracle-selected tokens. Although the agreement is not perfect, identical token selection is not necessary for successful retrieval. As illustrated by the qualitative examples in Fig. 8 of our original submission, different retained token subsets can yield correct retrievals when sufficient place-discriminative information is preserved. This is consistent with OraP maintaining strong retrieval performance despite not exactly reproducing the oracle selection.
Additional Response: Comparisons Under Matched Computational Budgets
Thank you for giving this suggestion to improve our paper. In fact, our comparisons in Table 2 fix the token reduction location and ratio to evaluate different methods under the same early pruning setting. We agree that this comparison may not fully characterize the performance of baselines using their original strategies, such as multi-stage pruning or progressive merging. Following your suggestion, we therefore conduct an additional comparison with two representative methods, including EViT and ToMe, at comparable computational budgets, without restricting them to our first-block pruning location. EViT performs multi-stage pruning in the 4th, 7th, and 10th transformer blocks, while ToMe progressively merges tokens across blocks. These pruning strategies are consistent with those in their original paper. We adjust their reduction strengths to approach OraP's computational budget. Specifically, OraP removes 50% of patch tokens within the first block, whereas EViT and ToMe use cumulative token reduction ratios of 80% and 75%, respectively. OraP and ToMe both require 27.3G FLOPs, while EViT uses a slightly larger budget of 28.7G. The table below reports R@1/R@5 and measured throughput.
| Method | FLOPs (G) | Throughput (img/s) | Pitts30k-test | MSLS-val | MSLS-test | Tokyo24/7 | Nordland |
|---|---|---|---|---|---|---|---|
| EViT | 28.7 | 474.0 | 91.6/96.6 | 90.1/97.0 | 69.0/81.7 | 89.2/96.8 | 79.2/90.9 |
| ToMe | 27.3 | 465.1 | 92.6/96.8 | 93.6/97.4 | 74.2/84.8 | 93.0/96.5 | 91.7/97.3 |
| OraP | 27.3 | 507.2 | 93.3/97.0 | 94.7/97.7 | 75.7/85.6 | 96.5/98.4 | 93.8/97.8 |
Under these settings, OraP still achieves higher R@1 and R@5 on all five benchmarks, with average absolute R@1 gains of 7.0% and 1.8% over EViT and ToMe, respectively. It also achieves the highest throughput, despite retaining a larger fraction of tokens. In particular, compared with ToMe at identical FLOPs, OraP provides both higher retrieval performance and 9.1% higher throughput. These results further highlight the value of OraP's early-pruning design. By shortening the token sequence within the first transformer block, OraP allows more subsequent computation to benefit from token reduction. It therefore achieves a comparable computational budget with only 50% token reduction, whereas the evaluated EViT and ToMe schedules use approximately 80% and 75% cumulative reduction, respectively. OraP thus achieves substantial computational savings while retaining a larger token set, with higher measured throughput and better retrieval performance.
Thanks again for your valuable comments and suggestions. Please let us know if you have any further concerns. We'd be very glad to address them.
Concerns Addressed, Score Unchanged
Thank you for the detailed response and additional experiments. My concerns have been addressed, and I will maintain my original score.
Official Comment by Authors
We are glad that our response has addressed all your concerns. Thank you very much for your comments and suggestions to improve our paper. We will incorporate them into the final version.
Rebuttal by Authors (1/2)
Thanks for your positive recommendation and detailed suggestions. The following are Responses to the Questions/Weaknesses.
Q1. Comparison with WeiToP
We thank the reviewer for highlighting the importance of this comparison. WeiToP was discussed in the Related Work section of our original submission, but a direct quantitative comparison was not included for the following reasons.
Controlled comparison using the same VPR model. To better address your concern, we reproduce WeiToP and apply OraP to the same trained DINOv2-B + WeiAD checkpoint. Both methods are evaluated with identical backbone and aggregation parameters, 322×322 inputs, and the same evaluation protocol. We retain each method's token-selection procedure and pruning location: WeiToP prunes after the first transformer block (original setting in its paper), while OraP prunes between the first MHSA and FFN. Both retain 50% of the patch tokens. Results are reported as R@1/R@5 (%).
Despite pruning earlier and requiring fewer FLOPs, OraP achieves higher R@1 and R@5 on all seven benchmarks. The absolute R@1 gains are particularly pronounced on Tokyo24/7 (14.0%), Nordland (5.4%), and AmsterTime (5.3%). Relative to the shared full-token reference, OraP reduces the average R@1 degradation from 6.3% to 1.3%. Since the underlying VPR model parameters are identical, these improvements are not attributable to a stronger full-token model, but to the superiority of OraP.
Q2. Predictor Training and Reuse Across VPR Models
In Table 5 of our original submission, we trained a separate predictor for each VPR model while keeping its backbone and aggregator frozen. We sincerely thank the reviewer for the insightful suggestion to explore whether a predictor trained for one VPR model can be directly reused with other models sharing the same backbone architecture. Following this suggestion, we conducted an additional experiment in which the predictor trained with DINOv2-B + BoQ is directly transferred to NetVLAD-, SALAD-, and ImAge-based VPR models, without retraining or fine-tuning. For each target model, we compare the transferred predictor with its target-trained counterpart using the same VPR checkpoint, pruning location, and 50% pruning ratio. All models use DINOv2-B as the backbone. The table reports R@1/R@5 (%).
As you can see, the BoQ-trained predictor transfers well to all three target models. Compared with target-trained predictors, its average R@1 decreases by only 0.3%, 0.6%, and 0.5% for NetVLAD, SALAD, and ImAge, respectively. It even achieves slightly higher R@1 on Nordland for all three models. However, transfer is not uniformly lossless: Tokyo24/7 shows larger decreases of 1.3%–1.9%. Thus, a single predictor can be directly reused across these evaluated VPR models, although target-specific training can further improve performance on some datasets. We thank the reviewer again for this valuable suggestion, which has helped us demonstrate the predictor's transferability and further highlight the practical value of OraP.