AIarXiv

Ranked by formulaVerdict: Notable

Align Once to Explain: Feature Alignment for Scalable B-cosification of Foundational Vision Transformers

Foundational vision models have become the de facto standard for many vision tasks due to their strong performance.

By Maser, Gairola, Rao +1

Score████░░░░░░4.2

VerdictWorth a reader's time today.

Read the originalPDFCode

Abstract

Foundational vision models have become the de facto standard for many vision tasks due to their strong performance. However, they are notoriously opaque and remain hard to interpret. We present ALOE (ALign Once to Explain), a one-time, label-free feature alignment approach that efficiently converts foundational vision models into inherently interpretable B-cos variants. Once aligned, the B-cos backbone is used as a drop-in replacement across several downstream tasks-amortizing the cost of interpretability. ALOE is robust across pre-training paradigms (supervised, self-supervised, vision-language) and can preserve teacher-level generalization with orders of magnitude less data than training from scratch. On classification, it strongly outperforms vanilla B-cosification (e.g., +10.5 p.p. top-1 on ImageNet for DINOv3 ViT-B/16), retains strong linear probing, k-NN, and zero-shot transfer competitive with foundational backbones (DINOv3, SigLIP2) across diverse downstream datasets. It also preserves spatially structured features useful for dense prediction, while yielding well-localized and highly human-interpretable explanations by design.

Raphael Maser, Siddhartha Gairola, Sukrut Rao, Bernt Schiele

The editor's rubric

Heuristic review

Leverage4 / 5
A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
16% of this desk’s rubric
Trajectory4 / 5
Improves predictably with data, compute, or investment.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (many tasks, zero/few-shot); gains (orders of magnitude, outperforms); verification (multiple benchmarks, code released); scale (scalable, orders of magnitude, efficient).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.2

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
6.6 / 10
Weighted rubric, evidence-gated.
Adjusted merit
5.3 / 10
Shrunk toward the desk prior by editor confidence (48%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
79%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v10 on Nov 3, 2026, 13:38 UTC. Paper type: method.
  • Categories: cs.CV
  • TOP, No.2 in the Front page edition of November 3, 2026.
  • TOP, No.5 in the Artificial Intelligence edition of November 3, 2026.