Is the Information Bottleneck Robust Enough? Towards Label-Noise Resistant Information Bottleneck Learning
Not on the map. Why?
Abstract (arXiv)
The Information Bottleneck (IB) principle facilitates effective representation learning by preserving label-relevant information while compressing irrelevant information. However, its strong reliance on accurate labels makes it inherently vulnerable to label noise, prevalent in real-world scenarios, resulting in significant performance degradation and overfitting. To address this issue, we propose LaT-IB, a novel Label-Noise ResistanT Information Bottleneck method which introduces a "Minimal-Sufficient-Clean" (MSC) criterion. Instantiated as a mutual information regularizer to retain task-relevant information while discarding noise, MSC addresses standard IB's vulnerability to noisy label supervision. To achieve this, LaT-IB employs a noise-aware latent disentanglement that decomposes the latent representation into components aligned with to the clean label space and the noise space. Theoretically, we first derive mutual information bounds for each component of our objective including prediction, compression, and disentanglement, and moreover prove that optimizing it encourages representations invariant to input noise and separates clean and noisy label information. Furthermore, we design a three-phase training framework: Warmup, Knowledge Injection and Robust Training, to progressively guide the model toward noise-resistant representations. Extensive experiments demonstrate that LaT-IB achieves superior robustness and efficiency under label noise, significantly enhancing robustness and applicability in real-world scenarios with label noise.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 20 of its 33 references that are in the map. First posted on arXiv 11 Dec 2025.
Builds on
20 of 33 references.
References · 20
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 994
- 2017A Closer Look at Memorization in Deep Networkscited by 936
- 2020Long-tail learning via logit adjustmentcited by 605
- 2019Symmetric Cross Entropy for Robust Learning with Noisy Labelscited by 499
- 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 414
- 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
- 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 253
- 2020Graph Information Bottleneckcited by 168
- 2017Nonlinear Information Bottleneckcited by 71
- 2022ProMix: Combating Label Noise via Maximizing Clean Sample Utilitycited by 48
8 more
- 2019How does Early Stopping Help Generalization against Label Noise?cited by 41
- 2022Robust Information Bottleneck for Task-Oriented Communication with Digital Modulationcited by 28
- 2023Learning on Graphs under Label Noisecited by 22
- 2021Adaptive Sample Selection for Robust Learning under Label Noisecited by 20
- 2024NoisyGL: A Comprehensive Benchmark for Graph Neural Networks under Label Noisecited by 16
- 2023Combating Bilateral Edge Noise for Robust Link Predictioncited by 9
- 2019Extracting robust and accurate features via a robust information bottleneckcited by 6
- 2024Structured IB: Improving Information Bottleneck with Structured Feature Learningcited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.