Dynamic Algorithms for Online Multiple Testing

10/26/2020 ∙ by Ziyu Xu, et al. ∙ 0

We demonstrate new algorithms for online multiple testing that provably control false discovery exceedance (FDX) while achieving orders of magnitude more power than previous methods. This statistical advance is enabled by the development of new algorithmic ideas: earlier algorithms are more "static" while our new ones allow for the dynamical adjustment of testing levels based on the amount of wealth the algorithm has accumulated. We also prove relationships between controlling FDR, FDX, and other error metrics for our new algorithm, SupLORD, and how controlling one metric can simultaneously control all error metrics. We demonstrate that our algorithms achieve higher power in a variety of synthetic experiments.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.