{"total":35,"rows":[{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99,"area":null},{"id":"2306.01264","title":"Convex and Non-convex Optimization Under Generalized Smoothness","created":"2023-06-02","cited_by_count":44,"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":"2401.09587","title":"Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis","created":"2024-01-17","cited_by_count":15,"area":null},{"id":"2403.15146","title":"On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyond","created":"2024-03-22","cited_by_count":14,"area":null},{"id":"2404.01436","title":"Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance","created":"2024-04-01","cited_by_count":14,"area":null},{"id":"2406.00489","title":"Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction","created":"2024-06-01","cited_by_count":13,"area":null},{"id":"2502.07923","title":"Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness","created":"2025-02-11","cited_by_count":13,"area":null},{"id":"2408.09074","title":"Gradient-Variation Online Learning under Generalized Smoothness","created":"2024-08-17","cited_by_count":11,"area":null},{"id":"2409.19212","title":"An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","created":"2024-09-28","cited_by_count":9,"area":null},{"id":"2511.11466","title":"Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates","created":"2025-11-14","cited_by_count":8,"area":null},{"id":"2405.19440","title":"MGDA Converges under Generalized Smoothness, Provably","created":"2024-05-29","cited_by_count":7,"area":null},{"id":"2412.20017","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","created":"2024-12-28","cited_by_count":7,"area":null},{"id":"2410.14054","title":"Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization","created":"2024-10-17","cited_by_count":4,"area":null},{"id":"2410.16871","title":"Error Feedback under $(L_0,L_1)$-Smoothness: Normalization and Momentum","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2506.00181","title":"On the Interaction of Batch Noise, Adaptivity, and Compression, under $(L_0,L_1)$-Smoothness: An SDE Approach","created":"2025-05-30","cited_by_count":4,"area":null},{"id":"2503.00229","title":"Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster","created":"2025-02-28","cited_by_count":3,"area":null},{"id":"2503.22923","title":"Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization","created":"2025-03-29","cited_by_count":3,"area":null},{"id":"2510.22421","title":"Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems","created":"2025-10-25","cited_by_count":3,"area":null},{"id":"2506.12648","title":"Glocal Smoothness: Line search and adaptive step sizes can help in theory too!","created":"2025-06-14","cited_by_count":2,"area":null},{"id":"2605.18174","title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","created":"2026-05-18","cited_by_count":2,"area":null},{"id":"2503.03908","title":"On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness","created":"2025-03-05","cited_by_count":1,"area":null},{"id":"2508.06884","title":"Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness","created":"2025-08-09","cited_by_count":1,"area":null},{"id":"2602.06824","title":"RanSOM: Second-Order Momentum with Randomized Scaling for Constrained and Unconstrained Optimization","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2602.16155","title":"Differentially Private Non-convex Distributionally Robust Optimization","created":"2026-02-18","cited_by_count":1,"area":null},{"id":"2603.22155","title":"RAMPAGE: RAndomized Mid-Point for debiAsed Gradient Extrapolation","created":"2026-03-23","cited_by_count":1,"area":null},{"id":"2409.13672","title":"Recent Advances in Non-convex Smoothness Conditions and Applicability to Deep Linear Neural Networks","created":"2024-09-20","cited_by_count":0,"area":null},{"id":"2410.05807","title":"Extended convexity and smoothness and their applications in deep learning","created":"2024-10-08","cited_by_count":0,"area":null},{"id":"2507.08913","title":"Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness","created":"2025-07-11","cited_by_count":0,"area":null},{"id":"2509.08726","title":"Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness","created":"2025-09-10","cited_by_count":0,"area":null},{"id":"2601.03566","title":"Provably Convergent Decentralized Optimization over Directed Graphs under Generalized Smoothness","created":"2026-01-07","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":"2605.11850","title":"Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives","created":"2026-05-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},{"id":"2609.37787","title":"Adam under Generalized Smoothness with Second-Moment-Type Stochastic Gradients","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}