arXiv (All)
open access
An $Ω(T^{3/4})$ lower bound for projection-free online learning with linear minimization oracles
This work considers projection-free online learning algorithms with linear minimization oracles for handling the decision set. For Online Frank--Wolfe (OFW), regret upper bounds were already known for specific OFW tunings [Hazan and Kale, 2012, Hazan, 2016] which scaled as $T^{3/4}$ (where $T$ is th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Lower Bounds for Linear-Oracle Online Learning#1142976
- On $C^k$ convex variants of Stein's Weighted $L^2$ Conjecture for Bochner-Riesz means#1063256
- A Hierarchical Online-Compression Approach to Proportional Subsets of Bounded Orthonormal Systems#1490095
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
- Online Learning of Whittle Indices for Restless Bandits with Non-Stationary Transition Kernels#155596
Record · ID 1488637
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive