Pith. sign in

REVIEW 2 major objections 2 minor 1 cited by

Faster or Stronger: Towards Flexible Visual Place Recognition via Weighted Aggregation and Token Pruning

T0 review · 2 major / 2 minor · reviewed 2026-05-21 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Weighted cluster aggregation and inference-time token pruning let visual place recognition models trade accuracy for speed after one training run.

desk verdict This paper adds weighted cluster aggregation for better VPR descriptors and a self-distillation pruning scheme that supports inference-time speed adjustments after one training run. read the letter →

arxiv 2605.20551 v1 pith:BBPBQ3PC submitted 2026-05-19 cs.CV cs.AIcs.RO

Zichao Zeng , June Moh Goo , Junwei Zheng , Weijia Fan , Jiaming Zhang , Rainer Stiefelhagen , Jan Boehm This is my paper · ORCID
classification cs.CVcs.AIcs.RO
keywords visualplacerecognitionvisiontransformerstokenpruningweightedaggregationself-distillationglobaldescriptorsefficiencytrade-off
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes two linked techniques for vision-transformer backbones in visual place recognition. It first replaces uniform pooling of patch clusters with learned weights that give more influence to clusters carrying stronger place-specific signals. It then uses the resulting importance scores to train a lightweight pruning head attached early in the transformer via self-distillation, so that at inference users can drop any fraction of tokens without retraining and still retrieve the correct place. The combined approach therefore improves descriptor quality while turning the usual fixed cost of feature extraction into a controllable parameter.

What carries the argument

The Weighted Aggregated Descriptor (WeiAD) that multiplies cluster contributions by learned weights, together with the WeiToP self-distillation pipeline that transfers aggregation-derived token importance to an early-layer pruning module.

What would settle it

Measuring that top-1 retrieval accuracy on a standard VPR benchmark such as Oxford RobotCar falls more than five percent below the unpruned baseline once half the tokens are removed.

Watch

Extended reading notes

Core claim

Assigning weights to clusters during aggregation yields more discriminative global descriptors for VPR, and the same importance information can supervise a pruning module that supports plug-and-play token reduction at inference after a single joint training phase, outperforming token-pruning techniques transferred from general vision tasks.

Load-bearing premise

Importance scores produced by the weighted aggregation step remain reliable enough to supervise pruning so that accuracy stays acceptable across different pruning ratios without any further training.

Editorial extensions

If this is right

  • Global descriptors become more discriminative because clusters that matter more for place identity receive higher weight.
  • Feature extraction cost can be reduced on demand at inference without retraining or separate models for each speed target.
  • The accuracy-efficiency curve can be adjusted continuously by choosing how many tokens to keep.
  • VPR-specific pruning outperforms general-purpose token pruning methods when both are applied to the same backbone.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same weighting-plus-pruning pattern could be tested on other retrieval problems that rely on transformer patch tokens, such as landmark or product search.
  • Pairing the pruned descriptors with existing compression techniques would further cut storage and search time for city-scale databases.
  • Running the method on sequences with strong seasonal or illumination change would reveal whether the learned weights remain stable across domain shifts.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 2 minor

Summary. The paper proposes two modules for ViT-based Visual Place Recognition: WeiAD, which learns to weight clusters during aggregation to produce more discriminative global descriptors than uniform pooling, and WeiToP, a self-distillation framework that transfers token importance scores derived from the final weighted aggregation to train a lightweight pruning head attached after an early transformer block. After one joint training run, WeiToP permits inference-time token pruning at arbitrary ratios without retraining, aiming to improve the accuracy-efficiency trade-off over both standard VPR pipelines and token-pruning methods transferred from general vision tasks.

Significance. If the empirical claims hold, the work would offer a practical way to obtain stronger global descriptors while simultaneously reducing the dominant cost of ViT feature extraction in large-scale VPR. The plug-and-play character of WeiToP after a single training phase is a notable engineering contribution for edge deployment. However, the significance is tempered by the absence of any quantitative results, ablation tables, or error analysis in the provided abstract; the central claims therefore remain unverified at this stage.

