{"total":122,"rows":[{"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":"2206.08213","title":"A Closer Look at Smoothness in Domain Adversarial Training","created":"2022-06-16","cited_by_count":85,"area":null},{"id":"2102.07845","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","created":"2021-02-15","cited_by_count":78,"area":null},{"id":"2206.07638","title":"Asynchronous SGD Beats Minibatch SGD Under Arbitrary Delays","created":"2022-06-15","cited_by_count":63,"area":null},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49,"area":null},{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49,"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":"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":"2306.01264","title":"Convex and Non-convex Optimization Under Generalized Smoothness","created":"2023-06-02","cited_by_count":44,"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":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39,"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":"2102.01583","title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","created":"2021-02-02","cited_by_count":31,"area":null},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"area":null},{"id":"2510.19933","title":"Beyond the Ideal: Analyzing the Inexact Muon Update","created":"2025-10-22","cited_by_count":27,"area":null},{"id":"2102.12586","title":"A Stochastic Optimization Framework for Fair Risk Minimization","created":"2021-02-24","cited_by_count":26,"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":"2305.12475","title":"Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods","created":"2023-05-21","cited_by_count":23,"area":null},{"id":"2307.04504","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","created":"2023-07-10","cited_by_count":23,"area":null},{"id":"2509.02981","title":"AdaGrad Meets Muon: Adaptive Stepsizes for Orthogonal Updates","created":"2025-09-03","cited_by_count":23,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"area":null},{"id":"2410.16561","title":"Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration","created":"2024-10-21","cited_by_count":18,"area":null},{"id":"2509.11983","title":"Low-rank Orthogonalization for Large-scale Matrix Optimization with Applications to Foundation Model Training","created":"2025-09-15","cited_by_count":18,"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":"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":"2110.06256","title":"Neural Network Weights Do Not Converge to Stationary Points: An Invariant Measure Perspective","created":"2021-10-12","cited_by_count":15,"area":null},{"id":"2307.00126","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","created":"2023-06-30","cited_by_count":15,"area":null},{"id":"2101.02696","title":"Accelerated, Optimal, and Parallel: Some Results on Model-Based Stochastic Optimization","created":"2021-01-07","cited_by_count":14,"area":null},{"id":"2103.02062","title":"Variance Reduced Training with Stratified Sampling for Forecasting Models","created":"2021-03-02","cited_by_count":14,"area":null},{"id":"2107.00469","title":"Never Go Full Batch (in Stochastic Convex Optimization)","created":"2021-06-29","cited_by_count":14,"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":"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":"2306.08553","title":"Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach","created":"2023-06-14","cited_by_count":14,"area":null},{"id":"2602.17080","title":"Adam Improves Muon: Adaptive Moment Estimation with Orthogonalized Momentum","created":"2026-02-19","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":"2209.10825","title":"Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis","created":"2022-09-22","cited_by_count":12,"area":null},{"id":"2210.02482","title":"Fisher information lower bounds for sampling","created":"2022-10-05","cited_by_count":12,"area":null},{"id":"2306.02159","title":"Gradient-free optimization of highly smooth functions: improved analysis and a new algorithm","created":"2023-06-03","cited_by_count":12,"area":null},{"id":"2405.11667","title":"The Limits and Potentials of Local SGD for Distributed Heterogeneous Learning with Intermittent Communication","created":"2024-05-19","cited_by_count":12,"area":null},{"id":"2506.23803","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","created":"2025-06-30","cited_by_count":12,"area":null},{"id":"2108.06869","title":"FedChain: Chained Algorithms for Near-Optimal Communication Cost in Federated Learning","created":"2021-08-16","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":"2404.09536","title":"Noiseless Privacy-Preserving Decentralized Learning","created":"2024-04-15","cited_by_count":9,"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":"2403.02648","title":"Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad","created":"2024-03-05","cited_by_count":8,"area":null},{"id":"2407.09690","title":"Private Heterogeneous Federated Learning Without a Trusted Server Revisited: Error-Optimal and Communication-Efficient Algorithms for Convex Losses","created":"2024-07-12","cited_by_count":8,"area":null},{"id":"2107.01832","title":"Provable Convergence of Nesterov's Accelerated Gradient Method for Over-Parameterized Neural Networks","created":"2021-07-05","cited_by_count":7,"area":null},{"id":"2109.00534","title":"The Minimax Complexity of Distributed Optimization","created":"2021-09-01","cited_by_count":7,"area":null},{"id":"2306.13800","title":"A First Order Meta Stackelberg Method for Robust Federated Learning","created":"2023-06-23","cited_by_count":7,"area":null},{"id":"2405.19440","title":"MGDA Converges under Generalized Smoothness, Provably","created":"2024-05-29","cited_by_count":7,"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":"2512.08176","title":"Worst-case generation via minimax optimization in Wasserstein space","created":"2025-12-09","cited_by_count":7,"area":null},{"id":"2205.03202","title":"Perseus: A Simple and Optimal High-Order Method for Variational Inequalities","created":"2022-05-06","cited_by_count":5,"area":null},{"id":"2306.02422","title":"A Generalized Alternating Method for Bilevel Learning under the Polyak-{\\L}ojasiewicz Condition","created":"2023-06-04","cited_by_count":5,"area":null},{"id":"2405.15545","title":"Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations","created":"2024-05-24","cited_by_count":5,"area":null},{"id":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2608.26288","title":"Muon with Finite Newton-Schulz: The Smoothing Benefit in Nonsmooth Nonconvex Optimization","created":"2026-08-26","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":"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":"2306.02212","title":"Accelerated Quasi-Newton Proximal Extragradient: Faster Rate for Smooth Convex Optimization","created":"2023-06-03","cited_by_count":4,"area":null},{"id":"2406.01484","title":"Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization","created":"2024-06-03","cited_by_count":4,"area":null},{"id":"2408.13983","title":"Dual-Path Adversarial Lifting for Domain Shift Correction in Online Test-time Adaptation","created":"2024-08-26","cited_by_count":4,"area":null},{"id":"2412.06990","title":"The Oracle Complexity of Simplex-based Matrix Games","created":"2024-12-09","cited_by_count":4,"area":null},{"id":"2311.06374","title":"Higher-Order Newton Methods with Polynomial Work per Iteration","created":"2023-11-10","cited_by_count":3,"area":null},{"id":"2502.13482","title":"Smoothed Normalization for Efficient Distributed Private Optimization","created":"2025-02-19","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":"2510.10690","title":"Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits","created":"2025-10-12","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":"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":"2207.05697","title":"A Newton-CG based barrier method for finding a second-order stationary point of nonconvex conic optimization with complexity guarantees","created":"2022-07-12","cited_by_count":2,"area":null},{"id":"2309.12323","title":"Evaluating the diversity and utility of materials proposed by generative models","created":"2023-08-09","cited_by_count":2,"area":null},{"id":"2310.09157","title":"The Computational Complexity of Finding Stationary Points in Non-Convex Optimization","created":"2023-10-13","cited_by_count":2,"area":null},{"id":"2310.12969","title":"Demystifying the Myths and Legends of Nonconvex Convergence of SGD","created":"2023-10-19","cited_by_count":2,"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":"2412.11850","title":"Causal Invariance Learning via Efficient Nonconvex Optimization","created":"2024-12-16","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":"2405.18031","title":"Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks","created":"2024-05-28","cited_by_count":1,"area":null},{"id":"2409.06530","title":"Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems","created":"2024-09-10","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":"2605.13806","title":"Min-Max Optimization Requires Exponentially Many Queries","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2606.00703","title":"Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation","created":"2026-05-30","cited_by_count":1,"area":null},{"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":"2606.27082","title":"Finding Stationary Points by Comparisons","created":"2026-06-25","cited_by_count":1,"area":null},{"id":"2608.09004","title":"A Tight Lower Bound for Smooth Nonconvex Stochastic Optimization with Bounded Gradient Noise","created":"2026-08-10","cited_by_count":1,"area":null},{"id":"2608.22129","title":"Blockwise Stabilized Adaptive Cubic Regularization with Subsolvers via Recurrence","created":"2026-08-22","cited_by_count":1,"area":null},{"id":"2609.30877","title":"Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization","created":"2026-09-25","cited_by_count":1,"area":null},{"id":"2209.00361","title":"Versatile Single-Loop Method for Gradient Estimator: First and Second Order Optimality, and its Application to Federated Learning","created":"2022-09-01","cited_by_count":0,"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":"2405.00914","title":"Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization","created":"2024-05-01","cited_by_count":0,"area":null}],"next_cursor":"100"}