Doubly Stochastic Models: Learning with Unbiased Label Noises and Inference Stability
Not on the map. Why?
Abstract (arXiv)
Random label noises (or observational noises) widely exist in practical machine learning settings. While previous studies primarily focus on the affects of label noises to the performance of learning, our work intends to investigate the implicit regularization effects of the label noises, under mini-batch sampling settings of stochastic gradient descent (SGD), with assumptions that label noises are unbiased. Specifically, we analyze the learning dynamics of SGD over the quadratic loss with unbiased label noises, where we model the dynamics of SGD as a stochastic differentiable equation (SDE) with two diffusion terms (namely a Doubly Stochastic Model). While the first diffusion term is caused by mini-batch sampling over the (label-noiseless) loss gradients as many other works on SGD, our model investigates the second noise term of SGD dynamics, which is caused by mini-batch sampling over the label noises, as an implicit regularizer. Our theoretical analysis finds such implicit regularizer would favor some convergence points that could stabilize model outputs against perturbation of parameters (namely inference stability). Though similar phenomenon have been investigated, our work doesn't assume SGD as an Ornstein-Uhlenbeck like process and achieve a more generalizable result with convergence of approximation proved. To validate our analysis, we design two sets of empirical studies to analyze the implicit regularizer of SGD with unbiased random label noises for deep neural networks training and linear regression.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 41 of its 66 references that are in the map. First posted on arXiv 1 Apr 2023.
Builds on
41 of 66 references.
References · 41
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,304
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
- 2019Symmetric Cross Entropy for Robust Learning with Noisy Labelscited by 499
- 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 491
29 more
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
- 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 278
- 2017Three Factors Influencing Minima in SGDcited by 270
- 2015Unifying distillation and privileged informationcited by 218
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
- 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
- 2019Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networkscited by 158
- 2020Knowledge Distillation Meets Self-Supervisioncited by 142
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
- 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
- 2019Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like processcited by 123
- 2019Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networkscited by 122
- 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 109
- 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 108
- 2019Traditional and Heavy-Tailed Self Regularization in Neural Network Modelscited by 104
- 2017Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimizationcited by 96
- 2018A Continuous-Time View of Early Stopping for Least Squarescited by 67
- 2016Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regressioncited by 64
- 2020The Implicit Regularization of Stochastic Gradient Flow for Least Squarescited by 58
- 2019Heavy-Tailed Universality Predicts Trends in Test Accuracies for Very Large Pre-Trained Deep Neural Networkscited by 43
- 2020Tight Nonparametric Convergence Rates for Stochastic Gradient Descent under the Noiseless Linear Modelcited by 39
- 2019Beyond Least-Squares: Fast Rates for Regularized Empirical Risk Minimization through Self-Concordancecited by 28
- 2018On Tighter Generalization Bound for Deep Neural Networks: CNNs, ResNets, and Beyondcited by 24
- 2020Analysis of Stochastic Gradient Descent in Continuous Timecited by 24
- 2017Statistical inference using SGDcited by 21
- 2022Random matrix analysis of deep neural network weight matricescited by 21
- 2019Information-Theoretic Local Minima Characterization and Regularizationcited by 14
- 2019Quasi-potential as an implicit regularizer for the loss function in the stochastic gradient descentcited by 3
Built on by
Not cited yet.