Luedtke Alex, Carone Marco, Simon Noah, Sofrygin Oleg
Department of Statistics, University of Washington, Box 354322, Seattle, WA 98195, USA.
Vaccine and Infectious Disease Division, Fred Hutchinson Cancer Research Center, 1100 Fairview Ave. N., Mail Stop E5-110, Seattle, WA 98109, USA.
Sci Adv. 2020 Feb 26;6(9):eaaw2140. doi: 10.1126/sciadv.aaw2140. eCollection 2020 Feb.
Traditionally, statistical procedures have been derived via analytic calculations whose validity often relies on sample size growing to infinity. We use tools from deep learning to develop a new approach, adversarial Monte Carlo meta-learning, for constructing optimal statistical procedures. Statistical problems are framed as two-player games in which Nature adversarially selects a distribution that makes it difficult for a statistician to answer the scientific question using data drawn from this distribution. The players' strategies are parameterized via neural networks, and optimal play is learned by modifying the network weights over many repetitions of the game. Given sufficient computing time, the statistician's strategy is (nearly) optimal at the finite observed sample size, rather than in the hypothetical scenario where sample size grows to infinity. In numerical experiments and data examples, this approach performs favorably compared to standard practice in point estimation, individual-level predictions, and interval estimation.
传统上,统计程序是通过解析计算得出的,其有效性通常依赖于样本量增长到无穷大。我们使用深度学习工具开发了一种新方法——对抗蒙特卡洛元学习,用于构建最优统计程序。统计问题被构建为两人博弈,其中自然以对抗方式选择一种分布,使得统计学家难以使用从此分布中抽取的数据回答科学问题。参与者的策略通过神经网络进行参数化,并且通过在多次重复博弈中修改网络权重来学习最优玩法。在给定足够计算时间的情况下,统计学家的策略在有限的观察样本量下(近乎)最优,而非在样本量增长到无穷大的假设情形下。在数值实验和数据示例中,与点估计、个体水平预测和区间估计中的标准做法相比,这种方法表现良好。