AI Paper Atlas

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

Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs

Chung-Wei Lee, Haipeng Luo, Chen-Yu Wei, Mengxiao Zhang

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

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 changedWhereMeasuredEffect
Lift the decision set and use a normal barrier, modified sampling, and increasing learning ratesSCRiBLe for adversarial linear bandits · Adversarial linear banditshigh-probability regret: \otil\left(d^2\nu\sqrt{ T\ln\frac{1}{\delta}}+d^2\nu\ln\frac{1}{\delta}\right) against an oblivious adversary; \otil\lefImproved
Replace the prior MDP approach's regularizer with a log-barrier and add an increasing learning-rate scheduleOMD for adversarial MDPs · Adversarial MDPshigh-probability regret: \otil\left(|X|\sqrt{J|A| L^{\star}\ln \frac{1}{\delta}}+|X|^5 |A|^2\ln^2 \frac{1}{\delta}\right)Improved
Use the increasing-learning-rate approach to obtain small-loss guaranteesAdversarial MDP learning · Adversarial MDPshigh-probability regret: The new bound depends on L^{\star}; the prior bound is stated as \otil(J|X|\sqrt{|A|T})Improved

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