Skip to content
Preprint

ICON decomposition: Multivariate concept auditing reveals shortcuts that neural networks rely on

Aug 2026 · 0 citations · 55 references
Computer Science Mathematics

TL;DR

This work reframe shortcut auditing as a decomposition of the variance of intermediary representations with Independent Canonical cONcepts (ICON), which separates learned shortcuts from merely correlated concepts, which it confirms with independent validation checks.

Abstract

Deep neural networks often exploit spurious associations, a failure known as shortcut learning. Before deployment, models should therefore be audited for reliance on concepts such as acquisition artifacts and patient demographics. Current methods, including linear probes and concept activation vectors, measure concept reliance by asking whether each concept is decodable from a layer. We show that this framing is misleading: decodability reflects not only concept reliance but also correlations among concepts and the outcome in the auditing dataset. We reframe shortcut auditing as a decomposition of the variance of intermediary representations with Independent Canonical cONcepts (ICON). ICON quantifies the share of a layer's variance explained by each concept conditional on all other concepts and the outcome, and also reports the variance left unexplained. Because ICON explanations are comparable across layers, their trajectories distinguish concepts that drive predictions from those that are merely encoded in the representations. In simulated data with ground truth, ICON recovers concept importance more accurately than seven baselines. In skin-cancer and neuroimaging applications, it separates learned shortcuts from merely correlated concepts, which we confirm with independent validation checks.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

ICON decomposition : Auditing deep neural networks with multivariate, variance-based concept-level explanations

CON decomposition is introduced, which quantifies how much of a layer's variance each concept explains given all other concepts and the outcome, and how much none of them explains, yielding layer-comparable, calibrated scores that suppress false positives.

Roshan Prakash, Marco Simnacher, Manuel Pfeuffer et al. · 0 citations
#artificial intelligence Preprint Oct 2026

TICDA: Tabular In-Context Data Attribution

Tabular foundation models (TFMs) achieve strong predictive performance by conditioning on labeled demonstrations provided in context, without any parameter update. Yet how individual demonstrations shape a given prediction remains poorly understood. This gap matters in practice: the context is often assembled from what...

Yacine Benihaddadene, Milan Bhan, Eliot Dugelay et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Auditing Where Concept Bottleneck Accuracy Comes From on CUB

Concept Bottleneck Models (CBMs) promise predictions that humans can inspect and correct through concepts such as"curved beak". Yet on CUB-200-2011, their standard benchmark, progress is measured like that of ordinary classifiers: by task and concept accuracy. Neither reveals whether the label is predicted from the exp...

S. Saralajew, Eleonora Poeta, Eliana Pastor et al. · 0 citations
#machine learning Preprint Sep 2026

Data Attribution via Sketched Metadifferentiation

Two algorithms, MAGE and SPELL, suited for reconstruction and attribution respectively, are presented, that run on existing metagradient machinery at no extra cost and demonstrate strong performance over existing baselines across training scales and measurement budgets.

Yu-Xi Chen, Hamza Golubovic, Han Tong et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.