major comments (2)
  1. [WeiToP framework] WeiToP description: the core assumption that final-layer aggregation weights can reliably supervise a pruning module attached to an early transformer block is load-bearing for the 'single-training, plug-and-play' claim. Early blocks primarily encode local texture and edges, while aggregation operates on the final token set; without reported layer-wise correlation statistics or an ablation that measures VPR recall degradation when early-layer importance is used, it is unclear whether the self-distillation objective aligns on VPR-critical structure or on spurious correlations.
  2. [Experiments] Experimental section: the abstract states that WeiToP 'outperforms existing token pruning methods adapted from general vision tasks,' yet no recall@N, latency, or FLOPs numbers, no baseline descriptions, and no ablation on pruning ratios are supplied. Because the soundness of the accuracy-efficiency curves cannot be assessed, the headline claim that flexible control is achieved without per-ratio retraining remains unverified.
minor comments (2)
  1. [Abstract] The abstract is unusually long and contains several compound claims; a shorter, more focused abstract would improve readability.
  2. [Method] Notation for the weighting function in WeiAD and the importance-score head in WeiToP should be introduced with explicit equations rather than prose descriptions.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thoughtful review and constructive feedback. We address each major comment below, providing clarifications and indicating revisions to the manuscript where appropriate.

read point-by-point responses

  1. Referee: [WeiToP framework] WeiToP description: the core assumption that final-layer aggregation weights can reliably supervise a pruning module attached to an early transformer block is load-bearing for the 'single-training, plug-and-play' claim. Early blocks primarily encode local texture and edges, while aggregation operates on the final token set; without reported layer-wise correlation statistics or an ablation that measures VPR recall degradation when early-layer importance is used, it is unclear whether the self-distillation objective aligns on VPR-critical structure or on spurious correlations.

    Authors: We appreciate the referee pointing out the need for further validation of the self-distillation alignment in WeiToP. While the manuscript describes the framework and its motivation, we acknowledge that explicit layer-wise correlation statistics and a dedicated ablation on recall degradation for early vs. late layer importance were not included. We will add these analyses in the revised version to demonstrate that the transferred importance scores capture VPR-relevant structures rather than spurious correlations. revision: yes

  2. Referee: [Experiments] Experimental section: the abstract states that WeiToP 'outperforms existing token pruning methods adapted from general vision tasks,' yet no recall@N, latency, or FLOPs numbers, no baseline descriptions, and no ablation on pruning ratios are supplied. Because the soundness of the accuracy-efficiency curves cannot be assessed, the headline claim that flexible control is achieved without per-ratio retraining remains unverified.

    Authors: The abstract is constrained by length and thus omits specific numerical results, which are presented in detail in the experimental section of the full manuscript, including comparisons with adapted token pruning methods, recall metrics, latency, FLOPs, and ablations across pruning ratios. To address this, we will revise the abstract to include key quantitative findings supporting the claims. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; proposals are independent architectural modules with external validation

full rationale

The paper introduces WeiAD as a weighted aggregation module and WeiToP as a self-distillation-based pruning framework supervised by aggregation-derived importance scores. These are presented as novel components trained jointly on VPR tasks, with claims supported by empirical comparisons on standard benchmarks rather than any definitional equivalence or reduction of outputs to fitted inputs from the same data. No equations or steps reduce the reported accuracy-efficiency trade-offs to quantities defined by construction from the inputs; the supervision link is a designed training objective, not a tautology. Self-citations for baselines or prior ViT work are not load-bearing for the central claims, which remain falsifiable via external datasets.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

Review performed on abstract only; full methods, training details, and experimental setup unavailable. Free parameters likely include cluster weights and pruning thresholds but cannot be enumerated without the manuscript. No invented physical entities; the new modules are algorithmic.

