{"total":58,"rows":[{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"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":"2301.00712","title":"On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis","created":"2023-01-02","cited_by_count":39,"area":null},{"id":"2302.14428","title":"Stochastic Gradient Descent under Markovian Sampling Schemes","created":"2023-02-28","cited_by_count":38,"area":null},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36,"area":null},{"id":"2102.05274","title":"Stability of SGD: Tightness Analysis and Improved Bounds","created":"2021-02-10","cited_by_count":33,"area":null},{"id":"2206.03665","title":"Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression","created":"2022-06-08","cited_by_count":33,"area":null},{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24,"area":null},{"id":"2210.07863","title":"Revisiting Optimal Convergence Rate for Smooth and Non-convex Stochastic Decentralized Optimization","created":"2022-10-14","cited_by_count":23,"area":null},{"id":"2106.15739","title":"On the Periodic Behavior of Neural Network Training with Batch Normalization and Weight Decay","created":"2021-06-29","cited_by_count":20,"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":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17,"area":null},{"id":"2302.08766","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","created":"2023-02-17","cited_by_count":16,"area":null},{"id":"2307.00126","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","created":"2023-06-30","cited_by_count":15,"area":null},{"id":"2305.16297","title":"Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?","created":"2023-05-25","cited_by_count":14,"area":null},{"id":"2305.15659","title":"How to escape sharp minima with random perturbations","created":"2023-05-25","cited_by_count":13,"area":null},{"id":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2210.02482","title":"Fisher information lower bounds for sampling","created":"2022-10-05","cited_by_count":12,"area":null},{"id":"2304.07504","title":"Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysis","created":"2023-04-15","cited_by_count":11,"area":null},{"id":"2305.07612","title":"Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression","created":"2023-05-12","cited_by_count":11,"area":null},{"id":"2305.16569","title":"Accelerating Value Iteration with Anchoring","created":"2023-05-26","cited_by_count":11,"area":null},{"id":"2209.10346","title":"On the Complexity of Finding Small Subgradients in Nonsmooth Optimization","created":"2022-09-21","cited_by_count":8,"area":null},{"id":"2412.02175","title":"Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods","created":"2024-12-03","cited_by_count":7,"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.00533","title":"Optimal Complexity in Non-Convex Decentralized Learning over Time-Varying Networks","created":"2022-11-01","cited_by_count":4,"area":null},{"id":"2206.08257","title":"Gradient Descent for Low-Rank Functions","created":"2022-06-16","cited_by_count":3,"area":null},{"id":"2411.08987","title":"Non-Euclidean High-Order Smooth Convex Optimization","created":"2024-11-13","cited_by_count":3,"area":null},{"id":"2510.03167","title":"Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2511.19656","title":"Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles","created":"2025-11-24","cited_by_count":3,"area":null},{"id":"2511.22331","title":"On the Condition Number Dependency in Bilevel Optimization","created":"2025-11-27","cited_by_count":3,"area":null},{"id":"2203.05006","title":"Resource-Efficient Invariant Networks: Exponential Gains by Unrolled Optimization","created":"2022-03-09","cited_by_count":2,"area":null},{"id":"2412.10663","title":"Memory-Efficient 4-bit Preconditioned Stochastic Optimization","created":"2024-12-14","cited_by_count":2,"area":null},{"id":"2605.06615","title":"When and Why SignSGD Outperforms SGD: A Theoretical Study Based on $\\ell_1$-norm Lower Bounds","created":"2026-05-07","cited_by_count":2,"area":null},{"id":"2103.05138","title":"On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization","created":"2021-03-08","cited_by_count":1,"area":null},{"id":"2304.08389","title":"Beyond first-order methods for non-convex non-concave min-max optimization","created":"2023-04-17","cited_by_count":1,"area":null},{"id":"2403.16317","title":"Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective","created":"2024-03-24","cited_by_count":1,"area":null},{"id":"2502.19764","title":"Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions","created":"2025-02-27","cited_by_count":1,"area":null},{"id":"2509.02937","title":"Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization","created":"2025-09-03","cited_by_count":1,"area":null},{"id":"2509.24305","title":"Asynchronous Policy Gradient Aggregation for Efficient Distributed Reinforcement Learning","created":"2025-09-29","cited_by_count":1,"area":"deeprl"},{"id":"2605.10909","title":"Revisiting Policy Gradients for Restricted Policy Classes: Escaping Myopic Local Optima with $k$-step Policy Gradients","created":"2026-05-11","cited_by_count":1,"area":"deeprl"},{"id":"2606.05438","title":"Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2307.07605","title":"First-order Methods for Affinely Constrained Composite Non-convex Non-smooth Problems: Lower Complexity Bound and Near-optimal Methods","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2308.10630","title":"A Homogenization Approach for Gradient-Dominated Stochastic Optimization","created":"2023-08-21","cited_by_count":0,"area":null},{"id":"2405.00914","title":"Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization","created":"2024-05-01","cited_by_count":0,"area":null},{"id":"2502.12329","title":"A Novel Unified Parametric Assumption for Nonconvex Optimization","created":"2025-02-17","cited_by_count":0,"area":null},{"id":"2504.15758","title":"Observability conditions for neural state-space models with eigenvalues and their roots of unity","created":"2025-04-22","cited_by_count":0,"area":"ssm"},{"id":"2509.13550","title":"Complexity Bounds for Smooth Multiobjective Optimization","created":"2025-09-16","cited_by_count":0,"area":null},{"id":"2601.21917","title":"On Approximate Computation of Critical Points","created":"2026-01-29","cited_by_count":0,"area":null},{"id":"2602.03802","title":"Do We Need Asynchronous SGD? On the Near-Optimality of Synchronous Methods","created":"2026-02-03","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":"2609.13677","title":"Nonsmooth Optimization via Orthogonalized Momentum","created":"2026-09-12","cited_by_count":0,"area":null},{"id":"2609.39114","title":"The Row Normalization Puzzle in Muon","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.01662","title":"Lower Bounds for Stochastic First-Order Algorithms with Variance Reduction in Nonconvex--Concave Minimax Optimization","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.04944","title":"Near-Optimal Complexity of Finite-Sum Nonconvex-Strongly-Concave Minimax Optimization","created":"2026-10-04","cited_by_count":0,"area":null},{"id":"2610.06070","title":"Last-Iterate Convergence Rate of Normalized Gradient Descent under H\\\"older Smoothness","created":"2026-10-05","cited_by_count":0,"area":null},{"id":"2610.14716","title":"Multi-Token Random-Walk Learning via Meeting-Triggered Information Exchange","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}