How Free is Parameter-Free Stochastic Optimization?
Fuente:
arXiv
Saved in:
| Main Authors: | Attia, Amit, Koren, Tomer |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning Rate Annealing Improves Tuning Robustness in Stochastic Optimization
by: Attia, Amit, et al.
Published: (2025)
by: Attia, Amit, et al.
Published: (2025)
Towards Fully Parameter-Free Stochastic Optimization: Grid Search with Self-Bounding Analysis
by: Zhao, Yuheng, et al.
Published: (2026)
by: Zhao, Yuheng, et al.
Published: (2026)
Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching
by: Attia, Amit, et al.
Published: (2024)
by: Attia, Amit, et al.
Published: (2024)
Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime
by: Attia, Amit, et al.
Published: (2025)
by: Attia, Amit, et al.
Published: (2025)
Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
by: Vansover-Hager, Shira, et al.
Published: (2025)
by: Vansover-Hager, Shira, et al.
Published: (2025)
Accelerated Parameter-Free Stochastic Optimization
by: Kreisler, Itai, et al.
Published: (2024)
by: Kreisler, Itai, et al.
Published: (2024)
The Sample Complexity of Parameter-Free Stochastic Convex Optimization
by: Lawrence, Jared, et al.
Published: (2025)
by: Lawrence, Jared, et al.
Published: (2025)
Tuning-Free Stochastic Optimization
by: Khaled, Ahmed, et al.
Published: (2024)
by: Khaled, Ahmed, et al.
Published: (2024)
Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
by: Sherman, Uri, et al.
Published: (2025)
by: Sherman, Uri, et al.
Published: (2025)
Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
by: Sherman, Uri, et al.
Published: (2025)
by: Sherman, Uri, et al.
Published: (2025)
Problem-Parameter-Free Decentralized Bilevel Optimization
by: Zhai, Zhiwei, et al.
Published: (2025)
by: Zhai, Zhiwei, et al.
Published: (2025)
Sign-SGD via Parameter-Free Optimization
by: Medyakov, Daniil, et al.
Published: (2025)
by: Medyakov, Daniil, et al.
Published: (2025)
Learning-Rate-Free Stochastic Optimization over Riemannian Manifolds
by: Dodd, Daniel, et al.
Published: (2024)
by: Dodd, Daniel, et al.
Published: (2024)
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
by: Chen, Lesi, et al.
Published: (2023)
by: Chen, Lesi, et al.
Published: (2023)
Making SGD Parameter-Free
by: Carmon, Yair, et al.
Published: (2022)
by: Carmon, Yair, et al.
Published: (2022)
Interpreting Adaptive Gradient Methods by Parameter Scaling for Learning-Rate-Free Optimization
by: Suh, Min-Kook, et al.
Published: (2024)
by: Suh, Min-Kook, et al.
Published: (2024)
Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
by: Jiang, Wei, et al.
Published: (2024)
by: Jiang, Wei, et al.
Published: (2024)
Towards Simple and Provable Parameter-Free Adaptive Gradient Methods
by: Tao, Yuanzhe, et al.
Published: (2024)
by: Tao, Yuanzhe, et al.
Published: (2024)
Gradient-Free Approaches is a Key to an Efficient Interaction with Markovian Stochasticity
by: Prokhorov, Boris, et al.
Published: (2026)
by: Prokhorov, Boris, et al.
Published: (2026)
Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
by: Park, Sungwoo, et al.
Published: (2024)
by: Park, Sungwoo, et al.
Published: (2024)
Completely Parameter-Free Single-Loop Algorithms for Nonconvex-Concave Minimax Problems
by: Yang, Junnan, et al.
Published: (2024)
by: Yang, Junnan, et al.
Published: (2024)
DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method
by: Khaled, Ahmed, et al.
Published: (2023)
by: Khaled, Ahmed, et al.
Published: (2023)
Parameter-Free Non-Ergodic Extragradient Algorithms for Solving Monotone Variational Inequalities
by: Shen, Lingqing, et al.
Published: (2026)
by: Shen, Lingqing, et al.
Published: (2026)
Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization
by: Yuan, Ganzhao
Published: (2026)
by: Yuan, Ganzhao
Published: (2026)
Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization
by: Reifenstein, Sam, et al.
Published: (2024)
by: Reifenstein, Sam, et al.
Published: (2024)
Random Gradient-Free Optimization in Infinite Dimensional Spaces
by: Peixoto, Caio Lins, et al.
Published: (2025)
by: Peixoto, Caio Lins, et al.
Published: (2025)
Optimal Projection-Free Adaptive SGD for Matrix Optimization
by: Kovalev, Dmitry
Published: (2026)
by: Kovalev, Dmitry
Published: (2026)
Prodigy: An Expeditiously Adaptive Parameter-Free Learner
by: Mishchenko, Konstantin, et al.
Published: (2023)
by: Mishchenko, Konstantin, et al.
Published: (2023)
Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)
by: Garber, Dan, et al.
Published: (2024)
Model-Free $μ$-Synthesis: A Nonsmooth Optimization Perspective
by: Keivan, Darioush, et al.
Published: (2024)
by: Keivan, Darioush, et al.
Published: (2024)
Optimal Hessian/Jacobian-Free Nonconvex-PL Bilevel Optimization
by: Huang, Feihu
Published: (2024)
by: Huang, Feihu
Published: (2024)
Retraction-Free Decentralized Non-convex Optimization with Orthogonal Constraints
by: Sun, Youbang, et al.
Published: (2024)
by: Sun, Youbang, et al.
Published: (2024)
A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\tilde{\mkern1mu O}(ε^{-5/3})$ Global Rate
by: Xiong, Sichao, et al.
Published: (2026)
by: Xiong, Sichao, et al.
Published: (2026)
Projection-Free Functional Constrained Optimization for Risk Aversion and Sparsity Control
by: Cheng, Yi, et al.
Published: (2022)
by: Cheng, Yi, et al.
Published: (2022)
Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs
by: Zhang, Junkai, et al.
Published: (2023)
by: Zhang, Junkai, et al.
Published: (2023)
Private Online Learning via Lazy Algorithms
by: Asi, Hilal, et al.
Published: (2024)
by: Asi, Hilal, et al.
Published: (2024)
Parameter Symmetry and Noise Equilibrium of Stochastic Gradient Descent
by: Ziyin, Liu, et al.
Published: (2024)
by: Ziyin, Liu, et al.
Published: (2024)
Parameter-free Algorithms for the Stochastically Extended Adversarial Model
by: Wang, Shuche, et al.
Published: (2025)
by: Wang, Shuche, et al.
Published: (2025)
Stochastic-Constrained Stochastic Optimization with Markovian Data
by: Kim, Yeongjong, et al.
Published: (2023)
by: Kim, Yeongjong, et al.
Published: (2023)
Private Stochastic Optimization With Large Worst-Case Lipschitz Parameter
by: Lowy, Andrew, et al.
Published: (2022)
by: Lowy, Andrew, et al.
Published: (2022)
Similar Items
-
Learning Rate Annealing Improves Tuning Robustness in Stochastic Optimization
by: Attia, Amit, et al.
Published: (2025) -
Towards Fully Parameter-Free Stochastic Optimization: Grid Search with Self-Bounding Analysis
by: Zhao, Yuheng, et al.
Published: (2026) -
Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching
by: Attia, Amit, et al.
Published: (2024) -
Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime
by: Attia, Amit, et al.
Published: (2025) -
Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
by: Vansover-Hager, Shira, et al.
Published: (2025)