{"total":29,"rows":[{"id":"2305.01588","title":"Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees","created":"2023-05-02","cited_by_count":83,"area":null},{"id":"2306.00204","title":"Toward Understanding Why Adam Converges Faster Than SGD for Transformers","created":"2023-05-31","cited_by_count":53,"area":null},{"id":"2310.05898","title":"Lion Secretly Solves Constrained Optimization: As Lyapunov Predicts","created":"2023-10-09","cited_by_count":51,"area":null},{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49,"area":null},{"id":"2412.19529","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","created":"2024-12-27","cited_by_count":42,"area":null},{"id":"2212.04055","title":"Mitigating Memorization of Noisy Labels by Clipping the Model Prediction","created":"2022-12-08","cited_by_count":40,"area":null},{"id":"2202.00980","title":"Robust Training of Neural Networks Using Scale Invariant Architectures","created":"2022-02-02","cited_by_count":29,"area":null},{"id":"2305.12475","title":"Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods","created":"2023-05-21","cited_by_count":23,"area":null},{"id":"2301.08203","title":"An SDE for Modeling SAM: Theory and Insights","created":"2023-01-19","cited_by_count":22,"area":null},{"id":"2205.05040","title":"A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural Networks","created":"2022-05-10","cited_by_count":20,"area":null},{"id":"2506.16659","title":"Memory-Efficient LLM Pretraining via Minimalist Optimizer Design","created":"2025-06-20","cited_by_count":13,"area":null},{"id":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"area":null},{"id":"2302.07155","title":"EPISODE: Episodic Gradient Clipping with Periodic Resampled Corrections for Federated Learning with Heterogeneous Data","created":"2023-02-14","cited_by_count":7,"area":null},{"id":"2106.14956","title":"Robust Distributed Optimization With Randomly Corrupted Gradients","created":"2021-06-28","cited_by_count":6,"area":null},{"id":"2110.13265","title":"On the Second-order Convergence Properties of Random Search Methods","created":"2021-10-25","cited_by_count":5,"area":null},{"id":"2502.17009","title":"Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEs","created":"2025-02-24","cited_by_count":5,"area":null},{"id":"2602.05813","title":"Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers","created":"2026-02-05","cited_by_count":5,"area":null},{"id":"2210.04319","title":"Dissecting adaptive methods in GANs","created":"2022-10-09","cited_by_count":3,"area":null},{"id":"2502.13482","title":"Smoothed Normalization for Efficient Distributed Private Optimization","created":"2025-02-19","cited_by_count":3,"area":null},{"id":"2106.09475","title":"Backward Gradient Normalization in Deep Neural Networks","created":"2021-06-17","cited_by_count":2,"area":null},{"id":"2602.13413","title":"Why is Normalization Preferred? A Worst-Case Complexity Theory for Stochastically Preconditioned SGD under Heavy-Tailed Noise","created":"2026-02-13","cited_by_count":2,"area":null},{"id":"2101.06847","title":"On the Differentially Private Nature of Perturbed Gradient Descent","created":"2021-01-18","cited_by_count":1,"area":null},{"id":"2305.18188","title":"Understanding Predictive Coding as an Adaptive Trust-Region Method","created":"2023-05-29","cited_by_count":1,"area":null},{"id":"2310.14901","title":"Series of Hessian-Vector Products for Tractable Saddle-Free Newton Optimisation of Neural Networks","created":"2023-10-23","cited_by_count":1,"area":null},{"id":"2406.02296","title":"Learning-Rate-Free Stochastic Optimization over Riemannian Manifolds","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2212.03765","title":"Generalized Gradient Flows with Provable Fixed-Time Convergence and Fast Evasion of Non-Degenerate Saddle Points","created":"2022-12-07","cited_by_count":0,"area":null},{"id":"2605.16017","title":"Accelerated Gradient Descent for Faster Convergence with Minimal Overhead","created":"2026-05-15","cited_by_count":0,"area":null},{"id":"2609.30732","title":"TR-SSQP: A Trust-Region Method for Constrained Stochastic Optimization under Heavy-Tailed Noise","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.35701","title":"MeqMuon: Matrix-Equilibrating Muon for LLM Pretraining","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}