{"list":"other","total":62,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1803.05407","title":"Averaging Weights Leads to Wider Optima and Better Generalization","created":"2018-03-14","cited_by_count":1209},{"id":"1712.09913","title":"Visualizing the Loss Landscape of Neural Nets","created":"2017-12-28","cited_by_count":1130},{"id":"1812.11118","title":"Reconciling modern machine learning practice and the bias-variance trade-off","created":"2018-12-28","cited_by_count":927},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"1706.08498","title":"Spectrally-normalized margin bounds for neural networks","created":"2017-06-26","cited_by_count":686},{"id":"1710.10345","title":"The Implicit Bias of Gradient Descent on Separable Data","created":"2017-10-27","cited_by_count":655},{"id":"1706.08947","title":"Exploring Generalization in Deep Learning","created":"2017-06-27","cited_by_count":600},{"id":"1509.01240","title":"Train faster, generalize better: Stability of stochastic gradient descent","created":"2015-09-03","cited_by_count":552},{"id":"1906.11300","title":"Benign Overfitting in Linear Regression","created":"2019-06-26","cited_by_count":549},{"id":"1608.04636","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","created":"2016-08-16","cited_by_count":539},{"id":"1708.06633","title":"Nonparametric regression using deep neural networks with ReLU activation function","created":"2017-08-22","cited_by_count":433},{"id":"1908.05355","title":"The generalization error of random features regression: Precise asymptotics and double descent curve","created":"2019-08-14","cited_by_count":413},{"id":"1804.08838","title":"Measuring the Intrinsic Dimension of Objective Landscapes","created":"2018-04-24","cited_by_count":370},{"id":"1811.04918","title":"Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers","created":"2018-11-12","cited_by_count":340},{"id":"1705.09280","title":"Implicit Regularization in Matrix Factorization","created":"2017-05-25","cited_by_count":322},{"id":"1802.05296","title":"Stronger generalization bounds for deep nets via a compression approach","created":"2018-02-14","cited_by_count":307},{"id":"1705.07809","title":"Information-theoretic analysis of generalization capability of learning algorithms","created":"2017-05-22","cited_by_count":303},{"id":"1503.00036","title":"Norm-Based Capacity Control in Neural Networks","created":"2015-02-27","cited_by_count":299},{"id":"1712.06541","title":"Size-Independent Sample Complexity of Neural Networks","created":"2017-12-18","cited_by_count":290},{"id":"1412.0233","title":"The Loss Surfaces of Multilayer Networks","created":"2014-11-30","cited_by_count":280},{"id":"1711.04623","title":"Three Factors Influencing Minima in SGD","created":"2017-11-13","cited_by_count":273},{"id":"1802.08246","title":"Characterizing Implicit Bias in Terms of Optimization Geometry","created":"2018-02-22","cited_by_count":266},{"id":"1806.00468","title":"Implicit Bias of Gradient Descent on Linear Convolutional Networks","created":"2018-06-01","cited_by_count":251},{"id":"1702.03849","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","created":"2017-02-13","cited_by_count":243},{"id":"2103.09177","title":"Deep learning: a statistical viewpoint","created":"2021-03-16","cited_by_count":240},{"id":"1605.07110","title":"Deep Learning without Poor Local Minima","created":"2016-05-23","cited_by_count":234},{"id":"2003.00307","title":"Loss landscapes and optimization in over-parameterized non-linear systems and neural networks","created":"2020-02-29","cited_by_count":233},{"id":"1902.04742","title":"Uniform convergence may be unable to explain generalization in deep learning","created":"2019-02-13","cited_by_count":224},{"id":"1905.13210","title":"Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks","created":"2019-05-30","cited_by_count":222},{"id":"1901.06053","title":"A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networks","created":"2019-01-18","cited_by_count":214},{"id":"1808.00387","title":"Just Interpolate: Kernel \"Ridgeless\" Regression Can Generalize","created":"2018-08-01","cited_by_count":190},{"id":"1810.08033","title":"Adaptivity of deep ReLU network for learning in Besov and mixed smooth Besov spaces: optimal rate and curse of dimensionality","created":"2018-10-18","cited_by_count":162},{"id":"2009.14286","title":"Benign overfitting in ridge regression","created":"2020-09-29","cited_by_count":153},{"id":"1507.03003","title":"High-Dimensional Asymptotics of Prediction: Ridge Regression and Classification","created":"2015-07-10","cited_by_count":148},{"id":"1911.02151","title":"Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates","created":"2019-11-06","cited_by_count":119},{"id":"1901.04609","title":"Tightening Mutual Information Based Bounds on Generalization Error","created":"2019-01-15","cited_by_count":117},{"id":"1802.06175","title":"An Alternative View: When Does SGD Escape Local Minima?","created":"2018-02-17","cited_by_count":115},{"id":"1803.01905","title":"Convergence of Gradient Descent on Separable Data","created":"2018-03-05","cited_by_count":110},{"id":"1706.03175","title":"Recovery Guarantees for One-hidden-layer Neural Networks","created":"2017-06-10","cited_by_count":94},{"id":"1703.01678","title":"Data-Dependent Stability of Stochastic Gradient Descent","created":"2017-03-05","cited_by_count":92},{"id":"1607.06534","title":"The Landscape of Empirical Risk for Non-convex Losses","created":"2016-07-22","cited_by_count":86},{"id":"1803.07300","title":"Risk and parameter convergence of logistic regression","created":"2018-03-20","cited_by_count":85},{"id":"2102.00931","title":"Information-Theoretic Generalization Bounds for Stochastic Gradient Descent","created":"2021-02-01","cited_by_count":84},{"id":"1707.05947","title":"Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints","created":"2017-07-19","cited_by_count":82},{"id":"1801.04295","title":"Generalization Error Bounds for Noisy, Iterative Algorithms","created":"2018-01-12","cited_by_count":82},{"id":"2105.04026","title":"The Modern Mathematics of Deep Learning","created":"2021-05-09","cited_by_count":63},{"id":"1602.02666","title":"A Variational Analysis of Stochastic Gradient Algorithms","created":"2016-02-08","cited_by_count":57},{"id":"1802.04474","title":"Deep Neural Networks Learn Non-Smooth Functions Effectively","created":"2018-02-13","cited_by_count":57},{"id":"1909.11274","title":"Compression based bound for non-compressed network: unified generalization error analysis of large compressible deep neural network","created":"2019-09-25","cited_by_count":39},{"id":"2002.10376","title":"The Two Regimes of Deep Network Training","created":"2020-02-24","cited_by_count":30},{"id":"1311.1873","title":"An Asynchronous Parallel Stochastic Coordinate Descent Algorithm","created":"2013-11-08","cited_by_count":26},{"id":"1910.09626","title":"Non-Gaussianity of Stochastic Gradient Noise","created":"2019-10-21","cited_by_count":22},{"id":"1511.04210","title":"On the Quality of the Initial Basin in Overspecified Neural Networks","created":"2015-11-13","cited_by_count":20},{"id":"2011.02256","title":"Advantage of Deep Neural Networks for Estimating Functions with Singularity on Hypersurfaces","created":"2020-11-04","cited_by_count":17},{"id":"2001.05070","title":"Understanding Generalization in Deep Learning via Tensor Methods","created":"2020-01-14","cited_by_count":14},{"id":"1810.12805","title":"Piecewise Strong Convexity of Neural Networks","created":"2018-10-30","cited_by_count":13},{"id":"1901.00279","title":"Elimination of All Bad Local Minima in Deep Learning","created":"2019-01-02","cited_by_count":10},{"id":"1802.06439","title":"Local Optimality and Generalization Guarantees for the Langevin Algorithm via Empirical Metastability","created":"2018-02-18","cited_by_count":6}],"next_cursor":null}