{"total":46,"rows":[{"id":"2306.01264","title":"Convex and Non-convex Optimization Under Generalized Smoothness","created":"2023-06-02","cited_by_count":44,"area":null},{"id":"2309.07835","title":"Learning to Warm-Start Fixed-Point Optimization Algorithms","created":"2023-09-14","cited_by_count":32,"area":null},{"id":"2601.13474","title":"Preconditioning Benefits of Spectral Orthogonalization in Muon","created":"2026-01-20","cited_by_count":30,"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":"2110.12347","title":"Acceleration in Distributed Optimization under Similarity","created":"2021-10-24","cited_by_count":17,"area":null},{"id":"2209.13271","title":"The Curse of Unrolling: Rate of Differentiating Through Optimization","created":"2022-09-27","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":"2206.07630","title":"Rethinking Initialization of the Sinkhorn Algorithm","created":"2022-06-15","cited_by_count":14,"area":null},{"id":"2103.01338","title":"Acceleration via Fractal Learning Rate Schedules","created":"2021-03-01","cited_by_count":13,"area":null},{"id":"2201.04040","title":"PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python","created":"2022-01-11","cited_by_count":11,"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":"2411.01803","title":"Gradient Methods with Online Scaling","created":"2024-11-04","cited_by_count":11,"area":null},{"id":"2505.01423","title":"Negative Stepsizes Make Gradient-Descent-Ascent Converge","created":"2025-05-02","cited_by_count":11,"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":"2207.02189","title":"Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time","created":"2022-07-05","cited_by_count":7,"area":null},{"id":"2407.07084","title":"Stabilized Proximal-Point Methods for Federated Optimization","created":"2024-07-09","cited_by_count":7,"area":null},{"id":"2206.13285","title":"Sum-of-Squares Relaxations for Information Theory and Variational Inference","created":"2022-06-27","cited_by_count":6,"area":null},{"id":"2302.12120","title":"Sequential Counterfactual Risk Minimization","created":"2023-02-23","cited_by_count":6,"area":null},{"id":"2208.06619","title":"Riemannian accelerated gradient methods via extrapolation","created":"2022-08-13","cited_by_count":5,"area":null},{"id":"2406.13888","title":"Open Problem: Anytime Convergence Rate of Gradient Descent","created":"2024-06-19","cited_by_count":5,"area":null},{"id":"2502.11229","title":"Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent","created":"2025-02-16","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":"2205.12751","title":"Fast Stochastic Composite Minimization and an Accelerated Frank-Wolfe Algorithm under Parallelization","created":"2022-05-25","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":"2402.08097","title":"An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization","created":"2024-02-12","cited_by_count":4,"area":null},{"id":"2505.08146","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","created":"2025-05-13","cited_by_count":4,"area":null},{"id":"2306.10096","title":"Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2403.17572","title":"Enhancing Privacy in Federated Learning through Local Training","created":"2024-03-26","cited_by_count":3,"area":null},{"id":"2509.02970","title":"Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation","created":"2025-09-03","cited_by_count":3,"area":null},{"id":"2301.02268","title":"Restarts subject to approximate sharpness: A parameter-free and optimal scheme for first-order methods","created":"2023-01-05","cited_by_count":2,"area":null},{"id":"2410.21634","title":"Faster Local Solvers for Graph Diffusion Equations","created":"2024-10-29","cited_by_count":2,"area":null},{"id":"2506.12648","title":"Glocal Smoothness: Line search and adaptive step sizes can help in theory too!","created":"2025-06-14","cited_by_count":2,"area":null},{"id":"2501.08779","title":"Nesterov Acceleration for Ensemble Kalman Inversion and Variants","created":"2025-01-15","cited_by_count":1,"area":null},{"id":"2509.11007","title":"Gradient Methods with Online Scaling Part II. Practical Aspects","created":"2025-09-13","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":"2210.12573","title":"An Efficient Nonlinear Acceleration method that Exploits Symmetry of the Hessian","created":"2022-10-22","cited_by_count":0,"area":null},{"id":"2304.07983","title":"Snacks: a fast large-scale kernel SVM solver","created":"2023-04-17","cited_by_count":0,"area":null},{"id":"2311.02490","title":"Improved Convergence Factor of Windowed Anderson Acceleration for Symmetric Fixed-Point Iterations","created":"2023-11-04","cited_by_count":0,"area":null},{"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":"2502.00320","title":"$k$-SVD with Gradient Descent","created":"2025-02-01","cited_by_count":0,"area":null},{"id":"2502.17373","title":"A Concise Lyapunov Analysis of Nesterov's Accelerated Gradient Method","created":"2025-02-24","cited_by_count":0,"area":null},{"id":"2507.08913","title":"Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness","created":"2025-07-11","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":"2510.15483","title":"Fast Best-in-Class Regret for Contextual Bandits","created":"2025-10-17","cited_by_count":0,"area":null},{"id":"2604.17145","title":"Negative Momentum for Convex-Concave Optimization","created":"2026-04-18","cited_by_count":0,"area":null},{"id":"2608.11760","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","created":"2026-08-12","cited_by_count":0,"area":null}],"next_cursor":null}