{"list":"other","total":53,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1912.01703","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","created":"2019-12-03","cited_by_count":20305},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"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":"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":"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":"1706.08947","title":"Exploring Generalization in Deep Learning","created":"2017-06-27","cited_by_count":600},{"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":"1703.11008","title":"Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data","created":"2017-03-31","cited_by_count":533},{"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":"1707.09564","title":"A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks","created":"2017-07-29","cited_by_count":314},{"id":"1703.02930","title":"Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks","created":"2017-03-08","cited_by_count":311},{"id":"1802.05296","title":"Stronger generalization bounds for deep nets via a compression approach","created":"2018-02-14","cited_by_count":307},{"id":"1705.07809","title":"Information-theoretic analysis of generalization capability of learning algorithms","created":"2017-05-22","cited_by_count":303},{"id":"1503.00036","title":"Norm-Based Capacity Control in Neural Networks","created":"2015-02-27","cited_by_count":299},{"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":"2006.04647","title":"Neural Architecture Search without Training","created":"2020-06-08","cited_by_count":244},{"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":"1808.00387","title":"Just Interpolate: Kernel \"Ridgeless\" Regression Can Generalize","created":"2018-08-01","cited_by_count":190},{"id":"2006.06914","title":"Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses","created":"2020-06-12","cited_by_count":173},{"id":"2102.11535","title":"Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspective","created":"2021-02-23","cited_by_count":169},{"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":"1911.02151","title":"Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates","created":"2019-11-06","cited_by_count":119},{"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":"1902.05040","title":"How do infinite width bounded norm networks look in function space?","created":"2019-02-13","cited_by_count":106},{"id":"1710.08402","title":"Stability and Generalization of Learning Algorithms that Converge to Global Optima","created":"2017-10-23","cited_by_count":100},{"id":"2210.15651","title":"Learning Single-Index Models with Shallow Neural Networks","created":"2022-10-27","cited_by_count":92},{"id":"2012.11654","title":"Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks","created":"2020-12-21","cited_by_count":87},{"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":"2102.00931","title":"Information-Theoretic Generalization Bounds for Stochastic Gradient Descent","created":"2021-02-01","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":"1801.04295","title":"Generalization Error Bounds for Noisy, Iterative Algorithms","created":"2018-01-12","cited_by_count":82},{"id":"2305.10633","title":"Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models","created":"2023-05-18","cited_by_count":61},{"id":"1902.00621","title":"On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning","created":"2019-02-02","cited_by_count":57},{"id":"2202.07626","title":"Random Feature Amplification: Feature Learning and Generalization in Neural Networks","created":"2022-02-15","cited_by_count":35},{"id":"2502.21269","title":"Dynamical Decoupling of Generalization and Overfitting in Large Two-Layer Networks","created":"2025-02-28","cited_by_count":25},{"id":"2109.09304","title":"Deformed semicircle law and concentration of nonlinear random matrices for ultra-wide neural networks","created":"2021-09-20","cited_by_count":21},{"id":"2204.12446","title":"Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GD","created":"2022-04-26","cited_by_count":19},{"id":"2203.14577","title":"Demystifying the Neural Tangent Kernel from a Practical Perspective: Can it be trusted for Neural Architecture Search without training?","created":"2022-03-28","cited_by_count":18},{"id":"2007.11045","title":"On the Rademacher Complexity of Linear Hypothesis Sets","created":"2020-07-21","cited_by_count":17},{"id":"2102.02976","title":"Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channels","created":"2021-02-05","cited_by_count":15},{"id":"2104.14132","title":"Generalization Guarantees for Neural Architecture Search with Train-Validation Split","created":"2021-04-29","cited_by_count":14},{"id":"2404.03176","title":"Information-Theoretic Generalization Bounds for Deep Neural Networks","created":"2024-04-04","cited_by_count":10},{"id":"2202.13328","title":"Thinking Outside the Ball: Optimal Learning with Gradient Descent for Generalized Linear Stochastic Convex Optimization","created":"2022-02-27","cited_by_count":7}],"next_cursor":null}