assumptions (1)
  • domain assumption ViT patch tokens encode spatial and semantic patterns that can be meaningfully clustered and weighted for place discrimination.
    Implicit in the motivation for moving beyond uniform pooling.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Faster or Stronger: Towards Flexible Visual Place Recognition via Weighted Aggregation and Token Pruning." pith.science (2026). https://pith.science/paper/BBPBQ3PC

@misc{pith2026260520551,
  author       = {Pith},
  title        = {Pith review of: Faster or Stronger: Towards Flexible Visual Place Recognition via Weighted Aggregation and Token Pruning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BBPBQ3PC}},
  note         = {Machine review of arXiv:2605.20551}
}
read the original abstract

Visual Place Recognition (VPR) aims to match a query image to reference images of the same place in a large-scale database. Recent state-of-the-art methods employ Vision Transformers (ViTs) as backbone foundation models to extract patch-level features that are robust to viewpoint, illumination, and seasonal variations, which are then aggregated into a compact global descriptor for retrieval. Most existing aggregation methods uniformly pool patch tokens into learned clusters, despite the fact that different clusters often encode distinct spatial or semantic patterns and contribute unequally to VPR performance. To address this limitation, we propose Weighted Aggregated Descriptor (WeiAD), which assigns weights to clusters during aggregation, producing more discriminative global representations. Beyond accuracy, retrieval latency is a critical concern for large-scale deployments and resource-constrained edge devices. Prior work mainly reduces latency by compressing global descriptors, while overlooking the cost of feature extraction, an issue exacerbated by ViT-based backbones. We therefore introduce WeiToP, a VPR-oriented token pruning framework that reduces feature extraction cost via self-distillation, where aggregation-induced token importance supervises a lightweight pruning module attached to an early transformer layer, enabling inference-time token pruning. After a single joint training phase, WeiToP enables plug-and-play token pruning at inference time, allowing flexible and on-demand control over the accuracy-efficiency trade-off without additional training. Moreover, WeiToP outperforms existing token pruning methods adapted from general vision tasks.

Figures

Figures reproduced from arXiv: 2605.20551 by the authors.

