AI Paper Atlas

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

Online Balanced Experimental Design

David Arbour, Drew Dimmery, Tung Mai, Anup Rao

ICML 2022 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms · 1 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
Use Balancing Walk Design instead of complete randomizationOnline binary-treatment experiments · Linear and near-linear DGPsMSEImproved
Use Balancing Walk Design instead of complete randomizationOnline binary-treatment experiments · Nonlinear DGPsMSEMixed
Use Balancing Walk Design for sequential assignmentOnline binary-treatment experiments · LinearDriftDGP and LinearSeasonDGPMSEImproved
Use Balancing Walk Design instead of existing online assignment methodsOnline multi-treatment experiments · Multiple TreatmentsMISEImproved
Use Balancing Walk Design instead of the biased coin designOnline binary-treatment experiments · Binary TreatmentsLinear imbalanceImproved
Use Balancing Walk DesignOnline binary-treatment experiments · Non-uniform assignmentMSEMixed
Use Balancing Walk Design for multiple treatmentsOnline multi-treatment experiments · Multiple TreatmentsNormalized entropyImproved

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