Parameter-free interval-dynamic regret under heavy-tailed noise in online convex optimization
Read the original at arxiv.org→arXiv:2610.02258v1 Announce Type: new Abstract: We study online convex optimization with one unbiased stochastic subgradient per round and an unknown finite conditional $p$th noise moment, $1<p\le2$. For every fixed...
Original headline: "Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise"
Coverage timeline
- Oct 5, 04:00 UTC arXiv cs.LG lead source Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise