{"total":41,"rows":[{"id":"2405.14813","title":"Scalable Optimization in the Modular Norm","created":"2024-05-23","cited_by_count":68,"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":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"area":null},{"id":"2501.10945","title":"Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond","created":"2025-01-19","cited_by_count":18,"area":null},{"id":"2403.04081","title":"Directional Smoothness and Gradient Methods: Convergence and Adaptivity","created":"2024-03-06","cited_by_count":17,"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":"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":"2410.19964","title":"Understanding Adam Requires Better Rotation Dependent Assumptions","created":"2024-10-25","cited_by_count":11,"area":null},{"id":"2511.04622","title":"ODE approximation for the Adam algorithm: General and overparametrized setting","created":"2025-11-06","cited_by_count":10,"area":null},{"id":"2405.19440","title":"MGDA Converges under Generalized Smoothness, Provably","created":"2024-05-29","cited_by_count":7,"area":null},{"id":"2505.09572","title":"SAD Neural Networks: Divergent Gradient Flows and Asymptotic Optimality via o-minimal Structures","created":"2025-05-14","cited_by_count":5,"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":"2509.07972","title":"Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence","created":"2025-09-09","cited_by_count":4,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2407.01825","title":"Reevaluating Theoretical Analysis Methods for Optimization in Deep Learning","created":"2024-07-01","cited_by_count":3,"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":"2506.13710","title":"Gradient-Normalized Smoothness for Optimization with Approximate Hessians","created":"2025-06-16","cited_by_count":3,"area":null},{"id":"2503.03023","title":"Quantum Non-Linear Bandit Optimization","created":"2025-03-04","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":"2506.24120","title":"Data Uniformity Improves Training Efficiency and More, with a Convergence Framework Beyond the NTK Regime","created":"2025-06-30","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.05657","title":"Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization","created":"2026-02-05","cited_by_count":1,"area":null},{"id":"2606.23676","title":"Open Problem: Is AdamW Effective Under Heavy-Tailed Noise?","created":"2026-06-22","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":"2410.14667","title":"SGD Jittering: A Training Strategy for Robust and Accurate Model-Based Architectures","created":"2024-10-18","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":"2601.03566","title":"Provably Convergent Decentralized Optimization over Directed Graphs under Generalized Smoothness","created":"2026-01-07","cited_by_count":0,"area":null},{"id":"2601.15915","title":"Progressive Power Homotopy for Non-convex Optimization","created":"2026-01-22","cited_by_count":0,"area":null},{"id":"2604.09940","title":"New Hybrid Fine-Tuning Paradigm for LLMs: Algorithm Design and Convergence Analysis Framework","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2605.05660","title":"From Dual Tracking to Clipping: Provably Faster Distributionally Robust Multi-Objective Optimization","created":"2026-05-07","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":"2605.15522","title":"Stochastic Non-Smooth Convex Optimization with Unbounded Gradients","created":"2026-05-15","cited_by_count":0,"area":null},{"id":"2606.19878","title":"On the Oracle Complexity of Interpolation-Based Gradient Descent","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2608.11479","title":"Convergence Guarantees of Gradient Descent for Neural Networks via Generalized Lipschitz Smoothness","created":"2026-08-11","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}