{"list":"other","total":51,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"id":"2302.13971","title":"LLaMA: Open and Efficient Foundation Language Models","created":"2023-02-27","cited_by_count":14132},{"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":"1609.04836","title":"On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima","created":"2016-09-15","cited_by_count":1352},{"id":"1812.11118","title":"Reconciling modern machine learning practice and the bias-variance trade-off","created":"2018-12-28","cited_by_count":927},{"id":"1503.02406","title":"Deep Learning and the Information Bottleneck Principle","created":"2015-03-09","cited_by_count":802},{"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":"1710.10345","title":"The Implicit Bias of Gradient Descent on Separable Data","created":"2017-10-27","cited_by_count":655},{"id":"1610.01145","title":"Error bounds for approximations with deep ReLU networks","created":"2016-10-03","cited_by_count":574},{"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":"1708.06633","title":"Nonparametric regression using deep neural networks with ReLU activation function","created":"2017-08-22","cited_by_count":433},{"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":"1412.8690","title":"Breaking the Curse of Dimensionality with Convex Neural Networks","created":"2014-12-30","cited_by_count":331},{"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":"1712.06541","title":"Size-Independent Sample Complexity of Neural Networks","created":"2017-12-18","cited_by_count":290},{"id":"1806.00468","title":"Implicit Bias of Gradient Descent on Linear Convolutional Networks","created":"2018-06-01","cited_by_count":251},{"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":"2006.06657","title":"Directional convergence and alignment in deep learning","created":"2020-06-11","cited_by_count":178},{"id":"2001.03040","title":"Deep Network Approximation for Smooth Functions","created":"2020-01-09","cited_by_count":164},{"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":"1611.00740","title":"Why and When Can Deep -- but Not Shallow -- Networks Avoid the Curse of Dimensionality: a Review","created":"2016-11-02","cited_by_count":155},{"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":"2105.14368","title":"Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation","created":"2021-05-29","cited_by_count":132},{"id":"1906.05497","title":"Deep Network Approximation Characterized by Number of Neurons","created":"2019-06-13","cited_by_count":122},{"id":"1810.12281","title":"Three Mechanisms of Weight Decay Regularization","created":"2018-10-29","cited_by_count":113},{"id":"2402.16991","title":"A Phase Transition in Diffusion Models Reveals the Hierarchical Nature of Data","created":"2024-02-26","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":"2101.12365","title":"Sharp Bounds on the Approximation Rates, Metric Entropy, and $n$-widths of Shallow Neural Networks","created":"2021-01-29","cited_by_count":86},{"id":"2307.02129","title":"How Deep Neural Networks Learn Compositional Data: The Random Hierarchy Model","created":"2023-07-05","cited_by_count":71},{"id":"2310.19793","title":"On Learning Gaussian Multi-index Models with Gradient Flow","created":"2023-10-30","cited_by_count":57},{"id":"2403.05529","title":"Computational-Statistical Gaps in Gaussian Single-Index Models","created":"2024-03-08","cited_by_count":44},{"id":"2109.08844","title":"Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks","created":"2021-09-18","cited_by_count":41},{"id":"2305.08466","title":"Nearly Optimal VC-Dimension and Pseudo-Dimension Bounds for Deep Neural Network Derivatives","created":"2023-05-15","cited_by_count":30},{"id":"2306.08321","title":"Nonparametric regression using over-parameterized shallow ReLU neural networks","created":"2023-06-14","cited_by_count":24},{"id":"2007.14285","title":"Theory of Deep Convolutional Neural Networks II: Spherical Analysis","created":"2020-07-28","cited_by_count":22},{"id":"2201.09418","title":"Approximation bounds for norm constrained neural networks with applications to regression and GANs","created":"2022-01-24","cited_by_count":22},{"id":"2402.00152","title":"Deeper or Wider: A Perspective from Optimal Generalization Error with Sobolev Loss","created":"2024-01-31","cited_by_count":14},{"id":"2507.02550","title":"Position: A Theory of Deep Learning Must Include Compositional Sparsity","created":"2025-07-03","cited_by_count":14},{"id":"2004.00245","title":"Depth Selection for Deep ReLU Nets in Feature Extraction and Generalization","created":"2020-04-01","cited_by_count":13},{"id":"2602.05846","title":"Optimal scaling laws in learning hierarchical multi-index models","created":"2026-02-05","cited_by_count":9},{"id":"2301.12033","title":"Norm-based Generalization Bounds for Compositionally Sparse Neural Networks","created":"2023-01-28","cited_by_count":7},{"id":"2511.15120","title":"Neural Networks Learn Generic Multi-Index Models Near Information-Theoretic Limit","created":"2025-11-19","cited_by_count":6},{"id":"2601.19756","title":"Provable Learning of Random Hierarchy Models and Hierarchical Shallow-to-Deep Chaining","created":"2026-01-27","cited_by_count":6},{"id":"2205.05500","title":"Analysis of convolutional neural network image classifiers in a rotationally symmetric model","created":"2022-05-11","cited_by_count":4},{"id":"2510.02532","title":"Learning Multi-Index Models with Hyper-Kernel Ridge Regression","created":"2025-10-02","cited_by_count":3},{"id":"2510.11942","title":"On efficiently computable functions, deep networks and sparse compositionality","created":"2025-10-13","cited_by_count":3}],"next_cursor":null}