{"total":36,"rows":[{"id":"2112.03459","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","created":"2021-12-07","cited_by_count":50,"area":null},{"id":"2102.06704","title":"Proximal and Federated Random Reshuffling","created":"2021-02-12","cited_by_count":33,"area":null},{"id":"2103.01447","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","created":"2021-03-02","cited_by_count":29,"area":null},{"id":"2303.00883","title":"Variance-reduced Clipping for Non-convex Optimization","created":"2023-03-02","cited_by_count":22,"area":null},{"id":"2102.06752","title":"A Hybrid Variance-Reduced Method for Decentralized Stochastic Non-Convex Optimization","created":"2021-02-12","cited_by_count":21,"area":null},{"id":"2301.06428","title":"Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization","created":"2023-01-16","cited_by_count":17,"area":null},{"id":"2203.16217","title":"Improved Convergence Rate of Stochastic Gradient Langevin Dynamics with Variance Reduction and its Application to Optimization","created":"2022-03-30","cited_by_count":16,"area":null},{"id":"2211.01851","title":"Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization","created":"2022-11-03","cited_by_count":15,"area":null},{"id":"2104.14840","title":"Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator","created":"2021-04-30","cited_by_count":13,"area":null},{"id":"2103.11333","title":"ANITA: An Optimal Loopless Accelerated Variance-Reduced Gradient Method","created":"2021-03-21","cited_by_count":9,"area":null},{"id":"2112.02612","title":"Training Structured Neural Networks Through Manifold Identification and Variance Reduction","created":"2021-12-05","cited_by_count":7,"area":null},{"id":"2306.02644","title":"Learned Alternating Minimization Algorithm for Dual-domain Sparse-View CT Reconstruction","created":"2023-06-05","cited_by_count":6,"area":null},{"id":"2206.00285","title":"Stochastic Gradient Methods with Preconditioned Updates","created":"2022-06-01","cited_by_count":5,"area":null},{"id":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2307.15868","title":"Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\\L}ojasiewicz Conditions","created":"2023-07-29","cited_by_count":5,"area":null},{"id":"2105.12062","title":"Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums","created":"2021-05-25","cited_by_count":4,"area":null},{"id":"2302.09766","title":"A One-Sample Decentralized Proximal Algorithm for Non-Convex Stochastic Composite Optimization","created":"2023-02-20","cited_by_count":4,"area":null},{"id":"2301.00631","title":"Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimization","created":"2023-01-02","cited_by_count":3,"area":null},{"id":"2402.02569","title":"On the Complexity of Finite-Sum Smooth Optimization under the Polyak-{\\L}ojasiewicz Condition","created":"2024-02-04","cited_by_count":2,"area":null},{"id":"2511.11512","title":"Collaborative Representation Learning for Alignment of Tactile, Language, and Vision Modalities","created":"2025-11-14","cited_by_count":2,"area":null},{"id":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2208.04579","title":"Adaptive Zeroth-Order Optimisation of Nonconvex Composite Objectives","created":"2022-08-09","cited_by_count":1,"area":null},{"id":"2212.09413","title":"Gradient Descent-Type Methods: Background and Simple Unified Convergence Analysis","created":"2022-12-19","cited_by_count":1,"area":null},{"id":"2403.15244","title":"A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness","created":"2024-03-22","cited_by_count":1,"area":null},{"id":"2502.21099","title":"Adaptive Lipschitz-Free Proximal Gradient Methods for Stochastic Composite Nonconvex Optimization","created":"2025-02-28","cited_by_count":1,"area":null},{"id":"2512.05327","title":"Non-Convex Federated Optimization under Cost-Aware Client Selection","created":"2025-12-05","cited_by_count":1,"area":null},{"id":"2607.21975","title":"On the Convergence of Stochastic Low-Rank Adaptation","created":"2026-07-24","cited_by_count":1,"area":null},{"id":"2206.06531","title":"A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum Optimization","created":"2022-06-14","cited_by_count":0,"area":null},{"id":"2207.08195","title":"SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization","created":"2022-07-17","cited_by_count":0,"area":null},{"id":"2211.11710","title":"Adaptive Stochastic Optimisation of Nonconvex Composite Objectives","created":"2022-11-21","cited_by_count":0,"area":null},{"id":"2406.04731","title":"Efficient Continual Finite-Sum Minimization","created":"2024-06-07","cited_by_count":0,"area":null},{"id":"2406.19475","title":"Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization","created":"2024-06-27","cited_by_count":0,"area":null},{"id":"2412.14488","title":"A stochastic first-order method with multi-extrapolated momentum for highly smooth unconstrained optimization","created":"2024-12-19","cited_by_count":0,"area":null},{"id":"2505.01258","title":"A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization","created":"2025-05-02","cited_by_count":0,"area":null},{"id":"2506.12444","title":"Adjusted Shuffling SARAH: Advancing Complexity Analysis via Dynamic Gradient Weighting","created":"2025-06-14","cited_by_count":0,"area":null},{"id":"2608.05460","title":"A proximal subgradient method for nonconvex stochastic optimization under the Kurdyka-{\\L}ojasiewicz condition","created":"2026-08-05","cited_by_count":0,"area":null}],"next_cursor":null}