Aggregation of Multiple Knockoffs - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Aggregation of Multiple Knockoffs


We develop an extension of the knockoff inference procedure, introduced by Barber and Candès [2015]. This new method, called ag-gregation of multiple knockoffs (AKO), addresses the instability inherent to the random nature of knockoff-based inference. Specifically, AKO improves both the stability and power compared with the original knockoff algorithm while still maintaining guarantees for false discovery rate control. We provide a new inference procedure, prove its core properties , and demonstrate its benefits in a set of experiments on synthetic and real datasets.
Fichier principal
Vignette du fichier
ako.pdf (6.03 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02888693 , version 1 (03-07-2020)


  • HAL Id : hal-02888693 , version 1


Tuan-Binh Nguyen, Jérôme-Alexis Chevalier, Bertrand Thirion, Sylvain Arlot. Aggregation of Multiple Knockoffs. ICML 2020 - 37th International Conference on Machine Learning, Jul 2020, Vienne / Virtual, Austria. ⟨hal-02888693⟩
120 View
57 Download


Gmail Facebook X LinkedIn More