{"total":253,"rows":[{"id":"2105.02375","title":"A Geometric Analysis of Neural Collapse with Unconstrained Features","created":"2021-05-06","cited_by_count":227,"area":null},{"id":"2206.07758","title":"Reconstructing Training Data from Trained Neural Networks","created":"2022-06-15","cited_by_count":133,"area":null},{"id":"2106.06530","title":"Label Noise SGD Provably Prefers Flat Global Minimizers","created":"2021-06-11","cited_by_count":121,"area":null},{"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,"area":null},{"id":"2110.06914","title":"What Happens after SGD Reaches Zero Loss? --A Mathematical Framework","created":"2021-10-13","cited_by_count":107,"area":null},{"id":"2208.12591","title":"On the Implicit Bias in Deep-Learning Algorithms","created":"2022-08-26","cited_by_count":86,"area":null},{"id":"2106.15933","title":"Saddle-to-Saddle Dynamics in Deep Linear Networks: Small Initialization Training, Symmetry, and Sparsity","created":"2021-06-30","cited_by_count":85,"area":null},{"id":"2110.13905","title":"Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Bias","created":"2021-10-26","cited_by_count":83,"area":null},{"id":"2205.09588","title":"How catastrophic can catastrophic forgetting be in linear regression?","created":"2022-05-19","cited_by_count":81,"area":null},{"id":"2208.05512","title":"Imbalance Trouble: Revisiting Neural-Collapse Geometry","created":"2022-08-10","cited_by_count":80,"area":null},{"id":"2311.18817","title":"Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking","created":"2023-11-30","cited_by_count":80,"area":null},{"id":"2308.16898","title":"Transformers as Support Vector Machines","created":"2023-08-31","cited_by_count":74,"area":null},{"id":"2301.13105","title":"Generalization on the Unseen, Logic Reasoning and Degree Curriculum","created":"2023-01-30","cited_by_count":73,"area":null},{"id":"2302.05836","title":"Theory on Forgetting and Generalization of Continual Learning","created":"2023-02-12","cited_by_count":72,"area":null},{"id":"2102.09769","title":"On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descent","created":"2021-02-19","cited_by_count":70,"area":null},{"id":"2102.08817","title":"Dissecting Supervised Contrastive Learning","created":"2021-02-17","cited_by_count":64,"area":null},{"id":"2306.13596","title":"Max-Margin Token Selection in Attention Mechanism","created":"2023-06-23","cited_by_count":58,"area":null},{"id":"2404.04454","title":"Implicit Bias of AdamW: $\\ell_\\infty$ Norm Constrained Optimization","created":"2024-04-05","cited_by_count":58,"area":null},{"id":"2201.12760","title":"Implicit Regularization Towards Rank Minimization in ReLU Networks","created":"2022-01-30","cited_by_count":53,"area":null},{"id":"2104.13628","title":"Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixtures","created":"2021-04-28","cited_by_count":49,"area":null},{"id":"2106.06770","title":"What can linearized neural networks actually say about generalization?","created":"2021-06-12","cited_by_count":49,"area":null},{"id":"2303.01372","title":"High-dimensional analysis of double descent for linear regression with random projections","created":"2023-03-02","cited_by_count":47,"area":null},{"id":"2307.00144","title":"Abide by the Law and Follow the Flow: Conservation Laws for Gradient Flows","created":"2023-06-30","cited_by_count":45,"area":null},{"id":"2102.09972","title":"Implicit Regularization in Tensor Factorization","created":"2021-02-19","cited_by_count":44,"area":null},{"id":"2301.11500","title":"Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing","created":"2023-01-27","cited_by_count":42,"area":null},{"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,"area":null},{"id":"2406.06158","title":"Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learning","created":"2024-06-10","cited_by_count":42,"area":null},{"id":"2502.04664","title":"Implicit Bias of Spectral Descent and Muon on Multiclass Separable Data","created":"2025-02-07","cited_by_count":41,"area":null},{"id":"2207.04036","title":"Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descent","created":"2022-07-08","cited_by_count":39,"area":null},{"id":"2209.13083","title":"Why neural networks find simple solutions: the many regularizers of geometric complexity","created":"2022-09-27","cited_by_count":39,"area":null},{"id":"2102.01117","title":"SGD Generalizes Better Than GD (And Regularization Doesn't Help)","created":"2021-02-01","cited_by_count":38,"area":null},{"id":"2209.15055","title":"Implicit Bias of Large Depth Networks: a Notion of Rank for Nonlinear Functions","created":"2022-09-29","cited_by_count":38,"area":null},{"id":"2110.02424","title":"Spectral Bias in Practice: The Role of Function Frequency in Generalization","created":"2021-10-06","cited_by_count":37,"area":null},{"id":"2302.08982","title":"(S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stability","created":"2023-02-17","cited_by_count":36,"area":null},{"id":"2406.10650","title":"The Implicit Bias of Adam on Separable Data","created":"2024-06-15","cited_by_count":36,"area":null},{"id":"2407.12332","title":"Why Do You Grok? A Theoretical Analysis of Grokking Modular Addition","created":"2024-07-17","cited_by_count":36,"area":null},{"id":"2110.02732","title":"On Margin Maximization in Linear and ReLU Networks","created":"2021-10-06","cited_by_count":34,"area":null},{"id":"2403.08081","title":"Mechanics of Next Token Prediction with Self-Attention","created":"2024-03-12","cited_by_count":34,"area":null},{"id":"2107.00595","title":"Fast Margin Maximization via Dual Acceleration","created":"2021-07-01","cited_by_count":33,"area":null},{"id":"2108.04552","title":"The Benefits of Implicit Regularization from SGD in Least Squares Problems","created":"2021-08-10","cited_by_count":32,"area":null},{"id":"2108.05574","title":"Implicit Sparse Regularization: The Impact of Depth and Early Stopping","created":"2021-08-12","cited_by_count":30,"area":null},{"id":"2212.14032","title":"On Implicit Bias in Overparameterized Bilevel Optimization","created":"2022-12-28","cited_by_count":30,"area":null},{"id":"2309.07418","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","created":"2023-09-14","cited_by_count":30,"area":null},{"id":"2201.12293","title":"Understanding Why Generalized Reweighting Does Not Improve Over ERM","created":"2022-01-28","cited_by_count":29,"area":null},{"id":"2206.09841","title":"Label noise (stochastic) gradient descent implicitly solves the Lasso for quadratic parametrisation","created":"2022-06-20","cited_by_count":29,"area":null},{"id":"2211.05641","title":"Regression as Classification: Influence of Task Formulation on Neural Network Features","created":"2022-11-10","cited_by_count":29,"area":null},{"id":"2303.01462","title":"Benign Overfitting in Linear Classifiers and Leaky ReLU Networks from KKT Conditions for Margin Maximization","created":"2023-03-02","cited_by_count":29,"area":null},{"id":"2305.16038","title":"Implicit bias of SGD in $L_{2}$-regularized linear DNNs: One-way jumps from high to low rank","created":"2023-05-25","cited_by_count":29,"area":null},{"id":"2309.00079","title":"On the Implicit Bias of Adam","created":"2023-08-31","cited_by_count":27,"area":null},{"id":"2205.12808","title":"Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently","created":"2022-05-25","cited_by_count":26,"area":null},{"id":"2206.04613","title":"Explicit Regularization in Overparametrized Models via Noise Injection","created":"2022-06-09","cited_by_count":26,"area":null},{"id":"2408.15417","title":"Implicit Geometry of Next-token Prediction: From Language Sparsity Patterns to Model Representations","created":"2024-08-27","cited_by_count":24,"area":null},{"id":"2206.07252","title":"Implicit Regularization or Implicit Conditioning? Exact Risk Trajectories of SGD in High Dimensions","created":"2022-06-15","cited_by_count":23,"area":null},{"id":"2107.05074","title":"SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs","created":"2021-07-11","cited_by_count":22,"area":null},{"id":"2110.03891","title":"Does Momentum Change the Implicit Regularization on Separable Data?","created":"2021-10-08","cited_by_count":22,"area":null},{"id":"2106.06573","title":"Understanding Deflation Process in Over-parametrized Tensor Decomposition","created":"2021-06-11","cited_by_count":20,"area":null},{"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,"area":null},{"id":"2308.13431","title":"Six Lectures on Linearized Neural Networks","created":"2023-08-25","cited_by_count":20,"area":null},{"id":"2401.07187","title":"A Survey on Statistical Theory of Deep Learning: Approximation, Training Dynamics, and Generative Models","created":"2024-01-14","cited_by_count":20,"area":null},{"id":"2405.16391","title":"When does compositional structure yield compositional generalization? A kernel theory","created":"2024-05-26","cited_by_count":20,"area":null},{"id":"2110.06084","title":"Implicit Bias of Linear Equivariant Networks","created":"2021-10-12","cited_by_count":19,"area":null},{"id":"2403.08699","title":"Implicit Regularization of Gradient Flow on One-Layer Softmax Attention","created":"2024-03-13","cited_by_count":19,"area":null},{"id":"2102.12238","title":"Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm","created":"2021-02-24","cited_by_count":18,"area":null},{"id":"2108.11489","title":"The Interplay Between Implicit Bias and Benign Overfitting in Two-Layer Linear Networks","created":"2021-08-25","cited_by_count":18,"area":null},{"id":"2410.22069","title":"Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networks","created":"2024-10-29","cited_by_count":18,"area":null},{"id":"2107.01641","title":"A Theoretical Analysis of Fine-tuning with Linear Teachers","created":"2021-07-04","cited_by_count":17,"area":null},{"id":"2202.06915","title":"Stochastic linear optimization never overfits with quadratically-bounded losses on general data","created":"2022-02-14","cited_by_count":17,"area":null},{"id":"2205.13647","title":"Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measures","created":"2022-05-26","cited_by_count":17,"area":null},{"id":"2205.15809","title":"Feature Learning in $L_{2}$-regularized DNNs: Attraction/Repulsion and Sparsity","created":"2022-05-31","cited_by_count":17,"area":null},{"id":"2305.19008","title":"Bottleneck Structure in Learned Features: Low-Dimension vs Regularity Tradeoff","created":"2023-05-30","cited_by_count":17,"area":null},{"id":"2110.08084","title":"Gradient Descent on Infinitely Wide Neural Networks: Global Convergence and Generalization","created":"2021-10-15","cited_by_count":16,"area":null},{"id":"2306.17499","title":"The Implicit Bias of Minima Stability in Multivariate Shallow ReLU Networks","created":"2023-06-30","cited_by_count":15,"area":null},{"id":"2201.09457","title":"Homotopic Policy Mirror Descent: Policy Convergence, Implicit Regularization, and Improved Sample Complexity","created":"2022-01-24","cited_by_count":14,"area":null},{"id":"2202.09889","title":"Memorize to Generalize: on the Necessity of Interpolation in High Dimensional Linear Regression","created":"2022-02-20","cited_by_count":14,"area":null},{"id":"2306.13853","title":"A Unified Approach to Controlling Implicit Regularization via Mirror Descent","created":"2023-06-24","cited_by_count":14,"area":null},{"id":"2402.18551","title":"Implicit Optimization Bias of Next-Token Prediction in Linear Models","created":"2024-02-28","cited_by_count":14,"area":null},{"id":"2406.03682","title":"A Universal Class of Sharpness-Aware Minimization Algorithms","created":"2024-06-06","cited_by_count":14,"area":null},{"id":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2505.20172","title":"A Theoretical Framework for Grokking: Interpolation followed by Riemannian Norm Minimisation","created":"2025-05-26","cited_by_count":13,"area":null},{"id":"2505.24022","title":"The Rich and the Simple: On the Implicit Bias of Adam and SGD","created":"2025-05-29","cited_by_count":13,"area":null},{"id":"2202.09028","title":"On the Implicit Bias Towards Minimal Depth of Deep Neural Networks","created":"2022-02-18","cited_by_count":12,"area":null},{"id":"2305.05448","title":"Robust Implicit Regularization via Weight Normalization","created":"2023-05-09","cited_by_count":12,"area":null},{"id":"2504.12883","title":"Mirror, Mirror of the Flow: How Does Regularization Shape Implicit Bias?","created":"2025-04-17","cited_by_count":12,"area":null},{"id":"2105.13831","title":"Implicit Regularization in Matrix Sensing via Mirror Descent","created":"2021-05-28","cited_by_count":11,"area":null},{"id":"2110.06488","title":"The Convex Geometry of Backpropagation: Neural Network Gradient Flows Converge to Extreme Points of the Dual Convex Program","created":"2021-10-13","cited_by_count":11,"area":null},{"id":"2112.15250","title":"Benign Overfitting in Adversarially Robust Linear Classification","created":"2021-12-31","cited_by_count":11,"area":null},{"id":"2205.01385","title":"Smooth over-parameterized solvers for non-smooth structured optimization","created":"2022-05-03","cited_by_count":11,"area":null},{"id":"2206.13482","title":"Understanding Benign Overfitting in Gradient-Based Meta Learning","created":"2022-06-27","cited_by_count":11,"area":null},{"id":"2404.06106","title":"Unifying Low Dimensional Spectra in Deep Learning","created":"2024-04-09","cited_by_count":11,"area":null},{"id":"2408.16939","title":"Theoretical Insights into Overparameterized Models in Multi-Task and Replay-Based Continual Learning","created":"2024-08-29","cited_by_count":11,"area":null},{"id":"2411.01350","title":"The Implicit Bias of Gradient Descent on Separable Multiclass Data","created":"2024-11-02","cited_by_count":11,"area":null},{"id":"2602.16340","title":"The Implicit Bias of Adam and Muon on Smooth Homogeneous Neural Networks","created":"2026-02-18","cited_by_count":11,"area":null},{"id":"2302.09693","title":"mSAM: Micro-Batch-Averaged Sharpness-Aware Minimization","created":"2023-02-19","cited_by_count":10,"area":null},{"id":"2306.11250","title":"InRank: Incremental Low-Rank Learning","created":"2023-06-20","cited_by_count":10,"area":null},{"id":"2403.06873","title":"Last Iterate Convergence of Incremental Methods and Applications in Continual Learning","created":"2024-03-11","cited_by_count":10,"area":null},{"id":"2404.06114","title":"Communication-Efficient Large-Scale Distributed Deep Learning: A Comprehensive Survey","created":"2024-04-09","cited_by_count":10,"area":null},{"id":"2506.00205","title":"Unlocking the Power of Rehearsal in Continual Learning: A Theoretical Perspective","created":"2025-05-30","cited_by_count":10,"area":null},{"id":"2106.03485","title":"Redundant representations help generalization in wide neural networks","created":"2021-06-07","cited_by_count":9,"area":null},{"id":"2108.03947","title":"On the Hyperparameters in Stochastic Gradient Descent with Momentum","created":"2021-08-09","cited_by_count":9,"area":null},{"id":"2210.06088","title":"Annihilation of Spurious Minima in Two-Layer ReLU Networks","created":"2022-10-12","cited_by_count":9,"area":null}],"next_cursor":"100"}