Video not loading? Watch on YouTube
We introduce a controlled subspace intervention framework to investigate how self-supervised Vision Transformers (ViTs) encode dense geometric information. While linear probing is widely used to assess geometric representations, it treats features as a black box, failing to disentangle the underlying topology. To address this issue, we decompose the weights of converged linear probes to isolate the low-rank subspaces containing explicit geometric signals using Singular Value Decomposition (SVD). Our perspective yields three key insights: (1) Pre-training objectives determine how features are encoded — DINOv2 aligns spatial features for efficient linear extraction, while Masked Autoencoders (MAE) tend to disperse these signals, requiring a broader spatial context. (2) Explicit geometric representations are highly compressible, suggesting dense predictive heads could potentially be constrained to low-rank subspaces with minimal performance loss. (3) The layer-wise task affinity suggests that geometric precision peaks at intermediate layers before yielding to semantic abstraction in the final layers. By connecting internal encoding mechanics with downstream performance, these findings provide a basis for effective feature selection and lightweight decoder design.
Rather than reading only the accuracy of a downstream probe, we (A) establish a readability gap with a three-tier probing hierarchy, then (B) perform a post-hoc subspace intervention that decomposes the converged linear weights to isolate the directions that carry explicit geometry.
Z(l) are evaluated with three-tier probes (Linear, MLP, DPT) to decouple local
non-linear entanglement from global spatial fragmentation. (B) Subspace Intervention: without
any additional training, we apply SVD to the converged linear weights W to extract a
task-aligned basis Vk; the feature tensor is projected onto the aligned subspace
(Sk), a random subspace (Rk) and the orthogonal residual
(Sk⊥), each read out through the same fixed linear head to isolate
the geometric signal.A Linear probe measures explicitly rectified geometry; a MLP adds point-wise non-linearity (isolating local entanglement); a DPT decoder adds a global receptive field (isolating spatial fragmentation). The gaps between three-tier probes quantify how entangled vs. dispersed the geometric signal is.
We factor W = UΣV⊤ and keep the top-k right
singular vectors as the aligned basis. Projecting features onto Sk,
Rk, or the residual Sk⊥, then
reading them through the frozen head, attributes any change purely to the geometric
capacity of that subspace.
Self-distillation (DINOv2) aligns explicit geometry into a linearly accessible, low-rank coordinate system. Masked reconstruction (MAE) disperses the signal across broader spatial context, needing a global receptive field to decode.
Across every paradigm, a low-rank, task-aligned subspace is sufficient to preserve and reconstruct explicitly decodable geometry. Constraining dense predictive heads to this subspace incurs minimal performance loss, motivating lightweight decoders.
Geometric precision concentrates in intermediate layers, then declines as deeper layers shift toward semantic abstraction, revealing a layer-wise affinity that argues against a terminal-only feature readout.
| Backbone | Performance · SA-δ1 ↑ | Accessibility Gaps | |||
|---|---|---|---|---|---|
| Linear | 1×1 MLP | DPT | Local Entang.Δ Linear→MLP | Spatial Frag.Δ MLP→DPT | |
| DINOv2-L | 0.9157 | 0.9325 | 0.9483 | +0.0168 |
+0.0158 |
| iBOT-L | 0.8198 | 0.8376 | 0.8524 | +0.0178 |
+0.0148 |
| MAE-L | 0.6033 | 0.6390 | 0.7022 | +0.0357 |
+0.0632 |
| Model | l6 | l12 | l18 | l24 | Layer distributionbars vs. 25% uniform (dashed) · σ = spread |
|---|---|---|---|---|---|
| DINOv2 | 17.2 | 35.8 | 36.7 | 10.3 |
σ 11.5 · concentrated |
| iBOT | 26.9 | 28.4 | 22.4 | 22.3 |
σ 2.7 · most uniform |
| MAE | 19.5 | 28.4 | 32.7 | 19.4 |
σ 5.8 · mild peak |
The question we were asked most often: does the late-layer decline of geometry we report for DINOv2 (Takeaway 03, Fig. 5a) also appear in DINOv3? To answer it we re-ran the layer-wise subspace analysis on DINOv3 ViT-L/16 under exactly the same protocol as Fig. 5: frozen features, a linear depth probe trained per layer on NYU Depth v2, SVD of the converged weights, and re-reading every layer through the fixed head at ranks k = 8 … full.
DINOv3's full-rank probe reaches 0.89 about two-thirds of the way through the network and then plateaus at 0.90–0.91 for the remaining blocks. The same probe on DINOv2 (Fig. 5a) peaks and then gives back 0.044 by the last layer; on DINOv3 the peak-to-last-layer drop is 0.005.
The k = 8 subspace tracks the full-rank curve only in the shallow layers (gap < 0.05), then collapses to 0.08 in the deep layers before partially recovering (0.47) at the output, and the intermediate ranks (k = 16–128) fan out widely. Depth in DINOv3's late layers remains linearly decodable, but it is dispersed over many more directions than in DINOv2.
The mid-layer peak of Takeaway 03 is therefore paradigm-specific: DINOv3's final layers remain safe to read depth from at full rank, while the low-rank compressibility of Takeaway 02 holds only in its intermediate layers. DINOv3's Gram anchoring, designed to prevent dense-feature degradation, is a natural candidate for the difference, though confirming it would need a controlled ablation.
@inproceedings{Zhou2026UnderstandingGR,
title = {Understanding Geometric Representations in Self-Supervised Vision Transformers via Subspace Intervention},
author = {Zhou, Weichen and Zou, Yawen and Gu, Chunzhi and Dong, Ran and Xie, Haoran and Zhang, Chao},
booktitle = {Proceedings of the European Conference on Computer Vision (ECCV)},
year = {2026}
}
This work was supported by JST CREST, Japan, and by JSPS KAKENHI. Our codebase builds largely upon Probe3D — we thank the authors for making it available.