{"total":20,"rows":[{"id":"2402.05738","title":"Implicit Bias and Fast Convergence Rates for Self-attention","created":"2024-02-08","cited_by_count":31,"area":null},{"id":"2510.09827","title":"An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variants","created":"2025-10-10","cited_by_count":28,"area":null},{"id":"2406.04142","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","created":"2024-06-06","cited_by_count":13,"area":null},{"id":"2310.02093","title":"Stochastic Gradient Descent with Preconditioned Polyak Step-size","created":"2023-10-03","cited_by_count":7,"area":null},{"id":"2505.20219","title":"New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results","created":"2025-05-26","cited_by_count":6,"area":null},{"id":"2312.17369","title":"SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms","created":"2023-12-28","cited_by_count":5,"area":null},{"id":"2402.18824","title":"Batch size invariant Adam","created":"2024-02-29","cited_by_count":5,"area":null},{"id":"2504.01898","title":"Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation","created":"2025-04-02","cited_by_count":5,"area":null},{"id":"2505.24005","title":"How far away are truly hyperparameter-free learning algorithms?","created":"2025-05-29","cited_by_count":2,"area":null},{"id":"2511.07767","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","created":"2025-11-11","cited_by_count":2,"area":null},{"id":"2512.02342","title":"Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients","created":"2025-12-02","cited_by_count":2,"area":null},{"id":"2605.11838","title":"Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameters","created":"2026-05-12","cited_by_count":2,"area":null},{"id":"2510.04988","title":"Adaptive Memory Momentum via a Model-Based Framework for Deep Learning Optimization","created":"2025-10-06","cited_by_count":1,"area":null},{"id":"2606.01827","title":"Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler","created":"2026-06-01","cited_by_count":1,"area":null},{"id":"2312.15229","title":"Regularized PolyKervNets: Optimizing Expressiveness and Efficiency for Private Inference in Deep Neural Networks","created":"2023-12-23","cited_by_count":0,"area":null},{"id":"2402.14400","title":"Learning Developmental Age from 3D Infant Kinetics Using Adaptive Graph Neural Networks","created":"2024-02-22","cited_by_count":0,"area":null},{"id":"2602.09842","title":"Step-Size Stability in Stochastic Optimization: A Theoretical Perspective","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2603.12512","title":"Byzantine-Robust Optimization under $(L_0, L_1)$-Smoothness","created":"2026-03-12","cited_by_count":0,"area":null},{"id":"2606.14970","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","created":"2026-06-12","cited_by_count":0,"area":null},{"id":"2609.30276","title":"Why Clipping Matters in AdaGrad? Toward a High-Probability Theory under Generalized Smoothness","created":"2026-08-12","cited_by_count":0,"area":null}],"next_cursor":null}