{"list":"other","total":66,"rows":[{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"1409.1556","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","created":"2014-09-04","cited_by_count":15364},{"id":"1706.02677","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","created":"2017-06-08","cited_by_count":1492},{"id":"1706.08498","title":"Spectrally-normalized margin bounds for neural networks","created":"2017-06-26","cited_by_count":686},{"id":"1710.10345","title":"The Implicit Bias of Gradient Descent on Separable Data","created":"2017-10-27","cited_by_count":655},{"id":"1509.01240","title":"Train faster, generalize better: Stability of stochastic gradient descent","created":"2015-09-03","cited_by_count":552},{"id":"1906.11300","title":"Benign Overfitting in Linear Regression","created":"2019-06-26","cited_by_count":549},{"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":"1906.05890","title":"Gradient Descent Maximizes the Margin of Homogeneous Neural Networks","created":"2019-06-13","cited_by_count":320},{"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":"1802.06509","title":"On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization","created":"2018-02-19","cited_by_count":284},{"id":"1705.08741","title":"Train longer, generalize better: closing the generalization gap in large batch training of neural networks","created":"2017-05-24","cited_by_count":279},{"id":"1902.04742","title":"Uniform convergence may be unable to explain generalization in deep learning","created":"2019-02-13","cited_by_count":224},{"id":"1908.09970","title":"Private Stochastic Convex Optimization with Optimal Rates","created":"2019-08-27","cited_by_count":186},{"id":"2006.06657","title":"Directional convergence and alignment in deep learning","created":"2020-06-11","cited_by_count":178},{"id":"1806.00900","title":"Algorithmic Regularization in Learning Deep Homogeneous Models: Layers are Automatically Balanced","created":"2018-06-04","cited_by_count":177},{"id":"2006.06914","title":"Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses","created":"2020-06-12","cited_by_count":173},{"id":"2012.09839","title":"Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank Learning","created":"2020-12-17","cited_by_count":150},{"id":"1810.05369","title":"Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernel","created":"2018-10-12","cited_by_count":131},{"id":"1911.02151","title":"Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates","created":"2019-11-06","cited_by_count":119},{"id":"2006.08157","title":"Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descent","created":"2020-06-15","cited_by_count":119},{"id":"1710.08402","title":"Stability and Generalization of Learning Algorithms that Converge to Global Optima","created":"2017-10-23","cited_by_count":100},{"id":"1902.10710","title":"High probability generalization bounds for uniformly stable algorithms with nearly optimal rate","created":"2019-02-27","cited_by_count":98},{"id":"1910.07833","title":"Sharper bounds for uniformly stable algorithms","created":"2019-10-17","cited_by_count":93},{"id":"1703.01678","title":"Data-Dependent Stability of Stochastic Gradient Descent","created":"2017-03-05","cited_by_count":92},{"id":"2004.12983","title":"Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms","created":"2020-04-27","cited_by_count":89},{"id":"2103.01516","title":"Private Stochastic Convex Optimization: Optimal Rates in $\\ell_1$ Geometry","created":"2021-03-02","cited_by_count":83},{"id":"2110.13905","title":"Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Bias","created":"2021-10-26","cited_by_count":83},{"id":"1707.05947","title":"Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints","created":"2017-07-19","cited_by_count":82},{"id":"2211.13609","title":"PAC-Bayes Compression Bounds So Tight That They Can Explain Generalization","created":"2022-11-24","cited_by_count":76},{"id":"2103.12692","title":"Benign Overfitting of Constant-Stepsize SGD for Linear Regression","created":"2021-03-23","cited_by_count":71},{"id":"1805.10074","title":"Statistical Optimality of Stochastic Gradient Descent on Hard Learning Problems through Multiple Passes","created":"2018-05-25","cited_by_count":69},{"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":"1910.04284","title":"Improved Sample Complexities for Deep Networks and Robust Classification via an All-Layer Margin","created":"2019-10-09","cited_by_count":56},{"id":"1308.6370","title":"Fast Convergence of Stochastic Gradient Descent under a Strong Growth Condition","created":"2013-08-29","cited_by_count":54},{"id":"1905.07325","title":"Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Models","created":"2019-05-17","cited_by_count":53},{"id":"2006.06560","title":"Generalization error in high-dimensional perceptrons: Approaching Bayes error with convex optimization","created":"2020-06-11","cited_by_count":51},{"id":"2107.05585","title":"Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings","created":"2021-07-12","cited_by_count":45},{"id":"2006.07279","title":"PAC-Bayes unleashed: generalisation bounds with unbounded losses","created":"2020-06-12","cited_by_count":43},{"id":"1608.04414","title":"Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back","created":"2016-08-15","cited_by_count":37},{"id":"2104.05641","title":"Generalization bounds via distillation","created":"2021-04-12","cited_by_count":34},{"id":"2110.02732","title":"On Margin Maximization in Linear and ReLU Networks","created":"2021-10-06","cited_by_count":34},{"id":"2102.05274","title":"Stability of SGD: Tightness Analysis and Improved Bounds","created":"2021-02-10","cited_by_count":33},{"id":"2111.12876","title":"Time-independent Generalization Bounds for SGLD in Non-convex Settings","created":"2021-11-25","cited_by_count":27},{"id":"2202.04985","title":"Generalization Bounds via Convex Analysis","created":"2022-02-10","cited_by_count":27},{"id":"2203.10036","title":"On the Generalization Mystery in Deep Learning","created":"2022-03-18","cited_by_count":25},{"id":"2206.07082","title":"Stability and Generalization of Stochastic Optimization with Nonconvex and Nonsmooth Problems","created":"2022-06-14","cited_by_count":25},{"id":"2210.03820","title":"The Asymmetric Maximum Margin Bias of Quasi-Homogeneous Neural Networks","created":"2022-10-07","cited_by_count":25},{"id":"2107.05074","title":"SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs","created":"2021-07-11","cited_by_count":22},{"id":"2202.13361","title":"Benign Underfitting of Stochastic Gradient Descent","created":"2022-02-27","cited_by_count":19},{"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":"2212.13556","title":"Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization","created":"2022-12-27","cited_by_count":19},{"id":"2205.03014","title":"Differentially Private Generalized Linear Models Revisited","created":"2022-05-06","cited_by_count":17},{"id":"2206.14800","title":"Understanding Generalization via Leave-One-Out Conditional Mutual Information","created":"2022-06-29","cited_by_count":16},{"id":"2107.00469","title":"Never Go Full Batch (in Stochastic Convex Optimization)","created":"2021-06-29","cited_by_count":14},{"id":"2209.08005","title":"Stability and Generalization for Markov Chain Stochastic Gradient Methods","created":"2022-09-16","cited_by_count":14},{"id":"1712.04755","title":"Exponential convergence of testing error for stochastic gradient methods","created":"2017-12-13","cited_by_count":13},{"id":"2206.01836","title":"Dimension Independent Generalization of DP-SGD for Overparameterized Smooth Convex Optimization","created":"2022-06-03","cited_by_count":9},{"id":"2205.14278","title":"Generalization Bounds of Nonconvex-(Strongly)-Concave Stochastic Minimax Optimization","created":"2022-05-28","cited_by_count":7},{"id":"2206.07892","title":"Max-Margin Works while Large Margin Fails: Generalization without Uniform Convergence","created":"2022-06-16","cited_by_count":6},{"id":"2106.06153","title":"Towards Understanding Generalization via Decomposing Excess Risk Dynamics","created":"2021-06-11","cited_by_count":5},{"id":"2206.00501","title":"Benign Overfitting in Classification: Provably Counter Label Noise with Larger Models","created":"2022-06-01","cited_by_count":5},{"id":"2409.07401","title":"Convergence of continuous-time stochastic gradient descent with applications to deep neural networks","created":"2024-09-11","cited_by_count":4},{"id":"2307.03357","title":"Stability and Generalization of Stochastic Compositional Gradient Descent Algorithms","created":"2023-07-07","cited_by_count":3},{"id":"2410.09766","title":"Stability and Sharper Risk Bounds with Convergence Rate $\\tilde{O}(1/n^2)$","created":"2024-10-13","cited_by_count":2}],"next_cursor":null}