{"list":"other","total":51,"rows":[{"id":"1511.07289","title":"Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)","created":"2015-11-23","cited_by_count":1070},{"id":"1812.07956","title":"On Lazy Training in Differentiable Programming","created":"2018-12-19","cited_by_count":675},{"id":"1412.8690","title":"Breaking the Curse of Dimensionality with Convex Neural Networks","created":"2014-12-30","cited_by_count":331},{"id":"1906.05890","title":"Gradient Descent Maximizes the Margin of Homogeneous Neural Networks","created":"2019-06-13","cited_by_count":320},{"id":"2002.09277","title":"Kernel and Rich Regimes in Overparametrized Models","created":"2020-02-20","cited_by_count":306},{"id":"1703.00887","title":"How to Escape Saddle Points Efficiently","created":"2017-03-02","cited_by_count":285},{"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":"1503.02101","title":"Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition","created":"2015-03-06","cited_by_count":243},{"id":"2006.06657","title":"Directional convergence and alignment in deep learning","created":"2020-06-11","cited_by_count":178},{"id":"1602.04474","title":"Generalization Properties of Learning with Random Features","created":"2016-02-14","cited_by_count":164},{"id":"2206.15144","title":"Neural Networks can Learn Representations with Gradient Descent","created":"2022-06-30","cited_by_count":161},{"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":"1502.06800","title":"On the Equivalence between Kernel Quadrature Rules and Random Feature Expansions","created":"2015-02-24","cited_by_count":138},{"id":"1605.07272","title":"Matrix Completion has No Spurious Local Minimum","created":"2016-05-24","cited_by_count":125},{"id":"1804.07795","title":"Stochastic subgradient method converges on tame functions","created":"2018-04-20","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":"1910.01635","title":"A Function Space View of Bounded Norm Infinite Width ReLU Nets: The Multivariate Case","created":"2019-10-03","cited_by_count":114},{"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":"2101.10588","title":"Generalization error of random features and kernel methods: hypercontractivity and kernel matrix concentration","created":"2021-01-26","cited_by_count":110},{"id":"1902.05040","title":"How do infinite width bounded norm networks look in function space?","created":"2019-02-13","cited_by_count":106},{"id":"1706.03175","title":"Recovery Guarantees for One-hidden-layer Neural Networks","created":"2017-06-10","cited_by_count":94},{"id":"1602.06664","title":"A Geometric Analysis of Phase Retrieval","created":"2016-02-22","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":"1711.00501","title":"Learning One-hidden-layer Neural Networks with Landscape Design","created":"2017-11-01","cited_by_count":81},{"id":"1910.01619","title":"Beyond Linearization: On Quadratic and Higher-Order Approximation of Wide Neural Networks","created":"2019-10-03","cited_by_count":79},{"id":"2206.04030","title":"High-dimensional limit theorems for SGD: Effective dynamics and critical scaling","created":"2022-06-08","cited_by_count":70},{"id":"2209.14863","title":"Neural Networks Efficiently Learn Low-Dimensional Representations with SGD","created":"2022-09-29","cited_by_count":63},{"id":"2006.12011","title":"Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent","created":"2020-06-22","cited_by_count":58},{"id":"1705.04591","title":"Learning ReLUs via Gradient Descent","created":"2017-05-10","cited_by_count":54},{"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.12476","title":"Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks","created":"2020-06-22","cited_by_count":49},{"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":"1606.04970","title":"The non-convex Burer-Monteiro approach works on smooth semidefinite programs","created":"2016-06-15","cited_by_count":46},{"id":"2006.13436","title":"Towards Understanding Hierarchical Learning: Benefits of Neural Representations","created":"2020-06-24","cited_by_count":46},{"id":"2103.01210","title":"Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels","created":"2021-03-01","cited_by_count":41},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39},{"id":"1810.11059","title":"Uniform Convergence of Gradients for Non-Convex Learning and Optimization","created":"2018-10-25","cited_by_count":38},{"id":"1711.05424","title":"The landscape of the spiked tensor model","created":"2017-11-15","cited_by_count":34},{"id":"1911.01462","title":"Time/Accuracy Tradeoffs for Learning a ReLU with respect to Gaussian Marginals","created":"2019-11-04","cited_by_count":32},{"id":"1902.00139","title":"Passed & Spurious: Descent Algorithms and Local Minima in Spiked Matrix-Tensor Models","created":"2019-02-01","cited_by_count":28},{"id":"2202.05258","title":"Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks","created":"2022-02-10","cited_by_count":28},{"id":"1812.09066","title":"Marvels and Pitfalls of the Langevin Algorithm in Noisy High-dimensional Inference","created":"2018-12-21","cited_by_count":24},{"id":"1804.02686","title":"Complex energy landscapes in spiked-tensor and simple glassy models: ruggedness, arrangements of local minima and phase transitions","created":"2018-04-08","cited_by_count":23},{"id":"1706.05598","title":"On the Optimization Landscape of Tensor Decompositions","created":"2017-06-18","cited_by_count":21},{"id":"2106.10744","title":"On the Cryptographic Hardness of Learning Single Periodic Neurons","created":"2021-06-20","cited_by_count":20},{"id":"2102.00434","title":"The Connection Between Approximation, Depth Separation and Learnability in Neural Networks","created":"2021-01-31","cited_by_count":19},{"id":"2112.02393","title":"Optimization-Based Separations for Neural Networks","created":"2021-12-04","cited_by_count":17},{"id":"1912.02143","title":"Landscape Complexity for the Empirical Risk of Generalized Linear Models","created":"2019-12-04","cited_by_count":15},{"id":"2006.03177","title":"Hardness of Learning Neural Networks with Natural Weights","created":"2020-06-05","cited_by_count":15},{"id":"2206.03688","title":"Identifying good directions to escape the NTK regime and efficiently learn low-degree plus sparse polynomials","created":"2022-06-08","cited_by_count":13}],"next_cursor":null}