Label Noise: Ignorance is Bliss

Published on ● Video Link: https://www.youtube.com/watch?v=LSemlmImA_o



Duration: 0:00
569 views
0


Clayton Scott (University of Michigan)
https://simons.berkeley.edu/talks/clayton-scott-university-michigan-2024-11-12
Domain Adaptation and Related Areas

We establish a new theoretical framework for learning under multi-class, instance-dependent label noise. At the heart of our framework is the concept of \emph{relative signal strength} (RSS), which is a point-wise measure of noisiness. Using relative signal strength, we establish matching upper and lower bounds for excess risk. Our theoretical findings reveal a surprising result: the extremely simple \emph{Noise Ignorant Empirical Risk Minimization (NI-ERM)} principle, which conducts empirical risk minimization as if no label noise exists, is minimax optimal. Finally, we translate these theoretical insights into practice: by using NI-ERM to fit a linear classifier on top of a self-supervised feature extractor, we achieve state-of-the-art performance on the CIFAR-N data challenge.




Other Videos By Simons Institute for the Theory of Computing


2024-11-14Open-Source and Science in the Era of Foundation Models
2024-11-13Toward Understanding the Extrapolation of Nonlinear Models to Unseen Domains or the Whole Domain
2024-11-13Language-guided Adaptation
2024-11-13On Spurious Associations and LLM Alignment
2024-11-13Causally motivated robustness to shortcut learning
2024-11-13Talk by Zachary Lipton
2024-11-12Distribution shift in ecological data: generalization vs. specialization,
2024-11-12Transfer learning via local convergence rates of the nonparametric least squares estimator
2024-11-12Transfer learning for weak-to-strong generalization
2024-11-12User-level and federated local differential privacy
2024-11-11Label Noise: Ignorance is Bliss
2024-10-16The Enigma of LLMs: on Creativity, Compositionality, Pluralism, and Paradoxes
2024-10-02Let’s Try and Be More Tolerant: On Tolerant Property Testing and Distance Approximation
2024-10-02A Strong Separation for Adversarially Robust L_0 Estimation for Linear Sketches
2024-10-02Towards Practical Distribution Testing
2024-10-02Toward Optimal Semi-streaming Algorithm for (1+ε)-approximate Maximum Matching
2024-10-02Plenary Talk: Privately Evaluating Untrusted Black-Box Functions
2024-10-02The long path to \sqrt{d} monotonicity testers
2024-10-02O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set
2024-10-02Distribution Learning Meets Graph Structure Sampling
2024-10-02On the instance optimality of detecting collisions and subgraphs