{"list":"other","total":66,"rows":[{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"1812.07956","title":"On Lazy Training in Differentiable Programming","created":"2018-12-19","cited_by_count":675},{"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":"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":"1805.09545","title":"On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport","created":"2018-05-24","cited_by_count":426},{"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":"1412.6614","title":"In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learning","created":"2014-12-20","cited_by_count":342},{"id":"1802.05296","title":"Stronger generalization bounds for deep nets via a compression approach","created":"2018-02-14","cited_by_count":307},{"id":"2002.04486","title":"Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Loss","created":"2020-02-11","cited_by_count":268},{"id":"1806.00468","title":"Implicit Bias of Gradient Descent on Linear Convolutional Networks","created":"2018-06-01","cited_by_count":251},{"id":"1901.09401","title":"SGD: General Analysis and Improved Rates","created":"2019-01-27","cited_by_count":207},{"id":"1902.06015","title":"Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limit","created":"2019-02-16","cited_by_count":187},{"id":"2207.08799","title":"Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit","created":"2022-07-18","cited_by_count":187},{"id":"1902.04674","title":"Towards moderate overparameterization: global convergence guarantees for training shallow neural networks","created":"2019-02-12","cited_by_count":176},{"id":"2006.06914","title":"Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses","created":"2020-06-12","cited_by_count":173},{"id":"2206.15144","title":"Neural Networks can Learn Representations with Gradient Descent","created":"2022-06-30","cited_by_count":161},{"id":"2006.13409","title":"When Do Neural Networks Outperform Kernel Methods?","created":"2020-06-24","cited_by_count":150},{"id":"2205.01445","title":"High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representation","created":"2022-05-03","cited_by_count":150},{"id":"2202.08658","title":"The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks","created":"2022-02-17","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":"1904.13262","title":"Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networks","created":"2019-04-30","cited_by_count":124},{"id":"2003.10409","title":"Online stochastic gradient descent on non-convex losses from high-dimensional inference","created":"2020-03-23","cited_by_count":119},{"id":"1906.08632","title":"Dynamics of stochastic gradient descent for two-layer neural networks in the teacher-student setup","created":"2019-06-18","cited_by_count":112},{"id":"2106.09524","title":"Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticity","created":"2021-06-17","cited_by_count":110},{"id":"1904.00687","title":"On the Power and Limitations of Random Features for Understanding Neural Networks","created":"2019-04-01","cited_by_count":103},{"id":"1706.03175","title":"Recovery Guarantees for One-hidden-layer Neural Networks","created":"2017-06-10","cited_by_count":94},{"id":"1910.07833","title":"Sharper bounds for uniformly stable algorithms","created":"2019-10-17","cited_by_count":93},{"id":"1905.10337","title":"What Can ResNet Learn Efficiently, Going Beyond Kernels?","created":"2019-05-24","cited_by_count":91},{"id":"1906.08899","title":"Limitations of Lazy Training of Two-layers Neural Networks","created":"2019-06-21","cited_by_count":87},{"id":"2102.00931","title":"Information-Theoretic Generalization Bounds for Stochastic Gradient Descent","created":"2021-02-01","cited_by_count":84},{"id":"1702.05419","title":"A Random Matrix Approach to Neural Networks","created":"2017-02-17","cited_by_count":80},{"id":"2010.02501","title":"A Unifying View on Implicit Bias in Training Linear Neural Networks","created":"2020-10-06","cited_by_count":75},{"id":"1908.01842","title":"Nonparametric Regression on Low-Dimensional Manifolds using Deep ReLU Networks : Function Approximation and Statistical Recovery","created":"2019-08-05","cited_by_count":73},{"id":"2102.11742","title":"Classifying high-dimensional Gaussian mixtures: Where kernel methods fail and neural networks succeed","created":"2021-02-23","cited_by_count":69},{"id":"2006.09313","title":"Hausdorff Dimension, Heavy Tails, and Generalization in Neural Networks","created":"2020-06-16","cited_by_count":62},{"id":"1702.07966","title":"Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputs","created":"2017-02-26","cited_by_count":61},{"id":"2202.01009","title":"Mean-Field Langevin Dynamics: Exponential Convergence and Annealing","created":"2022-02-02","cited_by_count":61},{"id":"1812.09859","title":"Generalization Bounds for Uniformly Stable Algorithms","created":"2018-12-24","cited_by_count":56},{"id":"2201.10469","title":"Convex Analysis of the Mean Field Langevin Dynamics","created":"2022-01-25","cited_by_count":55},{"id":"1806.07808","title":"Learning One-hidden-layer ReLU Networks via Gradient Descent","created":"2018-06-20","cited_by_count":50},{"id":"2006.15459","title":"Optimization and Generalization of Shallow Neural Networks with Quadratic Activation Functions","created":"2020-06-27","cited_by_count":50},{"id":"2202.00293","title":"Phase diagram of Stochastic Gradient Descent in high-dimensional two-layer neural networks","created":"2022-02-01","cited_by_count":50},{"id":"2006.07904","title":"An Analysis of Constant Step Size SGD in the Non-convex Regime: Asymptotic Normality and Bias","created":"2020-06-14","cited_by_count":48},{"id":"2102.02410","title":"A Local Convergence Theory for Mildly Over-Parameterized Two-Layer Neural Network","created":"2021-02-04","cited_by_count":47},{"id":"2106.03795","title":"Heavy Tails in SGD and Compressibility of Overparametrized Neural Networks","created":"2021-06-07","cited_by_count":44},{"id":"2103.01210","title":"Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels","created":"2021-03-01","cited_by_count":41},{"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":"2007.02486","title":"Regularization Matters: A Nonparametric Perspective on Overparametrized Neural Network","created":"2020-07-06","cited_by_count":38},{"id":"2008.11245","title":"Deep Networks and the Multiple Manifold Problem","created":"2020-08-25","cited_by_count":35},{"id":"2202.07626","title":"Random Feature Amplification: Feature Learning and Generalization in Neural Networks","created":"2022-02-15","cited_by_count":35},{"id":"2004.13748","title":"Learning Polynomials of Few Relevant Dimensions","created":"2020-04-28","cited_by_count":34},{"id":"2006.01005","title":"The Effects of Mild Over-parameterization on the Optimization Landscape of Shallow ReLU Neural Networks","created":"2020-06-01","cited_by_count":33},{"id":"2104.04244","title":"How rotational invariance of common kernels prevents generalization in high dimensions","created":"2021-04-09","cited_by_count":32},{"id":"2111.12876","title":"Time-independent Generalization Bounds for SGLD in Non-convex Settings","created":"2021-11-25","cited_by_count":27},{"id":"2106.04881","title":"Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms","created":"2021-06-09","cited_by_count":23},{"id":"2206.12314","title":"Learning sparse features can lead to overfitting in neural networks","created":"2022-06-24","cited_by_count":23},{"id":"2106.06251","title":"On Learnability via Gradient Method for Two-Layer ReLU Neural Networks in Teacher-Student Setting","created":"2021-06-11","cited_by_count":16},{"id":"2209.08951","title":"Generalization Bounds for Stochastic Gradient Descent via Localized $\\varepsilon$-Covers","created":"2022-09-19","cited_by_count":11},{"id":"1906.08034","title":"Disentangling feature and lazy training in deep neural networks","created":"2019-06-19","cited_by_count":10},{"id":"2201.06656","title":"Generalization in Supervised Learning Through Riemannian Contraction","created":"2022-01-17","cited_by_count":8},{"id":"2107.14324","title":"Deep Networks Provably Classify Data on Curves","created":"2021-07-29","cited_by_count":6},{"id":"2107.05341","title":"Nonparametric Regression with Shallow Overparameterized Neural Networks Trained by GD with Early Stopping","created":"2021-07-12","cited_by_count":5},{"id":"1611.06686","title":"Scalable Approximations for Generalized Linear Problems","created":"2016-11-21","cited_by_count":4}],"next_cursor":null}