{"list":"other","total":56,"rows":[{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1611.03530","title":"Understanding deep learning requires rethinking generalization","created":"2016-11-10","cited_by_count":1674},{"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":"1902.06720","title":"Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descent","created":"2019-02-18","cited_by_count":738},{"id":"1706.08498","title":"Spectrally-normalized margin bounds for neural networks","created":"2017-06-26","cited_by_count":686},{"id":"1810.02054","title":"Gradient Descent Provably Optimizes Over-parameterized Neural Networks","created":"2018-10-04","cited_by_count":659},{"id":"1710.10345","title":"The Implicit Bias of Gradient Descent on Separable Data","created":"2017-10-27","cited_by_count":655},{"id":"1312.4400","title":"Network In Network","created":"2013-12-16","cited_by_count":605},{"id":"1811.03804","title":"Gradient Descent Finds Global Minima of Deep Neural Networks","created":"2018-11-09","cited_by_count":574},{"id":"1904.11955","title":"On Exact Computation with an Infinitely Wide Neural Net","created":"2019-04-26","cited_by_count":573},{"id":"1901.08584","title":"Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networks","created":"2019-01-24","cited_by_count":566},{"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":"1903.08560","title":"Surprises in High-Dimensional Ridgeless Least Squares Interpolation","created":"2019-03-19","cited_by_count":513},{"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":"1811.04918","title":"Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers","created":"2018-11-12","cited_by_count":340},{"id":"1906.05890","title":"Gradient Descent Maximizes the Margin of Homogeneous Neural Networks","created":"2019-06-13","cited_by_count":320},{"id":"1707.09564","title":"A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks","created":"2017-07-29","cited_by_count":314},{"id":"1802.05296","title":"Stronger generalization bounds for deep nets via a compression approach","created":"2018-02-14","cited_by_count":307},{"id":"1503.00036","title":"Norm-Based Capacity Control in Neural Networks","created":"2015-02-27","cited_by_count":299},{"id":"2012.09816","title":"Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learning","created":"2020-12-17","cited_by_count":297},{"id":"1712.06541","title":"Size-Independent Sample Complexity of Neural Networks","created":"2017-12-18","cited_by_count":290},{"id":"1808.01204","title":"Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Data","created":"2018-08-03","cited_by_count":261},{"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":"1903.07571","title":"Two models of double descent for weak features","created":"2019-03-18","cited_by_count":195},{"id":"1808.00387","title":"Just Interpolate: Kernel \"Ridgeless\" Regression Can Generalize","created":"2018-08-01","cited_by_count":190},{"id":"1802.01396","title":"To understand deep learning we need to understand kernel learning","created":"2018-02-05","cited_by_count":187},{"id":"1907.04595","title":"Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networks","created":"2019-07-10","cited_by_count":162},{"id":"1805.12076","title":"Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networks","created":"2018-05-30","cited_by_count":142},{"id":"1705.09886","title":"Convergence Analysis of Two-layer Neural Networks with ReLU Activation","created":"2017-05-28","cited_by_count":137},{"id":"1909.12292","title":"Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networks","created":"2019-09-26","cited_by_count":121},{"id":"2005.10190","title":"Feature Purification: How Adversarial Training Performs Robust Deep Learning","created":"2020-05-20","cited_by_count":107},{"id":"2008.06786","title":"The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalization","created":"2020-08-15","cited_by_count":101},{"id":"2006.05800","title":"On the Optimal Weighted $\\ell_2$ Regularization in Overparameterized Linear Regression","created":"2020-06-10","cited_by_count":98},{"id":"1706.03175","title":"Recovery Guarantees for One-hidden-layer Neural Networks","created":"2017-06-10","cited_by_count":94},{"id":"1911.12360","title":"How Much Over-parameterization Is Sufficient to Learn Deep ReLU Networks?","created":"2019-11-27","cited_by_count":84},{"id":"2007.12826","title":"The Interpolation Phase Transition in Neural Networks: Memorization and Generalization under Lazy Training","created":"2020-07-25","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":"2004.12019","title":"Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regime","created":"2020-04-25","cited_by_count":81},{"id":"1710.10174","title":"SGD Learns Over-parameterized Networks that Provably Generalize on Linearly Separable Data","created":"2017-10-27","cited_by_count":79},{"id":"2202.05928","title":"Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Data","created":"2022-02-11","cited_by_count":74},{"id":"2103.12692","title":"Benign Overfitting of Constant-Stepsize SGD for Linear Regression","created":"2021-03-23","cited_by_count":71},{"id":"2006.05013","title":"A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descent","created":"2020-06-09","cited_by_count":70},{"id":"1705.04591","title":"Learning ReLUs via Gradient Descent","created":"2017-05-10","cited_by_count":54},{"id":"1804.01619","title":"Stability and Convergence Trade-off of Iterative Optimization Algorithms","created":"2018-04-04","cited_by_count":53},{"id":"1806.07808","title":"Learning One-hidden-layer ReLU Networks via Gradient Descent","created":"2018-06-20","cited_by_count":50},{"id":"2006.12476","title":"Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks","created":"2020-06-22","cited_by_count":49},{"id":"2104.13628","title":"Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixtures","created":"2021-04-28","cited_by_count":49},{"id":"2108.11371","title":"Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularization","created":"2021-08-25","cited_by_count":49},{"id":"1712.00779","title":"Gradient Descent Learns One-hidden-layer CNN: Don't be Afraid of Spurious Local Minima","created":"2017-12-03","cited_by_count":40},{"id":"2201.11489","title":"The Implicit Bias of Benign Overfitting","created":"2022-01-27","cited_by_count":38},{"id":"2106.03212","title":"Towards an Understanding of Benign Overfitting in Neural Networks","created":"2021-06-06","cited_by_count":30},{"id":"1709.06129","title":"When is a Convolutional Filter Easy To Learn?","created":"2017-09-18","cited_by_count":21},{"id":"2101.01152","title":"Provable Generalization of SGD-trained Neural Networks of Any Width in the Presence of Adversarial Label Noise","created":"2021-01-04","cited_by_count":17},{"id":"1911.05059","title":"Tight Sample Complexity of Learning One-hidden-layer Convolutional Neural Networks","created":"2019-11-12","cited_by_count":4}],"next_cursor":null}