Research map / Bandits and online learning / Online convex optimization and games
Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers
Jeffrey Negrea, Blair Bilodeau, Nicolò Campolongo, Francesco Orabona, Daniel M. Roy
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the root-logarithmic regularizer instead of Hedge's Shannon-entropy regularizer | FTRL for KL regret · KL regret with arbitrary priors | regret bound dependence on comparator KL: 2 \sqrt{(T+1)(1 + \KL{q}{\nu})} + \sqrt{8T} | Improved |
| Use the root-logarithmic regularizer with a uniform prior | abNormal · Quantile regret (N experts) | regret rate: \sqrt{T\log(1/\epsilon)} | Improved |
| Use CARL's expert-specific effective regularization through the -H_C regularizer | FTRL-CARL · Semi-adversarial regret, N_{0}>1 | expected regret upper bound: \sqrt{2T\logN_{0}} + 25\frac{\logN}{\Delta_{0}} | Improved |
| Use FTRL-CARL instead of FTRL-CARE | Semi-adversarial learning with expert advice · Semi-adversarial regret at small T | expected regret upper bound: \sqrt{2T\logN} | Improved |
Closest papers by meaning
- Looking Through the Mirror: Minimax-Optimal Regularized Regrets in Online Learning and Bandits (NeurIPS 2026 · similarity 0.93)
- Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness (NeurIPS 2022 · similarity 0.92)
- Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits (NeurIPS 2020 · similarity 0.90)
- From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model (NeurIPS 2026 · similarity 0.90)
- Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits (NeurIPS 2021 · similarity 0.90)
- Near-Optimal Regret in Adversarial Kernel Bandits (NeurIPS 2026 · similarity 0.89)
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.
