atlas

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

Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning

NeurIPS 2021 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Practical contextual bandit extensions · 4 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 IS-weighted ERM instead of unweighted ERMLinear regression and LASSO on contextual-bandit-collected data · 51 OpenML-CC18 datasetsmean-squared errorHelped
Use different weighting schemes instead of ISWERMCART regression on contextual-bandit-collected data · 51 OpenML-CC18 datasetsmean-squared errorNo clear effect
Apply an IS-structure-aware maximal inequality rather than a generic inequality for weighted sequential processesIS-weighted ERM with adaptively collected data · Adaptive data with decaying explorationexcess-risk convergence rate: O((γ^avg_T/T)^{1/p∧1/2})Helped
Use ISWERM for policy learning under epsilon-greedy exploration with ε_t=t^{-β}Policy learning · Contextual-bandit-collected dataexpected regret: O(T^{-(1-β)/2})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