mlsanityData to 14 Oct 2026

Sample Selection via Contrastive Fragmentation for Noisy Label Regression

arXiv 2502.17771 ↗First posted 25 Feb 2025cs.LG cs.AI cs.CVcited by 4

Not on the map. Why?

Abstract (arXiv)

As with many other problems, real-world regression is plagued by the presence of noisy labels, an inevitable issue that demands our attention. Fortunately, much real-world data often exhibits an intrinsic property of continuously ordered correlations between labels and features, where data points with similar labels are also represented with closely related features. In response, we propose a novel approach named ConFrag, where we collectively model the regression data by transforming them into disjoint yet contrasting fragmentation pairs. This enables the training of more distinctive representations, enhancing the ability to select clean samples. Our ConFrag framework leverages a mixture of neighboring fragments to discern noisy labels through neighborhood agreement among expert feature extractors. We extensively perform experiments on six newly curated benchmark datasets of diverse domains, including age prediction, price prediction, and music production year estimation. We also introduce a metric called Error Residual Ratio (ERR) to better account for varying degrees of label noise. Our approach consistently outperforms fourteen state-of-the-art baselines, being robust against symmetric and random Gaussian label noise.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 82 of its 129 references that are in the map. First posted on arXiv 25 Feb 2025.

Builds on

82 of 129 references.

References · 82

  1. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  2. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  3. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
  4. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  5. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
  6. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
  7. 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 997
  8. 2017A Closer Look at Memorization in Deep Networkscited by 942
  9. 2021Revisiting Deep Learning Models for Tabular Datacited by 740
  10. 2018Deep Ordinal Regression Network for Monocular Depth Estimationcited by 723
  11. 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
  12. 2018Learning to Reweight Examples for Robust Deep Learningcited by 675
38 more
  1. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
  2. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 653
  3. 2020Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networkscited by 566
  4. 2019Symmetric Cross Entropy for Robust Learning with Noisy Labelscited by 500
  5. 2017Age Progression/Regression by Conditional Adversarial Autoencodercited by 429
  6. 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 416
  7. 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 328
  8. 2014Training Deep Neural Networks on Noisy Labels with Bootstrappingcited by 322
  9. 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 320
  10. 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
  11. 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 261
  12. 2018Using Trusted Data to Train Deep Networks on Labels Corrupted by Severe Noisecited by 216
  13. 2019Probabilistic End-to-end Noise Correction for Learning with Noisy Labelscited by 210
  14. 2022Why do tree-based models still outperform deep learning on tabular data?cited by 199
  15. 2017CleanNet: Transfer Learning for Scalable Image Classifier Training with Label Noisecited by 181
  16. 2018Dimensionality-Driven Learning with Noisy Labelscited by 173
  17. 2021Delving into Deep Imbalanced Regressioncited by 158
  18. 2023Pushing Mixture of Experts to the Limit: Extremely Parameter Efficient MoE for Instruction Tuningcited by 150
  19. 2020Dual T: Reducing Estimation Error for Transition Matrix in Label-noise Learningcited by 142
  20. 2021Deep Learning Through the Lens of Example Difficultycited by 141
  21. 2020Self-Adaptive Training: beyond Empirical Risk Minimizationcited by 126
  22. 2021Understanding and Improving Early Stopping for Learning with Noisy Labelscited by 113
  23. 2021Taming Sparsely Activated Transformer with Stochastic Expertscited by 113
  24. 2021FastMoE: A Fast Mixture-of-Expert Training Systemcited by 112
  25. 2022Selective-Supervised Contrastive Learning with Noisy Labelscited by 112
  26. 2020A unifying mutual information view of metric learning: cross-entropy vs. pairwise lossescited by 100
  27. 2020Multi-Objective Interpolation Training for Robustness to Label Noisecited by 86
  28. 2021FINE Samples for Learning with Noisy Labelscited by 82
  29. 2021Sample Selection with Uncertainty of Losses for Learning with Noisy Labelscited by 79
  30. 2022UNICON: Combating Label Noise Through Uniform Selection and Contrastive Learningcited by 77
  31. 2020A Topological Filter for Learning with Label Noisecited by 76
  32. 2021Scalable and Efficient MoE Training for Multitask Multilingual Modelscited by 76
  33. 2021On the geometry of generalization and memorization in deep neural networkscited by 73
  34. 2019Robust Inference via Generative Classifiers for Handling Noisy Labelscited by 68
  35. 2021Open-set Label Noise Can Improve Robustness Against Inherent Label Noisecited by 59
  36. 2022C-Mixup: Improving Generalization in Regressioncited by 57
  37. 2022RankSim: Ranking Similarity Regularization for Deep Imbalanced Regressioncited by 52
  38. 2023Improving Deep Regression with Ordinal Entropycited by 45

50 most cited of 82 All 82 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.