Know a great AI tool or AI news source? Submit it to AiByts
2 min read

Minimax-Optimal Small-Loss Bounds for Online Linear Optimisation on $\ell_p$ Balls

We study full-information online linear optimisation on the unit $\ell_p$ ball in $\mathbb{R}^d$, for fixed $2\le p<\infty$ and losses of dual norm at most one. Let $\Delta_T$ denote the cumulative loss of the best fixed action above each round's minimum.

By Jack J. MayoarXiv cs.LG

Read the full story

Originally published by arXiv cs.LG on Oct 28, 2026.

Read on arXiv cs.LG(opens in a new tab)

Comments

Sign in to join the discussion.

No comments yet — be the first to share your thoughts.