arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.04570cs.LG
收藏

优化驱动的自适应实验

Optimization-Driven Adaptive Experimentation

Columbia University(哥伦比亚大学);Meta;University of Pittsburgh(匹兹堡大学)

Ethan Che, Daniel R. Jiang, Hongseok Namkoong, Jimmy Wang

AI总结:

针对现实实验中的批处理延迟反馈、非平稳性、多目标约束及个性化挑战,提出基于中心极限近似动态规划的数学规划框架,利用自动微分和GPU并行化,在数百个实例上优于静态随机对照试验,性能稳健。

摘要:

现实世界的实验涉及批处理与延迟反馈、非平稳性、多目标与约束,以及(通常部分)个性化。针对每个问题定制自适应方法以应对这些挑战是不可行的,静态设计仍是事实上的标准。聚焦于短周期(≤10)自适应实验,我们摒弃了定制算法,提出了一种数学规划公式,可灵活纳入广泛的目标、约束和统计程序。我们基于中心极限近似构建动态规划,从而能够利用基于自动微分和GPU并行化的可扩展优化方法。为评估我们的框架,我们实现了一种简单的启发式规划方法(“求解器”),并在涉及非平稳性、个性化和多目标与约束的数百个问题实例上进行基准测试。与定制方法(如汤普森采样变体)不同,我们的数学规划框架在静态随机对照试验上提供了一致的改进,并在各问题实例中展现出稳健的性能。

英文摘要:

Real-world experiments involve batched & delayed feedback, non-stationarity, multiple objectives & constraints, and (often some) personalization. Tailoring adaptive methods to address these challenges on a per-problem basis is infeasible, and static designs remain the de facto standard. Focusing on short-horizon ($\le 10$) adaptive experiments, we move away from bespoke algorithms and present a mathematical programming formulation that can flexibly incorporate a wide range of objectives, constraints, and statistical procedures. We formulating a dynamic program based on central limit approximations, which enables the use of scalable optimization methods based on auto-differentiation and GPU parallelization. To evaluate our framework, we implement a simple heuristic planning method ("solver") and benchmark it across hundreds of problem instances involving non-stationarity, personalization, and multiple objectives & constraints. Unlike bespoke methods (e.g., Thompson sampling variants), our mathematical programming framework provides consistent gains over static randomized control trials and exhibits robust performance across problem instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