GeoShift rewrites the small visual clues that let reasoning models geolocate a photo, cutting 1 km accuracy from 25.7% to 3.8% on Gemini-3-Flash
AspireAI community · arXiv (Washington University in St. Louis / University of Utah)
Photo metadata is not the only way a model can work out where a picture was taken. GeoTrace, a structured reasoning attack in the paper Not Where You Think, localized 25.71% of 525 ordinary photos within 1 km using Gemini-3-Flash and 16.95% using GPT-5-mini, even though famous landmarks and direct location indicators were excluded. The authors' analysis found that precise localization leans on small, distinctive, editable local clues rather than broad scene properties, and GeoShift acts on that insight: it keeps stable scene properties, picks a visually compatible false location and rewrites the high-impact clues so the image supports a coherent alternative hypothesis. That dropped street-level localization from 25.71% to 3.81% under Gemini-3-Flash and from 16.95% to 2.48% under GPT-5-mini while preserving visual quality. The authors also note that edited clues are not always coherent or subtle enough to evade a strong attacker, even when explicitly asked to be, so the defense still needs an adaptive-attack check.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.