{"total":33,"rows":[{"id":"2208.12591","title":"On the Implicit Bias in Deep-Learning Algorithms","created":"2022-08-26","cited_by_count":86,"area":null},{"id":"2308.16898","title":"Transformers as Support Vector Machines","created":"2023-08-31","cited_by_count":74,"area":null},{"id":"2306.13596","title":"Max-Margin Token Selection in Attention Mechanism","created":"2023-06-23","cited_by_count":58,"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":"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":"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,"area":null},{"id":"2402.05738","title":"Implicit Bias and Fast Convergence Rates for Self-attention","created":"2024-02-08","cited_by_count":31,"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":"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":"2205.12808","title":"Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently","created":"2022-05-25","cited_by_count":26,"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":"2403.08699","title":"Implicit Regularization of Gradient Flow on One-Layer Softmax Attention","created":"2024-03-13","cited_by_count":19,"area":null},{"id":"2406.08654","title":"Large Stepsize Gradient Descent for Non-Homogeneous Two-Layer Networks: Margin Improvement and Fast Optimization","created":"2024-06-12","cited_by_count":17,"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":"2403.06925","title":"Transformers Learn Low Sensitivity Functions: Investigations and Implications","created":"2024-03-11","cited_by_count":14,"area":null},{"id":"2405.20763","title":"Improving Generalization and Convergence by Enhancing Implicit Regularization","created":"2024-05-31","cited_by_count":14,"area":null},{"id":"2409.17335","title":"Non-asymptotic Convergence of Training Transformers for Next-token Prediction","created":"2024-09-25","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":"2411.01350","title":"The Implicit Bias of Gradient Descent on Separable Multiclass Data","created":"2024-11-02","cited_by_count":11,"area":null},{"id":"2505.00926","title":"How Transformers Learn Regular Language Recognition: A Theoretical Study on Training Dynamics and Implicit Bias","created":"2025-05-02","cited_by_count":11,"area":null},{"id":"2410.14581","title":"Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection","created":"2024-10-18","cited_by_count":9,"area":null},{"id":"2209.07116","title":"On Generalization of Decentralized Learning with Separable Data","created":"2022-09-15","cited_by_count":8,"area":null},{"id":"2504.04105","title":"Minimax Optimal Convergence of Gradient Descent in Logistic Regression via Large and Adaptive Stepsizes","created":"2025-04-05","cited_by_count":7,"area":null},{"id":"2210.09371","title":"On Accelerated Perceptrons and Beyond","created":"2022-10-17","cited_by_count":6,"area":null},{"id":"2311.14387","title":"Achieving Margin Maximization Exponentially Fast via Progressive Norm Rescaling","created":"2023-11-24","cited_by_count":4,"area":null},{"id":"2412.06990","title":"The Oracle Complexity of Simplex-based Matrix Games","created":"2024-12-09","cited_by_count":4,"area":null},{"id":"2506.13974","title":"Constant Stepsize Local GD for Logistic Regression: Acceleration by Instability","created":"2025-06-16","cited_by_count":2,"area":null},{"id":"2204.14118","title":"On the Optimization of Margin Distribution","created":"2022-04-29","cited_by_count":0,"area":null},{"id":"2212.12675","title":"Iterative regularization in classification via hinge loss diagonal descent","created":"2022-12-24","cited_by_count":0,"area":null},{"id":"2305.17544","title":"Faster Margin Maximization Rates for Generic and Adversarially Robust Optimization Methods","created":"2023-05-27","cited_by_count":0,"area":null},{"id":"2603.02095","title":"On the Rate of Convergence of GD in Non-linear Neural Networks: An Adversarial Robustness Perspective","created":"2026-03-02","cited_by_count":0,"area":null}],"next_cursor":null}