pith. sign in

arxiv: 2401.03756 · v4 · pith:VAFDMNALnew · submitted 2024-01-08 · 💻 cs.LG · cs.AI· econ.EM· stat.ME· stat.ML

Adaptive Experimental Design for Policy Learning

classification 💻 cs.LG cs.AIecon.EMstat.MEstat.ML
keywords bestpolicytreatmentadaptiveboundexpectedexperimentexperimental
0
0 comments X
read the original abstract

This study investigates the contextual best arm identification (BAI) problem, aiming to design an adaptive experiment to identify the best treatment arm conditioned on contextual information (covariates). We consider a decision-maker who assigns treatment arms to experimental units during an experiment and recommends the estimated best treatment arm based on the contexts at the end of the experiment. The decision-maker uses a policy for recommendations, which is a function that provides the estimated best treatment arm given the contexts. In our evaluation, we focus on the worst-case expected regret, a relative measure between the expected outcomes of an optimal policy and our proposed policy. We derive a lower bound for the expected simple regret and then propose a strategy called Adaptive Sampling-Policy Learning (PLAS). We prove that this strategy is minimax rate-optimal in the sense that its leading factor in the regret upper bound matches the lower bound as the number of experimental units increases.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Active Context Selection Improves Simple Regret in Contextual Bandits

    cs.LG 2026-05 accept novelty 7.0

    Active sampling with allocation q_j proportional to p_j to the 2/3 achieves tight regret sqrt(n/T) times norm of p to the 2/3 for known context distribution p, with improvement up to Theta(k to the 1/4) over passive sampling.