Dissecting AI
From the paper: Generative Representation Learning for Scalable Latent Tokenization

Spatially Equivariant Patch Representations

Unsupervised intermediate patch tokens can become unstable; directly supervising each patch feature while withholding absolute position and querying by center-relative offsets encourages spatially structured representations.

Read the paper ↗
The short version

What it is

  • Direct patch supervision Instead of treating patch tokens as incidental internal activations, the model uses the full grid of patch features as its representation and directly applies structural supervision to them.
  • Center-relative position queries The encoder does not receive absolute image positions. Learned queries tell each patch how it sits relative to the center of the visible region, while the model still produces features at the patches' actual locations.

Why it matters

Intermediate patch features can become unstable when nothing explicitly constrains their structure. Supervising each patch gives the representation a direct target, while center-relative queries provide spatial organization without handing the encoder fixed absolute coordinates.

Before getting into the machinery, here is the idea: make the patch features themselves answer to a structural objective, but avoid giving the encoder an absolute coordinate label for every patch. A learned query still supplies spatial context, measured from the center of what the model can see. That matters because a grid of tokens is only useful if its features have some reliable structure.

  1. Unstable intermediate features: A model can emit a feature at every patch without directly supervising those features. The concern is that such intermediate latents may drift or collapse. The concrete examples here are DINOv2's outlier patch features, which motivated register tokens, and DINOv3's feature-quality degradation, which called for distillation from an earlier checkpoint. I read this as a warning against treating an internal activation as a dependable token just because it has the right shape. What if we supervise the patch features instead of hoping they settle into useful structure?

  2. Keep the grid, supervise its features: The representation is the full patch grid, not only one pooled image feature. The canonical example is a visible image crop split into patches: each patch gets a feature, and those features are used directly as the representation. More generally, this puts the structural objective on the tokens we want to use, rather than on an unrelated summary and an assumption that the rest will follow. It does not guarantee every feature is perfect; it does mean they are no longer merely unregularized leftovers. How can we tell the model about layout without giving it fixed coordinates?

  3. Relative layout, not absolute slots: Think of a notebook whose page numbers change when you move to a different town: the useful cue is where a note sits relative to the page you can currently see, not its permanent address in a global atlas. The analogy breaks because a learned query is not a human-readable location label. In this design, the encoder is stripped of absolute position information, then the representation model cross-attends to learned position embeddings indexed by each patch's offset from the visible input's center. The encoder output supplies image content; the relative query supplies a spatial relation. The model still outputs a feature at every patch's absolute grid location and compares those features there. So the real question is whether a moving, center-relative cue can preserve the layout the representation needs without turning fixed coordinates into a shortcut.

I like the specificity of this compromise: it does not pretend spatial structure should disappear, only that the encoder need not be handed an absolute address. The broader paper also studies other representation-learning objectives, but the key intuition here is this deliberate split between patch content and relative spatial cue.

Read the deep dive

Why People Wanted It

A patch encoder can produce a feature at every location without being taught what those features should mean. That is convenient until the intermediate features drift or collapse: downstream tokenization then depends on representations with no direct structural constraint. The real question is not merely how to extract a grid of tokens, but how to make each patch feature carry useful structure without letting it solve the task by memorizing its absolute slot.

The Core Move

The representation model directly supervises every patch feature, hides absolute position from its encoder, and supplies learned position queries measured relative to the visible input's center. In short: supervise the patch grid, but make its positional cue move with the visible region.

For image XX, let Rθ(X)i,jR_\theta(X)_{i,j} denote the feature at patch position (i,j)(i,j). The representation is the full grid Rθ(X)∈RH×W×DR_\theta(X) \in \mathbb{R}^{H\times W\times D}, not a single pooled token.

Quiz
What combination is used to encourage spatially structured patch features without giving the encoder absolute position information?
Leave patch features unregularized and infer their positions only after training.
Remove all spatial cues and compare only image-level class labels.
Directly supervise each patch feature and use learned queries indexed by offsets from the visible input's center.
Pool all patches into one feature and add a fixed absolute coordinate to the encoder input.

Why Direct Patch Supervision Addresses Unstable Latents

Now the version for readers who want more of the machinery: the design treats structural supervision as a property of the patch features themselves, rather than assuming intermediate tokens will acquire stable structure on their own. The setup explicitly distinguishes supervised features—such as a contrastive model's CLS token—from unregularized intermediate latents, such as non-CLS tokens.

The concern is concrete: unregularized latents can diverge or collapse. The cited examples include outlier patch features in DINOv2, which motivated register tokens, and degraded feature quality in DINOv3, which led to a distillation stage aligning features with an earlier checkpoint. Direct supervision of the full patch grid is the proposed response: each patch feature participates as a representation vector under the structural objective, rather than being left as an unconstrained byproduct.

This does not mean every feature is guaranteed stable under every training setup; the move is to put the patch features under explicit supervision. What structural signal can constrain them without making location itself an easy shortcut?

Why Center-Relative Queries Encourage Spatial Equivariance

Here is the part that gets technical: the encoder loses absolute position information, but the representation model still needs a way to organize features spatially. It cross-attends from encoder outputs to learned position embeddings indexed by each patch's offset from the center of the visible input.

For a visible region with center cc, a patch at absolute grid coordinate (i,j)(i,j) is queried using its relative offset (i,j)−c(i,j)-c. In words, the query says where this patch lies relative to the visible region's center, not which fixed image-grid slot it occupies. The encoder therefore cannot simply pass an absolute position code through, while the output remains a feature at each absolute patch position; features at those positions are then compared by dot product.

That combination is the constraint: remove absolute position from the encoder, restore a relative spatial cue through the query, and evaluate features at their actual patch locations. The intended result is spatial structure that tracks the visible input rather than a fixed coordinate convention. How much spatial organization can this create without encoding absolute coordinates?

Minimal Causal Code

This sketch makes the relative-query choice visible. It is not a full model: encode_without_absolute_positions and the learned query table are placeholders for the architecture's encoder and cross-attention.

import torch

# x: [batch, patches, channels]; center_offset: [patches, 2]
# Position queries depend on offsets from the visible-region center.
relative_queries = position_mlp(center_offset)
encoded = encode_without_absolute_positions(x)

# Cross-attention produces one supervised representation per patch.
patch_features = cross_attention(
    query=relative_queries,
    key=encoded,
    value=encoded,
)

# The training objective directly uses this full patch grid.
loss = representation_objective(patch_features)

What You Gain, and What You Lose

Directly supervising patch features gives the representation objective an explicit handle on the grid, addressing the risk that intermediate latents drift or collapse without structural supervision. Center-relative queries provide spatial information while withholding absolute position from the encoder, so the representation can express relations to the visible region without relying on fixed absolute coordinates.

The tradeoff is that the feature design is not position-free: spatial organization depends on learned relative queries and on the visible region's center. Nor does the described constraint alone establish that all patch features will be stable or equally useful. It replaces an unconstrained intermediate-token assumption with a particular spatial bias—one that may be helpful when relative layout matters, but is still a modeling choice.

Core Takeaway

Supervise the patch grid directly, and let position queries describe where each patch sits relative to the visible region—not an absolute slot.