An $\Omega(T^{3/4})$ lower bound for projection-free online learning with linear minimization oracles
arXiv:2610.37845v1 Announce Type: new Abstract: 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,…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-10-30 04:00 · arXiv stat.ML
An $\Omega(T^{3/4})$ lower bound for projection-free online learning with linear minimization oracles
More stories
- 8 examples of Gemini 4 Argon in action — Google Gemini Blog
- Welcome Le Chonk: Mistral Large 4 on Hugging Face — Hugging Face Blog
- How a wave of startups are betting on AI to make formal software verification practical and essential, including &Truth, which launches with a $70M seed — Techmeme
- Meta quietly launches an AI fashion app called Style Sketch — TechCrunch AI
- You can now generate, preview, and edit documents, PDFs, presentations, spreadsheets, and more directly in Gemini. — Google Gemini Blog
- ChatGPT Enterprise at Zendesk: Putting Company Data to Work — OpenAI YouTube
- Grey-Market Relay Turns Off Codex and Claude Code Sandboxes — DailyAI
- Here is my submission for ComfyUI’s Open Source Higgsfield challenge: Openjutsu, one-click character swap for videos, fully local using Minimax H3 only — r/StableDiffusion
Get the daily brief of stories like this at 6:30 every morning →