Anchored Rank-Adversarial Fine-Tuning Pretrained Visual Place Recognition Models
Visual place recognition (VPR) localises a camera by retrieving similar geo-tagged images, and current foundation-model VPR models are accurate across cities, seasons and illumination, but not robust to adversarial perturbations: under a white-box attack on the ranking at an imperceptible budget of 1/255, SuperVLAD and BoQ keep at most 0.2% top-1 recall (R@1) on four benchmarks. We propose anchored rank-adversarial fine-tuning (ARAFT), which fine-tunes a released model with a listwise rank loss on each adversarial query's hardest positive and an anchor to the clean descriptor of the frozen pretrained model. Checkpoints are selected under a clean-accuracy budget fixed in advance, and the full trade-off is reported. Within five validation R@1 points of clean cost, plain adversarial training has no admissible checkpoint, whereas ARAFT raises robust R@1 from zero to 47.3 on SuperVLAD and 55.3 on BoQ; plain adversarial training exceeds this only at about three times the clean cost. Against unbudgeted plain adversarial training on the test sets, ARAFT matches its robust R@1 at 2/255 with about ten more clean R@1 points. At 4/255, plain adversarial training is 6-9 robust R@1 points ahead, while ARAFT still keeps its ten-point clean advantage. Developed on SuperVLAD, ARAFT transfers to BoQ without re-tuning, and its robustness holds against stronger optimisers, with no sign of gradient masking.
Authors
- Bader Rasheed (ORCID: https://orcid.org/0000-0003-3874-0883)
- Manuel Mazzara (ORCID: https://orcid.org/0000-0002-3860-4948)
- Mostafa Kira (ORCID: https://orcid.org/0009-0004-5028-2277)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-03
- DOI
- https://doi.org/10.48550/arxiv.2611.05286
- Primary Topic
- Adversarial Robustness in Machine Learning
- Type
- preprint