Figure 2
Figure 2. (a) Cluster-to-patch transport heatmaps showing distinct assignment patterns. (b) Token pruning illustration, where squares denote patch tokens and blank ones are pruned redundant tokens. emerged as an effective strategy for accelerating inference by removing spatial tokens that contribute little to down￾stream tasks (Rao et al., 2021; Meng et al., 2022; Ye et al., 2025; Chen et al., 2024). Prior work has demonstrat… view at source ↗
Figure 1
Figure 1. Star-shaped markers correspond to WeiAD-based mod￾els. The solid red star denotes base WeiAD. The yellow line shows our VPR-specific token pruning approach WeiToP inte￾grated with WeiAD across different retention ratios. Other lines indicate WeiAD equipped with different generic token pruning strategies. Single markers show competing VPR methods. gation by incorporating optimal transport (OT) formulations and explic… view at source ↗
Figure 3
Figure 3. The unified framework of WeiAD and WeiToP. At training stage, we fine-tune the late layers of DINOv2 ViT-B on GSV-Cities, alongside the score projection, dimension reduction module, WeiToP module, and weight parameters (fire icon). 2. Literature Review Visual Place Recognition. NetVLAD (Arandjelovic et al., 2016) marked a milestone by integrating convolutional neu￾ral networks with a differentiable VLAD aggregation … view at source ↗
Figures from the paper (10 more)
Figure 4
Figure 4. Figure 4: We activate WeiToP after an early layer during inference. Input tokens undergo WeiToP processing to obtain importance logits, which are then combined with token norms to compute importance scores. The top-α selected tokens are retained and fed into the subsequent block…
Figure 5
Figure 5. Figure 5: Comparison of WeiToP (star lines) with other token pruning methods with different retention ratios ρ [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Efficiency-accuracy trade-off performance of WeiAD + WeiToP (star lines) with different model sizes of DINOv2. lenging benchmarks that exhibit severe seasonal and tempo￾ral variations, such as Nordland and AmsterTime, our ap￾proach yields substantial gains by leveragin…
Figure 7
Figure 7. Figure 7: P Visual examples under different conditions. (a) Visualization of the transport mass each token adsorbed in WeiAD, i.e., M j=1 wτ(j) P ⋆ ij , compared with PM j=1 P ⋆ ij in SALAD. (b) Tokens retained after applying WeiToP with retention ratios ρ = 0.95 and 0.5, compar…
Figure 8
Figure 8. Figure 8: Efficiency-accuracy trade-off of the WeiToP pruning module located after different layers. ToFu (Kim et al., 2024). These methods are designed for general vision tasks and are integrated into our framework using their default configurations detailed in Appendix D.2 [P…
Figure 9
Figure 9. Figure 9: Cluster-to-patch transport heatmaps showing that spatial and semantic patterns of different clusters are distinct. This large performance variance provides direct evidence that clusters contribute to VPR with differing degrees of importance. We revisit a traditional me…
Figure 10
Figure 10. Figure 10: Efficiency-accuracy trade-off of the WeiToP pruning module located after different layers of ViT and the initial tokenizer. 17 [PITH_FULL_IMAGE:figures/full_fig_p017_10.png]
Figure 11
Figure 11. Figure 11: Efficiency-accuracy trade-off with different balancing coefficient κ for token-level importance scores. 10 3 10 2 10 1 10 0 10 1 78 79 80 81 82 83 84 R e c all@ 1 (%) ( ) Performance Best = 0.1 [PITH_FULL_IMAGE:figures/full_fig_p019_11.png]
Figure 12
Figure 12. Figure 12: Performance of WeiAD under different magnitudes of γ during joint learning. F. Limitations and Future Work Despite its effectiveness, our approach has several limitations that suggest promising directions for future research. First, our weighted aggregation relies on …
Figure 13
Figure 13. Figure 13: Visual examples across different cities under different conditions. Heatmap of token importance scores and tokens retained after applying WeiToP with retention ratios ρ = 0.95, 0.9, 0.8, 0.7, 0.6, 0.5, and 0.4. *Blank indicates removed tokens. 21 [PITH_FULL_IMAGE:fig…

Discussion (0). Continue with ORCID to comment.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. REDI: Corpus Aware Patch Ranking for DINOv3 Token Reduction

    cs.CV 2026-06 unverdicted novelty 6.0 of 10

    REDI combines supervised TF-IDF corpus scores over DINOv3 visual words with attention maps to rank patches, reducing sequence length 46.8% while raising Top-1 accuracy from 83.514% to 84.706% on ImageNet-1K.

Reference graph

Works this paper leans on

50 extracted references · 50 canonical work pages · cited by 1 Pith paper

  1. [1]

    Proceedings of the ieee/cvf conference on computer vision and pattern recognition , pages=

    Optimal transport aggregation for visual place recognition , author=. Proceedings of the ieee/cvf conference on computer vision and pattern recognition , pages=

    work page

  2. [2]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    Rethinking visual geo-localization for large-scale applications , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    work page

  3. [3]

    Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    Eigenplaces: Training viewpoint robust models for visual place recognition , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    work page

  4. [4]

    Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

    NetVLAD: CNN architecture for weakly supervised place recognition , author=. Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

    work page

  5. [5]

    Proceedings of the IEEE/CVF winter conference on applications of computer vision , pages=

    Mixvpr: Feature mixing for visual place recognition , author=. Proceedings of the IEEE/CVF winter conference on applications of computer vision , pages=

    work page

  6. [6]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    Cricavpr: Cross-image correlation-aware representation learning for visual place recognition , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    work page

  7. [7]

    Billion-scale similarity search with

    Johnson, Jeff and Douze, Matthijs and J. Billion-scale similarity search with. IEEE Transactions on Big Data , volume=. 2019 , publisher=

    work page 2019

  8. [8]

    IEEE Robotics and Automation Letters , year=

    Anyloc: Towards universal visual place recognition , author=. IEEE Robotics and Automation Letters , year=

    work page

Show all 50 references
  1. [9]

    European Conference on Computer Vision , pages=

    Revisit anything: Visual place recognition via image segment retrieval , author=. European Conference on Computer Vision , pages=. 2024 , organization=

    2024

  2. [10]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    R2former: Unified retrieval and reranking transformer for place recognition , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

  3. [11]

    Advances in Neural Information Processing Systems , volume=

    SuperVLAD: Compact and robust image descriptors for visual place recognition , author=. Advances in Neural Information Processing Systems , volume=

  4. [12]

    arXiv preprint arXiv:2402.14505 , year=

    Towards seamless adaptation of pre-trained models for visual place recognition , author=. arXiv preprint arXiv:2402.14505 , year=

  5. [13]

    European Conference on Computer Vision , pages=

    VLAD-BuFF: burst-aware fast feature aggregation for visual place recognition , author=. European Conference on Computer Vision , pages=. 2024 , organization=

    2024

  6. [14]

    IEEE Robotics and Automation Letters , volume=

    Dilated Superpixel Aggregation for Visual Place Recognition , author=. IEEE Robotics and Automation Letters , volume=. 2026 , publisher=

    2026

  7. [15]

    International conference on machine learning , pages=

    Learning transferable visual models from natural language supervision , author=. International conference on machine learning , pages=. 2021 , organization=

    2021

  8. [16]

    arXiv preprint arXiv:2304.07193 , year=

    Dinov2: Learning robust visual features without supervision , author=. arXiv preprint arXiv:2304.07193 , year=

    arXiv

  9. [17]

    Proceedings of the AAAI Conference on Artificial Intelligence , author=

    Fit and Prune: Fast and Training-free Visual Token Pruning for Multi-modal Large Language Models , volume=. Proceedings of the AAAI Conference on Artificial Intelligence , author=. 2025 , month=. doi:10.1609/aaai.v39i21.34366 , number=

    2025 doi

  10. [18]

    Advances in neural information processing systems , volume=

    Dynamicvit: Efficient vision transformers with dynamic token sparsification , author=. Advances in neural information processing systems , volume=

  11. [19]

    Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

    Adavit: Adaptive vision transformers for efficient image recognition , author=. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

  12. [20]

    Neurocomputing , volume=

    Gsv-cities: Toward appropriate supervised visual place recognition , author=. Neurocomputing , volume=. 2022 , publisher=

    2022

  13. [21]

    Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

    Mapillary street-level sequences: A dataset for lifelong place recognition , author=. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

  14. [22]

    IEEE Robotics and Automation Letters , volume=

    Learning context flexible attention model for long-term visual place recognition , author=. IEEE Robotics and Automation Letters , volume=. 2018 , publisher=

    2018

  15. [23]

    Are we there yet? Challenging SeqSLAM on a 3000 km journey across all four seasons , author=. Proc. of workshop on long-term autonomy, IEEE international conference on robotics and automation (ICRA) , pages=. 2013 , organization=

    2013

  16. [24]

    2022 26th International Conference on Pattern Recognition (ICPR) , pages=

    Amstertime: A visual place recognition benchmark dataset for severe domain shift , author=. 2022 26th International Conference on Pattern Recognition (ICPR) , pages=. 2022 , organization=

    2022

  17. [25]

    IEEE transactions on pattern analysis and machine intelligence , volume=

    Fine-tuning CNN image retrieval with no human annotation , author=. IEEE transactions on pattern analysis and machine intelligence , volume=. 2018 , publisher=

    2018

  18. [26]

    Advances in neural information processing systems , volume=

    Sinkhorn distances: Lightspeed computation of optimal transport , author=. Advances in neural information processing systems , volume=

  19. [27]

    Pacific Journal of Mathematics , volume=

    Concerning nonnegative matrices and doubly stochastic matrices , author=. Pacific Journal of Mathematics , volume=. 1967 , publisher=

    1967

  20. [28]

    Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

    Superglue: Learning feature matching with graph neural networks , author=. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

  21. [29]

    arXiv preprint arXiv:1503.02531 , year=

    Distilling the knowledge in a neural network , author=. arXiv preprint arXiv:1503.02531 , year=

    arXiv

  22. [30]

    Proceedings of IEEE International conference on Robotics and Automation , volume=

    Visual navigation using view-sequenced route representation , author=. Proceedings of IEEE International conference on Robotics and Automation , volume=. 1996 , organization=

    1996

  23. [31]

    arXiv preprint arXiv:2205.11567 , year=

    VPAIR--Aerial Visual Place Recognition and Localization in Large-scale Outdoor Environments , author=. arXiv preprint arXiv:2205.11567 , year=

  24. [32]

    European Conference on Computer Vision , pages=

    Capturing, reconstructing, and simulating: the urbanscene3d dataset , author=. European Conference on Computer Vision , pages=. 2022 , organization=

    2022

  25. [33]

    2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06) , volume=

    Scalable recognition with a vocabulary tree , author=. 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06) , volume=. 2006 , organization=

    2006

  26. [34]

    The International Journal of Robotics Research , volume=

    Persistent navigation and mapping using a biologically inspired SLAM system , author=. The International Journal of Robotics Research , volume=. 2010 , publisher=

    2010

  27. [35]

    IEEE transactions on robotics , volume=

    ORB-SLAM: A versatile and accurate monocular SLAM system , author=. IEEE transactions on robotics , volume=. 2015 , publisher=

    2015

  28. [36]

    European conference on computer vision , pages=

    Planet-photo geolocation with convolutional neural networks , author=. European conference on computer vision , pages=. 2016 , organization=

    2016

  29. [37]

    arXiv preprint arXiv:2004.02984 , year=

    Mobilebert: a compact task-agnostic bert for resource-limited devices , author=. arXiv preprint arXiv:2004.02984 , year=

    2004

  30. [38]

    European Conference on Computer Vision , pages=

    An image is worth 1/2 tokens after layer 2: Plug-and-play inference acceleration for large vision-language models , author=. European Conference on Computer Vision , pages=. 2024 , organization=

    2024

  31. [39]

    Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

    Multi-similarity loss with general pair weighting for deep metric learning , author=. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

  32. [40]

    arXiv preprint arXiv:2508.10104 , year=

    Dinov3 , author=. arXiv preprint arXiv:2508.10104 , year=

    arXiv

  33. [41]

    arXiv preprint arXiv:1711.05101 , year=

    Decoupled weight decay regularization , author=. arXiv preprint arXiv:1711.05101 , year=

    arXiv

  34. [42]

    International Conference on Learning Representations , year=

    Not All Patches are What You Need: Expediting Vision Transformers via Token Reorganizations , author=. International Conference on Learning Representations , year=

  35. [43]

    Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pages=

    Token fusion: Bridging the gap between token pruning and token merging , author=. Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pages=

  36. [44]

    Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining , pages=

    Learned token pruning for transformers , author=. Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining , pages=

  37. [45]

    Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    Dynamic token pruning in plain vision transformers for semantic segmentation , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

  38. [46]

    arXiv preprint arXiv:2210.09461 , year=

    Token merging: Your vit but faster , author=. arXiv preprint arXiv:2210.09461 , year=

    arXiv

  39. [47]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    Zero-TPrune: Zero-shot token pruning through leveraging of the attention graph in pre-trained transformers , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

  40. [48]

    European conference on computer vision , pages=

    Adaptive token sampling for efficient vision transformers , author=. European conference on computer vision , pages=. 2022 , organization=

    2022

  41. [49]

    arXiv preprint arXiv:2603.27758 , year=

    RHO: Robust Holistic OSM-Based Metric Cross-View Geo-Localization , author=. arXiv preprint arXiv:2603.27758 , year=

  42. [50]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    Transgeo: Transformer is all you need for cross-view image geo-localization , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

Pith tools

Reviewed May 21, 2026 · model on record in the stance chip above.