Skip to content
Preprint

ICON Decomposition: Auditing deep neural networks for shortcuts by decomposing layer-wise representations using concepts

Aug 2026 · 0 citations · 56 references
Computer Science Mathematics

Abstract

Deep neural networks often exploit spurious associations, a failure known as shortcut learning. Before deployment, models should be audited for reliance on a set of concepts, such as acquisition artifacts or demographics. Current methods, such as linear probes and concept activation vectors, measure reliance by asking whether each concept, in isolation, is decodable from a layer. Their scores therefore reflect not only reliance but also correlations in the audit dataset. We introduce Independent Canonical cONcept (ICON) decomposition, which quantifies the share of a layer's variance each concept explains, conditional on all other concepts and the outcome. ICON scores are variance shares, comparable across layers and between continuous and categorical concepts. ICON also reports the share the set leaves unexplained. On simulated data, ICON recovers the true importance more accurately than seven baselines. On skin-cancer and neuroimaging models, ICON distinguishes learned shortcuts from correlated concepts, confirmed by retraining and out-of-distribution tests.

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
#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
#machine learning Preprint Sep 2026

A Systematic Benchmark of Explainable Methods for Temporal Attribution in Sequential Recommendation Systems

Sequential RecSys are central to modern personalization, exploiting user's historical interaction sequences to drive next-step decisions. Deep learning models, particularly CNN and Transformer-based architectures, have proven highly effective at capturing temporal dependencies in these histories. For transparency and t...

Akash Pandey, Kanisha Shah, Addrish Roy et al. · 0 citations
Open access Sep 2026

SPURIOUS CORRELATIONS IN EXPLAINABLE AI: DETECTION, QUANTIFICATION AND MITIGATION

Modern explainable AI (XAI) methods are widely used to audit deep neural networks, yet a growing body of evidence shows that the very explanations they produce can be hijacked by spurious correlations - statistical shortcuts between non-causal input features (image background, demographic attributes, textual artefacts)...

Oleksandr S. Verbytskyi · 0 citations

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