{"list":"other","total":59,"rows":[{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"1611.03530","title":"Understanding deep learning requires rethinking generalization","created":"2016-11-10","cited_by_count":1674},{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"id":"1812.11118","title":"Reconciling modern machine learning practice and the bias-variance trade-off","created":"2018-12-28","cited_by_count":927},{"id":"1804.04235","title":"Adafactor: Adaptive Learning Rates with Sublinear Memory Cost","created":"2018-04-11","cited_by_count":905},{"id":"1710.10345","title":"The Implicit Bias of Gradient Descent on Separable Data","created":"2017-10-27","cited_by_count":655},{"id":"1603.00943","title":"CVXPY: A Python-Embedded Modeling Language for Convex Optimization","created":"2016-03-03","cited_by_count":641},{"id":"1802.04434","title":"signSGD: Compressed Optimisation for Non-Convex Problems","created":"2018-02-13","cited_by_count":571},{"id":"1802.09568","title":"Shampoo: Preconditioned Stochastic Tensor Optimization","created":"2018-02-26","cited_by_count":426},{"id":"1705.09280","title":"Implicit Regularization in Matrix Factorization","created":"2017-05-25","cited_by_count":322},{"id":"1906.05890","title":"Gradient Descent Maximizes the Margin of Homogeneous Neural Networks","created":"2019-06-13","cited_by_count":320},{"id":"1802.08246","title":"Characterizing Implicit Bias in Terms of Optimization Geometry","created":"2018-02-22","cited_by_count":266},{"id":"2409.20325","title":"Old Optimizer, New Norm: An Anthology","created":"2024-09-30","cited_by_count":193},{"id":"2409.11321","title":"SOAP: Improving and Stabilizing Shampoo using Adam","created":"2024-09-17","cited_by_count":192},{"id":"2006.06657","title":"Directional convergence and alignment in deep learning","created":"2020-06-11","cited_by_count":178},{"id":"1602.01407","title":"A Kronecker-factored approximate Fisher matrix for convolution layers","created":"2016-02-03","cited_by_count":141},{"id":"2002.03305","title":"Momentum Improves Normalized SGD","created":"2020-02-09","cited_by_count":139},{"id":"2406.16793","title":"Adam-mini: Use Fewer Learning Rates To Gain More","created":"2024-06-24","cited_by_count":137},{"id":"2402.16788","title":"Why Transformers Need Adam: A Hessian Perspective","created":"2024-02-26","cited_by_count":124},{"id":"2007.07989","title":"An Improved Analysis of Stochastic Gradient Descent with Momentum","created":"2020-07-15","cited_by_count":119},{"id":"1803.01905","title":"Convergence of Gradient Descent on Separable Data","created":"2018-03-05","cited_by_count":110},{"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":"2005.08054","title":"Classification vs regression in overparameterized regimes: Does the loss function matter?","created":"2020-05-16","cited_by_count":97},{"id":"2208.12591","title":"On the Implicit Bias in Deep-Learning Algorithms","created":"2022-08-26","cited_by_count":86},{"id":"2502.02900","title":"A Note on the Convergence of Muon","created":"2025-02-05","cited_by_count":83},{"id":"1911.05822","title":"A Model of Double Descent for High-dimensional Binary Linear Classification","created":"2019-11-13","cited_by_count":81},{"id":"2208.05512","title":"Imbalance Trouble: Revisiting Neural-Collapse Geometry","created":"2022-08-10","cited_by_count":80},{"id":"2309.06497","title":"A Distributed Data-Parallel PyTorch Implementation of the Distributed Shampoo Optimizer for Training Neural Networks At-Scale","created":"2023-09-12","cited_by_count":77},{"id":"1507.02030","title":"Beyond Convexity: Stochastic Quasi-Convex Optimization","created":"2015-07-08","cited_by_count":76},{"id":"1412.7457","title":"Global convergence of the Heavy-ball method for convex optimization","created":"2014-12-23","cited_by_count":61},{"id":"2006.11226","title":"Gradient descent follows the regularization path for general losses","created":"2020-06-19","cited_by_count":59},{"id":"2306.13596","title":"Max-Margin Token Selection in Attention Mechanism","created":"2023-06-23","cited_by_count":58},{"id":"2106.09276","title":"Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds, and Benign Overfitting","created":"2021-06-17","cited_by_count":54},{"id":"2306.07179","title":"Benchmarking Neural Network Training Algorithms","created":"2023-06-12","cited_by_count":52},{"id":"2012.06244","title":"The Implicit Bias for Adaptive Optimization Algorithms on Homogeneous Neural Networks","created":"2020-12-11","cited_by_count":46},{"id":"2106.10865","title":"Benign Overfitting in Multiclass Classification: All Roads Lead to Interpolation","created":"2021-06-21","cited_by_count":42},{"id":"2305.11788","title":"Implicit Bias of Gradient Descent for Logistic Regression at the Edge of Stability","created":"2023-05-19","cited_by_count":42},{"id":"1906.03830","title":"Stochastic Mirror Descent on Overparameterized Nonlinear Models: Convergence, Implicit Regularization, and Generalization","created":"2019-06-10","cited_by_count":40},{"id":"1506.00552","title":"Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection","created":"2015-06-01","cited_by_count":39},{"id":"2406.10650","title":"The Implicit Bias of Adam on Separable Data","created":"2024-06-15","cited_by_count":36},{"id":"1303.4172","title":"Margins, Shrinkage, and Boosting","created":"2013-03-18","cited_by_count":35},{"id":"1906.03761","title":"The Impact of Regularization on High-dimensional Logistic Regression","created":"2019-06-10","cited_by_count":35},{"id":"2402.15926","title":"Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency","created":"2024-02-24","cited_by_count":35},{"id":"2107.00595","title":"Fast Margin Maximization via Dual Acceleration","created":"2021-07-01","cited_by_count":33},{"id":"2402.05738","title":"Implicit Bias and Fast Convergence Rates for Self-attention","created":"2024-02-08","cited_by_count":31},{"id":"2205.12808","title":"Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently","created":"2022-05-25","cited_by_count":26},{"id":"2110.03891","title":"Does Momentum Change the Implicit Regularization on Separable Data?","created":"2021-10-08","cited_by_count":22},{"id":"2203.03597","title":"Fast Rates for Noisy Interpolation Require Rethinking the Effects of Inductive Bias","created":"2022-03-07","cited_by_count":22},{"id":"2302.09235","title":"Generalization and Stability of Interpolating Neural Networks with Minimal Width","created":"2023-02-18","cited_by_count":21},{"id":"2410.22069","title":"Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networks","created":"2024-10-29","cited_by_count":18},{"id":"2306.13853","title":"A Unified Approach to Controlling Implicit Regularization via Mirror Descent","created":"2023-06-24","cited_by_count":14},{"id":"2402.18551","title":"Implicit Optimization Bias of Next-Token Prediction in Linear Models","created":"2024-02-28","cited_by_count":14},{"id":"2411.01350","title":"The Implicit Bias of Gradient Descent on Separable Multiclass Data","created":"2024-11-02","cited_by_count":11},{"id":"2410.14581","title":"Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection","created":"2024-10-18","cited_by_count":9},{"id":"2311.17778","title":"Unified Binary and Multiclass Margin-Based Classification","created":"2023-11-29","cited_by_count":8},{"id":"2311.02270","title":"Regularized Linear Regression for Binary Classification","created":"2023-11-03","cited_by_count":7},{"id":"2112.09727","title":"Rank4Class: A Ranking Formulation for Multiclass Classification","created":"2021-12-17","cited_by_count":2}],"next_cursor":null}