{"total":35,"rows":[{"id":"2306.13596","title":"Max-Margin Token Selection in Attention Mechanism","created":"2023-06-23","cited_by_count":58,"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":"2310.12680","title":"On the Optimization and Generalization of Multi-head Attention","created":"2023-10-19","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":"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":"2107.00595","title":"Fast Margin Maximization via Dual Acceleration","created":"2021-07-01","cited_by_count":33,"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":"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":"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":"2203.02006","title":"Why adversarial training can hurt robust accuracy","created":"2022-03-03","cited_by_count":14,"area":null},{"id":"2208.02789","title":"Feature selection with gradient descent on two-layer networks in low-rotation regimes","created":"2022-08-04","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":"2110.11280","title":"Actor-critic is implicitly biased towards high entropy optimal policies","created":"2021-10-21","cited_by_count":13,"area":null},{"id":"2401.12236","title":"The Surprising Harmfulness of Benign Overfitting for Adversarial Robustness","created":"2024-01-19","cited_by_count":9,"area":null},{"id":"2502.13283","title":"Benefits of Early Stopping in Gradient Descent for Overparameterized Logistic Regression","created":"2025-02-18","cited_by_count":9,"area":null},{"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,"area":null},{"id":"2306.14381","title":"Gradient Descent Converges Linearly for Logistic Regression on Separable Data","created":"2023-06-26","cited_by_count":7,"area":null},{"id":"2403.17592","title":"On the Benefits of Over-parameterization for Out-of-Distribution Generalization","created":"2024-03-26","cited_by_count":7,"area":null},{"id":"2108.06808","title":"Implicit Regularization of Bregman Proximal Point Algorithm and Mirror Descent on Separable Data","created":"2021-08-15","cited_by_count":6,"area":null},{"id":"2102.08868","title":"Bridging the Gap Between Adversarial Robustness and Optimization Bias","created":"2021-02-17","cited_by_count":5,"area":null},{"id":"2406.04981","title":"The Price of Implicit Bias in Adversarially Robust Generalization","created":"2024-06-07","cited_by_count":5,"area":null},{"id":"2110.05852","title":"On the Self-Penalization Phenomenon in Feature Selection","created":"2021-10-12","cited_by_count":4,"area":null},{"id":"2305.13471","title":"Fast Convergence in Learning Two-Layer Neural Networks with Separable Data","created":"2023-05-22","cited_by_count":3,"area":null},{"id":"2105.02083","title":"AdaBoost and robust one-bit compressed sensing","created":"2021-05-05","cited_by_count":2,"area":null},{"id":"2112.04590","title":"The perils of being unhinged: On the accuracy of classifiers minimizing a noise-robust convex loss","created":"2021-12-08","cited_by_count":2,"area":null},{"id":"2512.24999","title":"Basic Inequalities for First-Order Optimization with Applications to Statistical Risk Analysis","created":"2025-12-31","cited_by_count":2,"area":null},{"id":"2607.06013","title":"Stability Annealing Selects the Implicit Bias of Smoothed Sign Descent: A Rate-Indexed Barrier Path on Separable Data","created":"2026-07-07","cited_by_count":2,"area":null},{"id":"2212.02457","title":"Blessings and Curses of Covariate Shifts: Adversarial Learning Dynamics, Directional Convergence, and Equilibria","created":"2022-12-05","cited_by_count":1,"area":null},{"id":"2605.06314","title":"When Does $\\ell_2$-Boosting Overfit Benignly? High-Dimensional Risk Asymptotics and the $\\ell_1$ Implicit Bias","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2212.03783","title":"Tight bounds for maximum $\\ell_1$-margin classifiers","created":"2022-12-07","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":"2505.19396","title":"Uniform convergence of the smooth calibration error and its relationship with functional gradient","created":"2025-05-26","cited_by_count":0,"area":null},{"id":"2605.24680","title":"Trajectory-Based Difficulty Scoring for Reliable Learning on Tabular Data","created":"2026-05-23","cited_by_count":0,"area":null}],"next_cursor":null}