atlas

Research map / Bandits and online learning / Contextual bandits and Thompson sampling

Smoothed Adversarial Linear Contextual Bandits with Knapsacks

ICML 2022 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits

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
Replace UCB exploration with greedy (exploration-free) parameter estimation under smoothed contexts (Gaussian perturbation)stochastic LinCBwK · smoothed stochastic LinCBwKadditive regret vs. best context-dependent fixed policyHelped
Greedy primal-dual algorithm with doubling-trick estimation of tradeoff parameter Z under smoothed adaptive adversarial contextsadversarial LinCBwK · smoothed adversarial LinCBwKcompetitive ratioHelped
Smoothed contexts (Gaussian perturbation) reduce the budget requirement for stochastic LinCBwK from Omega(m T^{3/4}) to Omega(m^{2/3} T^{3/4})stochastic LinCBwK · theory comparisonbudget requirementHelped
Smoothed adversarial setting relaxes the budget requirement to Omega(T^{3/4}) compared with the K T^{7/4}/B condition of adversarial BwKadversarial LinCBwK · theory comparisonbudget requirementHelped

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