Parameter-free Regret in High Probability with Heavy Tails
원문 초록
We present new algorithms for online convex optimization over unbounded domains that obtain parameter-free regret in high-probability given access only to potentially heavy-tailed subgradient estimates. Previous work in unbounded domains considers only in-expectation results for sub-exponential subgradients. Unlike in the bounded domain case, we cannot rely on straight-forward martingale concentration due to exponentially large iterates produced by the algorithm. We develop new regularization techniques to overcome these problems. Overall, with probability at most $\delta$, for all comparators $\mathbf{u}$ our algorithm achieves regret $\tilde{O}(\| \mathbf{u} \| T^{1/\mathfrak{p}} \log (1/\delta))$ for subgradients with bounded $\mathfrak{p}^{th}$ moments for some $\mathfrak{p} \in (1, 2]$.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Scaling Laws of Dynamic High-Capacity Ride-Sharing
CUTS+: High-dimensional Causal Discovery from Irregular Time-series
CosmoPower-JAX: high-dimensional Bayesian inference with differentiable cosmological emulators
HumanRF: High-Fidelity Neural Radiance Fields for Humans in Motion
MIReAD: Simple Method for Learning High-quality Representations from Scientific Documents
High-Fidelity 3D Face Generation from Natural Language Descriptions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.