自适应采样的好处与成本
Benefits and Costs of Adaptive Sampling
AI总结:
研究自适应采样在提高估计精度方面的优势与成本,提出SARP和NARP政策,在有限样本下实现最优渐近率。
摘要:
多臂老虎机被广泛用于临床试验、推荐系统和在线平台的序列实验。尽管后悔最小化和从自适应收集数据中进行有效推断已被广泛研究,但一个基本问题仍然存在:适应性何时能相对于均匀设计提高估计精度,以及如何在推断和实验的在线成本之间进行平衡?我们首先研究在均方误差(MSE)目标下的臂级均值估计。我们刻画了自适应奈曼分配在样本分配依据臂方差时,是否在均方误差上优于均匀抽样。当臂之间存在方差异质性时,这些改进在较小的样本量下出现,澄清了适应性不仅在渐近情况下,而且在许多实际有限样本设置中也更优。我们随后研究了一个联合推断-后悔目标,该目标考虑了在实验过程中将单位分配给劣质臂的成本。我们提出了静态分配率策略(SARP)和奈曼自适应率策略(NARP),通过调整探索来适应实例的局部结构,从而在推断和后悔导向的策略之间进行插值。我们证明了SARP和NARP在样本预算增长时能够以最优速率收敛到完全信息基准。我们提出的方法在实践中具有吸引力,因为它可以线性插值任何标准的后悔最小化算法和推断导向的自适应策略之间。然而,我们证明它仍然享有基于Oracle的渐近最优速率。模拟支持理论,通过在控制性能损失范围内证明了相对于均匀分配的精度提升。
英文摘要:
Multi-armed bandits are widely used for sequential experimentation in clinical trials, public policy treatment, recommendation systems, and online platforms. While regret minimization and valid inference from adaptively collected data have each been studied individually, one question remains: when does adaptivity \emph{improve estimation precision} relative to uniform designs, and how should inference be balanced against the online cost of experimentation? We first study arm-level mean estimation under mean-squared-error (MSE) objectives. We characterize when an adaptive Neyman allocation, which allocates samples according to arm variance, yields strict MSE improvements over uniform sampling in finite samples. When there is variance heterogeneity across arms, these improvements arise at modest sample sizes, clarifying that adaptivity can be preferable for inference not only asymptotically, but also in finite-sample settings. We then study a joint inference--regret objective that accounts for the cost of assigning units to inferior arms during experimentation. We propose three policies: the Plug-in Oracle Rate Policy, Static-Allocation Rate Policy, and Neyman-Adaptive Rate Policy, all of which attain the oracle-optimal asymptotic rate. The latter two offer computationally efficient and easy-to-implement alternatives by combining existing regret-minimizing algorithms with inference-oriented sampling through closed-form mixing rules, avoiding repeated numerical optimization while being managerially interpretable. We compare their finite-sample statistical performance through simulations and empirically calibrated applications. The results highlight the relative strengths of our policies across instances and their tradeoffs between joint inference--regret performance and computational cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。