Sample-efficient Learning of Concepts with Theoretical Guarantees: from Data to Concepts without Interventions
Hidde Fokkema, Tim van Erven, Sara Magliacane
摘要
Machine learning is a vital part of many real-world systems, but several concerns remain about the lack of interpretability, explainability and robustness of black-box AI systems. Concept Bottleneck Models (CBM) address some of these challenges by learning interpretable concepts from high-dimensional data, e.g. images, which are used to predict labels. An important issue in CBMs are spurious correlation between concepts, which effectively lead to learning"wrong"concepts. Current mitigating strategies have strong assumptions, e.g., they assume that the concepts are statistically independent of each other, or require substantial interaction in terms of both interventions and labels provided by annotators. In this paper, we describe a framework that provides theoretical guarantees on the correctness of the learned concepts and on the number of required labels, without requiring any interventions. Our framework leverages causal representation learning (CRL) methods to learn latent causal variables from high-dimensional observations in a unsupervised way, and then learns to align these variables with interpretable concepts with few concept labels. We propose a linear and a non-parametric estimator for this mapping, providing a finite-sample high probability result in the linear case and an asymptotic consistency result for the non-parametric estimator. We evaluate our framework in synthetic and image benchmarks, showing that the learned concepts have less impurities and are often more accurate than other CBMs, even in settings with strong correlations between concepts.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- When Does Closeness in Distribution Imply Representational Similarity? An Identifiability PerspectiveBeatrix M. G. Nielsen, Emanuele Marconato, Andrea Dittadi, Luigi GreseleNeurIPS 2025 · 被引用 7 次
- Low-Sensitivity Matching via Sampling from Gibbs DistributionsYuichi Yoshida, Zihan ZhangSODA 2026
它引用的顶会 Paper20
- Concept Bottleneck ModelsPang Wei Koh, Thao Nguyen, Yew Siang Tang, Stephen Mussmann 等ICML 2020 · 被引用 1,233 次
- Causal Abstractions of Neural NetworksAtticus Geiger, Hanson Lu, Thomas Icard, Christopher PottsNeurIPS 2021 · 被引用 516 次
- Self-Supervised Learning with Data Augmentations Provably Isolates Content from StyleJulius von Kügelgen, Yash Sharma, Luigi Gresele, Wieland Brendel 等NeurIPS 2021 · 被引用 421 次
- Contrastive Learning Inverts the Data Generating ProcessRoland S. Zimmermann, Yash Sharma, Steffen Schneider, Matthias Bethge 等ICML 2021 · 被引用 264 次
- Addressing Leakage in Concept Bottleneck ModelsMarton Havasi, Sonali Parbhoo, Finale Doshi-VelezNeurIPS 2022 · 被引用 163 次
相关 Paper
- There Was Never a Bottleneck in Concept Bottleneck ModelsAntonio Almudévar, José Miguel Hernández-Lobato, Alfonso OrtegaICLR 2026 · 被引用 9 次
- Causally Reliable Concept Bottleneck ModelsGiovanni de Felice, Arianna Casanova Flores, Francesco De Santis, Silvia Santini 等NeurIPS 2025 · 被引用 20 次
- Counterfactual Concept Bottleneck ModelsGabriele Dominici, Pietro Barbiero, Francesco Giannini, Martin Gjoreski 等ICLR 2025
- Semi-Supervised Concept Bottleneck ModelsLijie Hu, Tianhao Huang, Huanyi Xie, Xilin Gong 等ICCV 2025 · 被引用 4 次
- Causal Representation Learning Made Identifiable by Grouping of Observational VariablesHiroshi Morioka, Aapo HyvärinenICML 2024 · 被引用 26 次
