Skip to content
Research

Parameter-Free Dynamic Regret under Heavy-Tailed Noise.

arXiv:2607.27073v3 Announce Type: replace-cross Abstract: We study online convex optimization with one unbiased stochastic subgradient per round and noise having a finite $p$-th central moment, where $p\in(1,2]$ is unknown. For a bounded convex domain of diame

arXiv cs.AIResearch source·