Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets
math.OC, cs.LG
Submitted: 2026-10-09
Updated: 2026-10-09
Sources
- An information diffusion Fano inequality
- Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
- Lower Bounds for Frank-Wolfe on Strongly Convex Sets
- A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets
- The Complexity of Large-scale Convex Programming under a Linear Optimization Oracle
- Frank-Wolfe Beyond 1/t Convergence
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Second-Order Optimization with Asynchronous Curvature
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability