Research map / Bandits and online learning / Online convex optimization and games
Parameter-free Regret in High Probability with Heavy Tails
Jiujia Zhang, Ashok Cutkosky
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Safe Online Convex Optimization with Heavy-Tailed Observation Noises (AAAI 2025 · similarity 0.91)
- Online Convex Optimization with Unconstrained Domains and Losses (NeurIPS 2016 · similarity 0.91)
- Dynamic Regret Reduces to Kernelized Static Regret (NeurIPS 2025 · similarity 0.90)
- Small-loss Adaptive Regret for Online Convex Optimization (ICML 2024 · similarity 0.90)
- An Equivalence Between Static and Dynamic Regret Minimization (NeurIPS 2024 · similarity 0.89)
- Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points (NeurIPS 2026 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
