{"total":58,"rows":[{"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":"2107.00595","title":"Fast Margin Maximization via Dual Acceleration","created":"2021-07-01","cited_by_count":33,"area":null},{"id":"2202.01331","title":"Fast Convex Optimization for Two-Layer ReLU Networks: Equivalent Model Classes and Cone Decompositions","created":"2022-02-02","cited_by_count":31,"area":null},{"id":"2106.09481","title":"Stochastic Bias-Reduced Gradient Methods","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2209.06993","title":"Learning from Future: A Novel Self-Training Framework for Semantic Segmentation","created":"2022-09-15","cited_by_count":21,"area":null},{"id":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"area":null},{"id":"2105.01778","title":"Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss","created":"2021-05-04","cited_by_count":17,"area":null},{"id":"2102.02167","title":"Algorithmic Instabilities of Accelerated Gradient Descent","created":"2021-02-03","cited_by_count":16,"area":null},{"id":"2106.07644","title":"A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossip","created":"2021-06-10","cited_by_count":15,"area":null},{"id":"2106.11938","title":"Robust Regression Revisited: Acceleration and Improved Estimation Rates","created":"2021-06-22","cited_by_count":15,"area":null},{"id":"2103.01338","title":"Acceleration via Fractal Learning Rate Schedules","created":"2021-03-01","cited_by_count":13,"area":null},{"id":"2402.17722","title":"Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence","created":"2024-02-27","cited_by_count":11,"area":null},{"id":"2403.03562","title":"Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond","created":"2024-03-06","cited_by_count":11,"area":null},{"id":"2102.13643","title":"Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums","created":"2021-02-26","cited_by_count":10,"area":null},{"id":"2305.07730","title":"Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms","created":"2023-05-12","cited_by_count":10,"area":null},{"id":"2310.04006","title":"Accelerating optimization over the space of probability measures","created":"2023-10-06","cited_by_count":10,"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":"2203.01744","title":"Accelerated SGD for Non-Strongly-Convex Least Squares","created":"2022-03-03","cited_by_count":9,"area":null},{"id":"2207.08257","title":"Uniform Stability for First-Order Empirical Risk Minimization","created":"2022-07-17","cited_by_count":8,"area":null},{"id":"2211.01832","title":"Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods","created":"2022-11-03","cited_by_count":8,"area":null},{"id":"2111.06171","title":"Convergence and Stability of the Stochastic Proximal Point Algorithm with Momentum","created":"2021-11-11","cited_by_count":7,"area":null},{"id":"2301.09675","title":"Improved Rate of First Order Algorithms for Entropic Optimal Transport","created":"2023-01-23","cited_by_count":7,"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":"2403.04978","title":"Stacking as Accelerated Gradient Descent","created":"2024-03-08","cited_by_count":5,"area":null},{"id":"2410.06293","title":"Accelerated Preference Optimization for Large Language Model Alignment","created":"2024-10-08","cited_by_count":5,"area":"alignment"},{"id":"2506.11077","title":"CyclicReflex: Improving Reasoning Models via Cyclical Reflection Token Scheduling","created":"2025-06-04","cited_by_count":5,"area":"lr"},{"id":"2511.20584","title":"A Tale of Two Geometries: Adaptive Optimizers and Non-Euclidean Descent","created":"2025-11-25","cited_by_count":5,"area":null},{"id":"2101.12101","title":"Potential Function-based Framework for Making the Gradients Small in Convex and Min-Max Optimization","created":"2021-01-28","cited_by_count":4,"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":"2211.14645","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","created":"2022-11-26","cited_by_count":4,"area":null},{"id":"2410.17336","title":"Computing Optimal Regularizers for Online Linear Optimization","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2111.02763","title":"Understanding Riemannian Acceleration via a Proximal Extragradient Framework","created":"2021-11-04","cited_by_count":3,"area":null},{"id":"2202.06152","title":"Analysis of Dual-Based PID Controllers through Convolutional Mirror Descent","created":"2022-02-12","cited_by_count":3,"area":null},{"id":"2208.04065","title":"Optimistic Optimisation of Composite Objective with Exponentiated Update","created":"2022-08-08","cited_by_count":3,"area":null},{"id":"2307.11118","title":"Diffusion Sampling with Momentum for Mitigating Divergence Artifacts","created":"2023-07-20","cited_by_count":3,"area":"diffusion"},{"id":"2505.07614","title":"Bant: Byzantine Antidote via Trial Function and Trust Scores","created":"2025-05-12","cited_by_count":3,"area":null},{"id":"2506.06606","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","created":"2025-06-07","cited_by_count":3,"area":null},{"id":"2510.19163","title":"Natural Gradient VI: Guarantees for Non-Conjugate Models","created":"2025-10-22","cited_by_count":3,"area":null},{"id":"2110.01773","title":"Differentiable Equilibrium Computation with Decision Diagrams for Stackelberg Models of Combinatorial Congestion Games","created":"2021-10-05","cited_by_count":2,"area":null},{"id":"2311.02002","title":"A Variational Perspective on High-Resolution ODEs","created":"2023-11-03","cited_by_count":2,"area":null},{"id":"2412.20365","title":"Accelerated regularized learning in finite N-person games","created":"2024-12-29","cited_by_count":2,"area":null},{"id":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2103.09756","title":"Near Optimal Policy Optimization via REPS","created":"2021-03-17","cited_by_count":1,"area":null},{"id":"2107.12065","title":"Provably Accelerated Decentralized Gradient Method Over Unbalanced Directed Graphs","created":"2021-07-26","cited_by_count":1,"area":null},{"id":"2402.02356","title":"Decentralized Sum-of-Nonconvex Optimization","created":"2024-02-04","cited_by_count":1,"area":null},{"id":"2403.03362","title":"Level Set Teleportation: An Optimization Perspective","created":"2024-03-05","cited_by_count":1,"area":null},{"id":"2409.19200","title":"Faster Acceleration for Steepest Descent","created":"2024-09-28","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":"2512.13547","title":"A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications","created":"2025-12-15","cited_by_count":1,"area":null},{"id":"2201.08311","title":"Accelerated Gradient Flow: Risk, Stability, and Implicit Regularization","created":"2022-01-20","cited_by_count":0,"area":null},{"id":"2205.02273","title":"An Adaptive Incremental Gradient Method With Support for Non-Euclidean Norms","created":"2022-04-28","cited_by_count":0,"area":null},{"id":"2304.10063","title":"Understanding Accelerated Gradient Methods: Lyapunov Analyses and Hamiltonian Assisted Interpretations","created":"2023-04-20","cited_by_count":0,"area":null},{"id":"2304.11665","title":"Accelerated Doubly Stochastic Gradient Algorithm for Large-scale Empirical Risk Minimization","created":"2023-04-23","cited_by_count":0,"area":null},{"id":"2405.12228","title":"Fast Stochastic Policy Gradient: Negative Momentum for Reinforcement Learning","created":"2024-05-08","cited_by_count":0,"area":"deeprl"},{"id":"2409.00913","title":"Generalized Continuous-Time Models for Nesterov's Accelerated Gradient Methods","created":"2024-09-02","cited_by_count":0,"area":null},{"id":"2510.04480","title":"FourierCSP: Differentiable Constraint Satisfaction Problem Solving by Walsh-Fourier Expansion","created":"2025-10-06","cited_by_count":0,"area":null},{"id":"2510.08010","title":"Accelerated Evolving Set Processes for Local PageRank Computation","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2609.21880","title":"Near-Optimal Acceleration for Smooth $\\ell_p$ / $\\ell_q$ Nondual Convex First-Order Oracle Optimization","created":"2026-09-18","cited_by_count":0,"area":null}],"next_cursor":null}