AINewsnow

Lower Bounds for Linear-Oracle Online Learning

This story is from 2026-10-01. It is preserved in the archive; the latest stories are on the live feed.

arXiv:2609.38375v1 Announce Type: new Abstract: Can a constant number of linear minimizations per round improve on the $T^{3/4}$ regret rate of online Frank-Wolfe on general convex sets? Weibel et al. conjectured that fixed-coefficient methods cannot. We prove their conjecture and extend the lower…

Read the full story at arXiv stat.ML ↗

Timeline · 1 report

  1. 2026-10-01 04:00 · arXiv stat.ML
    Lower Bounds for Linear-Oracle Online Learning

More stories

  1. Jensen Huang resigns as Nvidia CEO amid calls for reinstatement and possible comeback — Hard Fork (NYT)
  2. Researchers allege Chinese AI models were trained on export-banned Nvidia Blackwell chips — Bloomberg AI
  3. Anthropic IPO oversubscribed nearly six times; can AI firm become new NVIDIA amid stock crash? Experts' views — Mint AI
  4. Apple to unveil Siri AI smart glasses at WWDC, with Face ID coming to iPhone Duo 2 — Tom's Guide AI
  5. A step toward defining the Standard Model on a lattice — OpenAI News
  6. Bharat Semi raises $24M seed round to bring AI image sensors to market — TechCrunch AI
  7. Grounded flights, Microsoft outage and AI turmoil fuel fears of wider tech breakdown — Washington Post AI
  8. Earnings Calls Point to AI-Led Growth and Stronger Margins — The Globe and Mail

Get the daily brief of stories like this at 6:30 every morning →