mlsanityData to 7 Oct 2026

Learning Deep Neural Networks under Agnostic Corrupted Supervision

arXiv 2102.06735 ↗First posted 12 Feb 2021cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Training deep neural models in the presence of corrupted supervision is challenging as the corrupted data points may significantly impact the generalization performance. To alleviate this problem, we present an efficient robust algorithm that achieves strong guarantees without any assumption on the type of corruption and provides a unified framework for both classification and regression problems. Unlike many existing approaches that quantify the quality of the data points (e.g., based on their individual loss values), and filter them accordingly, the proposed algorithm focuses on controlling the collective impact of data points on the average gradient. Even when a corrupted data point failed to be excluded by our algorithm, the data point will have a very limited impact on the overall loss, as compared with state-of-the-art filtering methods based on loss values. Extensive experiments on multiple benchmark datasets have demonstrated the robustness of our algorithm under different types of corruption.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 46 references that are in the map. First posted on arXiv 12 Feb 2021.

Builds on

25 of 46 references.

References · 25

  1. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  2. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  3. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
  4. 2019Big Transfer (BiT): General Visual Representation Learningcited by 766
  5. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
  6. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
  7. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  8. 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
  9. 2014Training Deep Neural Networks on Noisy Labels with Bootstrappingcited by 322
  10. 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
  11. 2017Decoupling "when to update" from "how to update"cited by 230
  12. 2019Probabilistic End-to-end Noise Correction for Learning with Noisy Labelscited by 210
13 more
  1. 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
  2. 2017Learning from Noisy Labels with Distillationcited by 160
  3. 2016Agnostic Estimation of Mean and Covariancecited by 131
  4. 2018Sever: A Robust Meta-Algorithm for Stochastic Optimizationcited by 123
  5. 2018Robust Estimation via Robust Gradient Estimationcited by 76
  6. 2020Error-Bounded Correction of Noisy Labelscited by 74
  7. 2015Efficient Per-Example Gradient Computationscited by 42
  8. 2019Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detectioncited by 41
  9. 2015Robust Regression via Hard Thresholdingcited by 39
  10. 2020Choosing the Sample with Lowest Loss makes SGD Robustcited by 26
  11. 2016Self-Paced Learning: an Implicit Regularization Perspectivecited by 21
  12. 2020High-Dimensional Robust Mean Estimation via Gradient Descentcited by 16
  13. 2020Robust Collaborative Learning with Noisy Labelscited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 1.

3 papers.