跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2606.03148 · v2

$A^2$: Smaller Self-Supervised ViTs Localize Better than Larger Ones

首次提交 2026-06-02 12:45
版本更新 2026-11-11 02:42
雷达观测 2026-11-11 13:07
arXiv ↗PDF ↗

摘要

Robust visual classification often depends on localizing the main foreground objects in an image while ignoring contextual distractors. Surprisingly, we find that the last layer attention maps of smaller self-supervised ViTs localize foreground objects better than those of larger ViTs. However, we still need large ViTs, because they extract richer representations from each patch. To get the best of both worlds, good localization and rich representations, we propose $A^2$, a simple method that leverages this inverse scaling finding by decoupling where to look (a small attention model) from what to extract (a large embedding model): we crop around the attention peaks of a small model and embed the crops with a larger model. $A^2$ uses entirely pretrained features, requires no group labels, and does not require per-dataset attention or backbone training. Across 5 benchmarks, $A^2$ is competitive with backbone-matched loss-level methods like DFR, and outperforms end-to-end attention training under stronger distribution shifts.

作者备注:NeurIPS 2026

AI 论文解读

基于摘要 · 非全文审阅

作者发现较小的自监督ViT的注意力图在定位前景物体上优于较大的ViT,并提出A²方法,将“看哪里”与“提取什么”解耦,以兼顾定位与表征。

正在读取账号与研究记录…

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-11 02:42 · 最新观测版本

$A^2$: Smaller Self-Supervised ViTs Localize Better than Larger Ones

Robust visual classification often depends on localizing the main foreground objects in an image while ignoring contextual distractors. Surprisingly, we find that the last layer attention maps of smaller self-supervised ViTs localize foreground objects better than those of larger ViTs. However, we still need large ViTs, because they extract richer representations from each patch. To get the best of both worlds, good localization and rich representations, we propose $A^2$, a simple method that leverages this inverse scaling finding by decoupling where to look (a small attention model) from what to extract (a large embedding model): we crop around the attention peaks of a small model and embed the crops with a larger model. $A^2$ uses entirely pretrained features, requires no group labels, and does not require per-dataset attention or backbone training. Across 5 benchmarks, $A^2$ is competitive with backbone-matched loss-level methods like DFR, and outperforms end-to-end attention training under stronger distribution shifts.

查看此版本解读 →查看此版本原文 ↗