{"total":78,"rows":[{"id":"2306.06101","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","created":"2023-06-09","cited_by_count":133,"area":null},{"id":"2301.09604","title":"FedExP: Speeding Up Federated Averaging via Extrapolation","created":"2023-01-23","cited_by_count":69,"area":null},{"id":"2106.02969","title":"FedNL: Making Newton-Type Methods Applicable to Federated Learning","created":"2021-06-05","cited_by_count":52,"area":null},{"id":"2211.12461","title":"A Neural-Network-Based Convex Regularizer for Inverse Problems","created":"2022-11-22","cited_by_count":41,"area":null},{"id":"2305.16284","title":"DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method","created":"2023-05-25","cited_by_count":35,"area":null},{"id":"2102.07158","title":"Distributed Second Order Methods with Fast Rates and Compressed Communication","created":"2021-02-14","cited_by_count":25,"area":null},{"id":"2201.11066","title":"Server-Side Stepsizes and Sampling Without Replacement Provably Help in Federated Optimization","created":"2022-01-26","cited_by_count":23,"area":null},{"id":"2206.08829","title":"FedNew: A Communication-Efficient and Privacy-Preserving Newton-Type Method for Federated Learning","created":"2022-06-17","cited_by_count":23,"area":null},{"id":"2112.02089","title":"Regularized Newton Method with Global $O(1/k^2)$ Convergence","created":"2021-12-03","cited_by_count":22,"area":null},{"id":"2308.02261","title":"Adaptive Proximal Gradient Method for Convex Optimization","created":"2023-08-04","cited_by_count":21,"area":null},{"id":"2308.05621","title":"Normalized Gradients for All","created":"2023-08-10","cited_by_count":20,"area":null},{"id":"2301.04431","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient","created":"2023-01-11","cited_by_count":19,"area":null},{"id":"2310.10082","title":"A simple uniformly optimal method without line search for convex optimization","created":"2023-10-16","cited_by_count":18,"area":null},{"id":"2403.04081","title":"Directional Smoothness and Gradient Methods: Convergence and Adaptivity","created":"2024-03-06","cited_by_count":17,"area":null},{"id":"2109.05198","title":"Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Information","created":"2021-09-11","cited_by_count":16,"area":null},{"id":"2202.03618","title":"On Unbalanced Optimal Transport: Gradient Methods, Sparsity and Approximation Error","created":"2022-02-08","cited_by_count":16,"area":null},{"id":"2106.00322","title":"Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts","created":"2021-06-01","cited_by_count":14,"area":null},{"id":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2502.02870","title":"Uncertainty Quantification with the Empirical Neural Tangent Kernel","created":"2025-02-05","cited_by_count":11,"area":null},{"id":"2206.06900","title":"Grad-GradaGrad? A Non-Monotone Adaptive Stochastic Gradient Method","created":"2022-06-14","cited_by_count":9,"area":null},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-26","cited_by_count":8,"area":null},{"id":"2110.15148","title":"A first-order primal-dual method with adaptivity to local smoothness","created":"2021-10-28","cited_by_count":7,"area":null},{"id":"2208.05287","title":"Adaptive Learning Rates for Faster Stochastic Gradient Methods","created":"2022-08-10","cited_by_count":7,"area":null},{"id":"2306.11201","title":"Adaptive Federated Learning with Auto-Tuned Clients","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2307.06306","title":"Locally Adaptive Federated Learning","created":"2023-07-12","cited_by_count":7,"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":"2311.08615","title":"Non-Uniform Smoothness for Gradient Descent","created":"2023-11-15","cited_by_count":5,"area":null},{"id":"2410.05140","title":"Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis","created":"2024-10-07","cited_by_count":5,"area":null},{"id":"2502.02002","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","created":"2025-02-04","cited_by_count":5,"area":null},{"id":"2504.01898","title":"Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation","created":"2025-04-02","cited_by_count":5,"area":null},{"id":"2507.09823","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","created":"2025-07-13","cited_by_count":5,"area":null},{"id":"2402.06271","title":"Adaptive proximal gradient methods are universal without approximation","created":"2024-02-09","cited_by_count":4,"area":null},{"id":"2509.07972","title":"Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence","created":"2025-09-09","cited_by_count":4,"area":null},{"id":"2608.10418","title":"A lower bound for stepsize-based acceleration of gradient descent","created":"2026-08-11","cited_by_count":4,"area":null},{"id":"2405.20127","title":"SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2505.23081","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","created":"2025-05-29","cited_by_count":3,"area":null},{"id":"2303.17992","title":"A Second-Order Majorant Algorithm for Nonnegative Matrix Factorization","created":"2023-03-31","cited_by_count":2,"area":null},{"id":"2311.18431","title":"On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms","created":"2023-11-30","cited_by_count":2,"area":null},{"id":"2505.21651","title":"AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent","created":"2025-05-27","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":"2509.09802","title":"Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation","created":"2025-09-11","cited_by_count":2,"area":null},{"id":"2602.10697","title":"Fast and Large-Scale Unbalanced Optimal Transport via its Semi-Dual and Adaptive Gradient Methods","created":"2026-02-11","cited_by_count":2,"area":null},{"id":"2210.02672","title":"Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints","created":"2022-10-06","cited_by_count":1,"area":null},{"id":"2212.06379","title":"Self-adaptive algorithms for quasiconvex programming and applications to machine learning","created":"2022-12-13","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":"2405.04376","title":"Towards Stability of Parameter-Free Optimization","created":"2024-05-07","cited_by_count":1,"area":null},{"id":"2409.04244","title":"WarpAdam: A new Adam optimizer based on Meta-Learning approach","created":"2024-09-06","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":"2411.11224","title":"Don't Be So Positive: Negative Step Sizes in Second-Order Methods","created":"2024-11-18","cited_by_count":1,"area":null},{"id":"2502.03701","title":"First-ish Order Methods: Hessian-aware Scalings of Gradient Descent","created":"2025-02-06","cited_by_count":1,"area":null},{"id":"2504.05490","title":"Optimal Bayesian Affine Estimator and Active Learning for the Wiener Model","created":"2025-04-07","cited_by_count":1,"area":null},{"id":"2506.08419","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment","created":"2025-06-10","cited_by_count":1,"area":null},{"id":"2510.04988","title":"Adaptive Memory Momentum via a Model-Based Framework for Deep Learning Optimization","created":"2025-10-06","cited_by_count":1,"area":null},{"id":"2510.11440","title":"Adaptive Conditional Gradient Descent","created":"2025-10-13","cited_by_count":1,"area":null},{"id":"2601.20076","title":"Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes","created":"2026-01-27","cited_by_count":1,"area":null},{"id":"2602.04795","title":"Maximum-Volume Nonnegative Matrix Factorization","created":"2026-02-04","cited_by_count":1,"area":null},{"id":"2602.12471","title":"Tight Bounds for Logistic Regression with Large Stepsize Gradient Descent in Low Dimension","created":"2026-02-12","cited_by_count":1,"area":null},{"id":"2603.06369","title":"Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization","created":"2026-03-06","cited_by_count":1,"area":null},{"id":"2606.01827","title":"Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler","created":"2026-06-01","cited_by_count":1,"area":null},{"id":"2107.08377","title":"A New Adaptive Gradient Method with Gradient Decomposition","created":"2021-07-18","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":"2305.13664","title":"Layer-wise Adaptive Step-Sizes for Stochastic First-Order Methods for Deep Learning","created":"2023-05-23","cited_by_count":0,"area":null},{"id":"2402.06224","title":"Adaptive multi-gradient methods for quasiconvex vector optimization and applications to multi-task learning","created":"2024-02-09","cited_by_count":0,"area":null},{"id":"2404.09617","title":"Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices","created":"2024-04-15","cited_by_count":0,"area":null},{"id":"2409.13672","title":"Recent Advances in Non-convex Smoothness Conditions and Applicability to Deep Linear Neural Networks","created":"2024-09-20","cited_by_count":0,"area":null},{"id":"2412.20115","title":"Gradient Descent Methods for Regularized Optimization","created":"2024-12-28","cited_by_count":0,"area":null},{"id":"2507.04247","title":"Inertial Quadratic Majorization Minimization with Application to Kernel Regularized Learning","created":"2025-07-06","cited_by_count":0,"area":null},{"id":"2509.14969","title":"Stochastic Adaptive Gradient Descent Without Descent","created":"2025-09-18","cited_by_count":0,"area":null},{"id":"2510.09923","title":"AutoGD: Automatic Learning Rate Selection for Gradient Descent","created":"2025-10-10","cited_by_count":0,"area":null},{"id":"2511.18167","title":"Sparse Polyak with optimal thresholding operators for high-dimensional M-estimation","created":"2025-11-22","cited_by_count":0,"area":null},{"id":"2602.17545","title":"Adaptive Decentralized Composite Optimization via Three-Operator Splitting","created":"2026-02-19","cited_by_count":0,"area":null},{"id":"2602.18946","title":"Exponential Convergence of (Stochastic) Gradient Descent for Separable Logistic Regression","created":"2026-02-21","cited_by_count":0,"area":null},{"id":"2603.29128","title":"Adaptive Delayed-Update Cyclic Algorithm for Variational Inequalities","created":"2026-03-31","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":"2606.14970","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","created":"2026-06-12","cited_by_count":0,"area":null},{"id":"2607.04898","title":"3DMPE: 3D Multi-Perspective Embedding","created":"2026-07-06","cited_by_count":0,"area":null},{"id":"2607.22906","title":"Learning from the Descent Direction: Adaptive Gradient Descent under One-Sided H\\\"older Regularity","created":"2026-07-24","cited_by_count":0,"area":null},{"id":"2608.09022","title":"Provable Parameter-Free Fixed-Point Algorithms with Linear Convergence Rates","created":"2026-08-10","cited_by_count":0,"area":null}],"next_cursor":null}