atlas

Research map / Bandits and online learning / Online convex optimization and games

Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance

ICML 2020 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use self-concordance instead of truncating predicted probabilitiesSequential probability assignment under log loss · Expert classes with sequential entropy Θ(γ^-p)minimax regret: O(n^{\frac{p}{p+1}})Helped
Use the general entropy-based bound for infinite-dimensional linear predictorsSequential probability assignment under log loss · Infinite-dimensional linear predictors on the Hilbert unit ballminimax regret: \tilde\cO(n^{2/3}) versus \tilde\cO(n^{1/2})Mixed
Use a single-scale discretization rather than multiple-scale chainingThe proposed minimax-regret analysis · Rich expert classes under log lossminimax regret: O(n^{\frac{p}{p+1}})Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy