{"list":"other","total":64,"rows":[{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"1606.08415","title":"Gaussian Error Linear Units (GELUs)","created":"2016-06-27","cited_by_count":3502},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1712.09913","title":"Visualizing the Loss Landscape of Neural Nets","created":"2017-12-28","cited_by_count":1130},{"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":"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":"1804.06561","title":"A Mean Field View of the Landscape of Two-Layers Neural Networks","created":"2018-04-18","cited_by_count":466},{"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":"1706.07979","title":"Methods for Interpreting and Understanding Deep Neural Networks","created":"2017-06-24","cited_by_count":345},{"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":"1503.00036","title":"Norm-Based Capacity Control in Neural Networks","created":"2015-02-27","cited_by_count":299},{"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":"1806.00468","title":"Implicit Bias of Gradient Descent on Linear Convolutional Networks","created":"2018-06-01","cited_by_count":251},{"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":"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":"2302.11055","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","created":"2023-02-21","cited_by_count":143},{"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":"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":"2010.05627","title":"Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learning","created":"2020-10-12","cited_by_count":126},{"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":"1706.03175","title":"Recovery Guarantees for One-hidden-layer Neural Networks","created":"2017-06-10","cited_by_count":94},{"id":"2210.15651","title":"Learning Single-Index Models with Shallow Neural Networks","created":"2022-10-27","cited_by_count":92},{"id":"1702.05419","title":"A Random Matrix Approach to Neural Networks","created":"2017-02-17","cited_by_count":80},{"id":"2002.07400","title":"Learning Parities with Neural Networks","created":"2020-02-18","cited_by_count":78},{"id":"2209.14863","title":"Neural Networks Efficiently Learn Low-Dimensional Representations with SGD","created":"2022-09-29","cited_by_count":63},{"id":"2108.10573","title":"The staircase property: How hierarchical structure can guide deep learning","created":"2021-08-24","cited_by_count":62},{"id":"2303.00055","title":"Learning time-scales in two-layers neural networks","created":"2023-02-28","cited_by_count":57},{"id":"2310.19793","title":"On Learning Gaussian Multi-index Models with Gradient Flow","created":"2023-10-30","cited_by_count":57},{"id":"1705.04591","title":"Learning ReLUs via Gradient Descent","created":"2017-05-10","cited_by_count":54},{"id":"2001.05205","title":"Learning a Single Neuron with Gradient Methods","created":"2020-01-15","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":"2102.02410","title":"A Local Convergence Theory for Mildly Over-Parameterized Two-Layer Neural Network","created":"2021-02-04","cited_by_count":47},{"id":"2005.14426","title":"Agnostic Learning of a Single Neuron with Gradient Descent","created":"2020-05-29","cited_by_count":46},{"id":"2406.01581","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit","created":"2024-06-03","cited_by_count":46},{"id":"2403.05529","title":"Computational-Statistical Gaps in Gaussian Single-Index Models","created":"2024-03-08","cited_by_count":44},{"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":"2309.15111","title":"SGD Finds then Tunes Features in Two-Layer Neural Networks with near-Optimal Sample Complexity: A Case Study in the XOR problem","created":"2023-09-26","cited_by_count":39},{"id":"1906.07772","title":"First-order methods almost always avoid saddle points: the case of vanishing step-sizes","created":"2019-06-18","cited_by_count":35},{"id":"2004.13748","title":"Learning Polynomials of Few Relevant Dimensions","created":"2020-04-28","cited_by_count":34},{"id":"2302.10034","title":"Over-Parameterization Exponentially Slows Down Gradient Descent for Learning a Single Neuron","created":"2023-02-20","cited_by_count":25},{"id":"2311.03794","title":"On the Impact of Overparameterization on the Training of a Shallow Neural Network in High Dimensions","created":"2023-11-07","cited_by_count":21},{"id":"2306.16361","title":"Beyond NTK with Vanilla Gradient Descent: A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Time","created":"2023-06-28","cited_by_count":20},{"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":"2202.08064","title":"Learning a Single Neuron for Non-monotonic Activation Functions","created":"2022-02-16","cited_by_count":13},{"id":"2406.11828","title":"Learning sum of diverse features: computational hardness and efficient gradient-based training for ridge combinations","created":"2024-06-17","cited_by_count":13},{"id":"1803.09357","title":"On the Local Minima of the Empirical Risk","created":"2018-03-25","cited_by_count":12},{"id":"1912.01599","title":"Stationary Points of Shallow Neural Networks with Quadratic Activation Function","created":"2019-12-03","cited_by_count":12},{"id":"2506.05500","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","created":"2025-06-05","cited_by_count":9},{"id":"2004.06898","title":"Learning sums of powers of low-degree polynomials in the non-degenerate case","created":"2020-04-15","cited_by_count":6},{"id":"2406.01766","title":"How Does Gradient Descent Learn Features -- A Local Analysis for Regularized Two-Layer Neural Networks","created":"2024-06-03","cited_by_count":4},{"id":"2411.05708","title":"Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models","created":"2024-11-08","cited_by_count":4},{"id":"2503.23642","title":"Learning a Single Index Model from Anisotropic Data with vanilla Stochastic Gradient Descent","created":"2025-03-31","cited_by_count":4},{"id":"2412.07242","title":"Optimization Can Learn Johnson Lindenstrauss Embeddings","created":"2024-12-10","cited_by_count":1}],"next_cursor":null}