{"total":71,"rows":[{"id":"2201.07443","title":"On the Convergence Rates of Policy Gradient Methods","created":"2022-01-19","cited_by_count":119,"area":null},{"id":"2503.12645","title":"Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization","created":"2025-03-16","cited_by_count":92,"area":null},{"id":"2205.07344","title":"Policy Gradient Method For Robust Reinforcement Learning","created":"2022-05-15","cited_by_count":69,"area":null},{"id":"2302.01772","title":"Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneity","created":"2023-02-03","cited_by_count":65,"area":null},{"id":"2102.03926","title":"Lower Bounds and Accelerated Algorithms for Bilevel Optimization","created":"2021-02-07","cited_by_count":46,"area":null},{"id":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"area":null},{"id":"2204.02833","title":"High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize","created":"2022-04-06","cited_by_count":40,"area":null},{"id":"2212.10439","title":"Policy Gradient in Robust MDPs with Global Convergence Guarantee","created":"2022-12-20","cited_by_count":38,"area":null},{"id":"2410.16103","title":"LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statistics","created":"2024-10-21","cited_by_count":38,"area":null},{"id":"2206.00846","title":"Faster Rates of Convergence to Stationary Points in Differentially Private Optimization","created":"2022-06-02","cited_by_count":32,"area":null},{"id":"2206.10870","title":"Decentralized Gossip-Based Stochastic Bilevel Optimization over Communication Networks","created":"2022-06-22","cited_by_count":32,"area":null},{"id":"2308.10542","title":"Learning Weakly Convex Regularizers for Convergent Image-Reconstruction Algorithms","created":"2023-08-21","cited_by_count":31,"area":null},{"id":"2305.18424","title":"Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learning","created":"2023-05-28","cited_by_count":26,"area":null},{"id":"2103.02827","title":"On the Convergence and Optimality of Policy Gradient for Markov Coherent Risk","created":"2021-03-04","cited_by_count":20,"area":null},{"id":"2203.09436","title":"Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions","created":"2022-03-17","cited_by_count":19,"area":null},{"id":"2405.15593","title":"MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence","created":"2024-05-24","cited_by_count":19,"area":null},{"id":"2101.09379","title":"SGD-Net: Efficient Model-Based Deep Learning with Theoretical Guarantees","created":"2021-01-22","cited_by_count":18,"area":null},{"id":"2201.11411","title":"Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(\\epsilon^{-7/4})$ Complexity","created":"2022-01-27","cited_by_count":17,"area":null},{"id":"2312.12065","title":"PPO-Clip Attains Global Optimality: Towards Deeper Understandings of Clipping","created":"2023-12-19","cited_by_count":17,"area":null},{"id":"2209.06866","title":"Robust Constrained Reinforcement Learning","created":"2022-09-14","cited_by_count":15,"area":null},{"id":"2303.09261","title":"Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold","created":"2023-03-16","cited_by_count":14,"area":null},{"id":"2307.11782","title":"Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case","created":"2023-07-20","cited_by_count":14,"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":"2206.07553","title":"On the fast convergence of minibatch heavy ball momentum","created":"2022-06-15","cited_by_count":13,"area":null},{"id":"2506.11214","title":"Complexity of normalized stochastic first-order methods with momentum under heavy-tailed noise","created":"2025-06-12","cited_by_count":11,"area":null},{"id":"2403.02967","title":"Non-convex Stochastic Composite Optimization with Polyak Momentum","created":"2024-03-05","cited_by_count":9,"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":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"area":null},{"id":"2209.08862","title":"Gradient Norm Minimization of Nesterov Acceleration: $o(1/k^3)$","created":"2022-09-19","cited_by_count":8,"area":null},{"id":"2412.14291","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","created":"2024-12-18","cited_by_count":6,"area":null},{"id":"2106.10708","title":"Memory Augmented Optimizers for Deep Learning","created":"2021-06-20","cited_by_count":5,"area":null},{"id":"2112.09191","title":"Analysis of Generalized Bregman Surrogate Algorithms for Nonsmooth Nonconvex Statistical Learning","created":"2021-12-16","cited_by_count":5,"area":null},{"id":"2205.14811","title":"Last-iterate convergence analysis of stochastic momentum methods for neural networks","created":"2022-05-30","cited_by_count":5,"area":null},{"id":"2307.13680","title":"High Probability Analysis for Non-Convex Stochastic Optimization with Clipping","created":"2023-07-25","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":"2112.11663","title":"Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning","created":"2021-12-22","cited_by_count":4,"area":null},{"id":"2310.14616","title":"Rethinking SIGN Training: Provable Nonconvex Acceleration without First- and Second-Order Gradient Lipschitz","created":"2023-10-23","cited_by_count":4,"area":null},{"id":"2512.13123","title":"Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences","created":"2025-12-15","cited_by_count":4,"area":null},{"id":"2608.12043","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","created":"2026-08-12","cited_by_count":4,"area":null},{"id":"2304.09221","title":"Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks","created":"2023-04-18","cited_by_count":3,"area":null},{"id":"2102.09893","title":"A Variance Controlled Stochastic Method with Biased Estimation for Faster Non-convex Optimization","created":"2021-02-19","cited_by_count":2,"area":null},{"id":"2106.02888","title":"Bandwidth-based Step-Sizes for Non-Convex Stochastic Optimization","created":"2021-06-05","cited_by_count":2,"area":null},{"id":"2112.00222","title":"Convergence of GANs Training: A Game and Stochastic Control Methodology","created":"2021-12-01","cited_by_count":2,"area":null},{"id":"2202.09052","title":"Tackling benign nonconvexity with smoothing and stochastic gradients","created":"2022-02-18","cited_by_count":2,"area":null},{"id":"2307.07030","title":"Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima","created":"2023-07-13","cited_by_count":2,"area":null},{"id":"2311.09065","title":"Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2205.03059","title":"Low-rank Tensor Learning with Nonconvex Overlapped Nuclear Norm Regularization","created":"2022-05-06","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":"2304.14642","title":"On Underdamped Nesterov's Acceleration","created":"2023-04-28","cited_by_count":1,"area":null},{"id":"2401.00664","title":"Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming","created":"2024-01-01","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":"2410.20153","title":"The inexact power augmented Lagrangian method for constrained nonconvex optimization","created":"2024-10-26","cited_by_count":1,"area":null},{"id":"2605.28517","title":"Stochastic Gradient Descent with Momentum is Algorithmically Stable","created":"2026-05-27","cited_by_count":1,"area":null},{"id":"2103.04413","title":"Escaping Saddle Points with Stochastically Controlled Stochastic Gradient Methods","created":"2021-03-07","cited_by_count":0,"area":null},{"id":"2110.00625","title":"Accelerate Distributed Stochastic Descent for Nonconvex Optimization with Momentum","created":"2021-10-01","cited_by_count":0,"area":null},{"id":"2110.08531","title":"A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization","created":"2021-10-16","cited_by_count":0,"area":null},{"id":"2111.02632","title":"A Fast Parallel Tensor Decomposition with Optimal Stochastic Gradient Descent: an Application in Structural Damage Identification","created":"2021-11-04","cited_by_count":0,"area":null},{"id":"2205.08098","title":"Can We Do Better Than Random Start? The Power of Data Outsourcing","created":"2022-05-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":"2304.10499","title":"Projective Proximal Gradient Descent for A Class of Nonconvex Nonsmooth Optimization Problems: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property","created":"2023-04-20","cited_by_count":0,"area":null},{"id":"2310.06217","title":"Federated Multi-Level Optimization over Decentralized Networks","created":"2023-10-10","cited_by_count":0,"area":null},{"id":"2409.17090","title":"Locally Regularized Sparse Graph by Fast Proximal Gradient Descent","created":"2024-09-25","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":"2601.01160","title":"Gradient-Free Approaches is a Key to an Efficient Interaction with Markovian Stochasticity","created":"2026-01-03","cited_by_count":0,"area":null},{"id":"2604.06525","title":"Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates","created":"2026-04-07","cited_by_count":0,"area":null},{"id":"2605.02127","title":"A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\\tilde{\\mkern1mu O}(\\epsilon^{-5/3})$ Global Rate","created":"2026-05-04","cited_by_count":0,"area":null},{"id":"2605.30807","title":"Conformal Reliability: A New Evaluation Metric for Conditional Generation","created":"2026-05-29","cited_by_count":0,"area":null},{"id":"2607.17607","title":"Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles","created":"2026-07-20","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},{"id":"2608.17244","title":"Maximum Tsallis Entropy Distributions for Robust and Efficient Sparse Learning from Correlated Data","created":"2026-08-18","cited_by_count":0,"area":null},{"id":"2610.13787","title":"Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}