Selective inference for false discovery proportion in a hidden Markov model
-
-
[1] University of Paris-Saclay
University of Paris-Saclay
Arrondissement de Palaiseau, Francia
-
[2] Université de Toulouse
Université de Toulouse
Arrondissement de Toulouse, Francia
-
[3] Université de Paris
-
[4] Sorbonne Université, Université de Paris
-
- Localización: Test: An Official Journal of the Spanish Society of Statistics and Operations Research, ISSN-e 1863-8260, ISSN 1133-0686, Vol. 32, Nº. 4, 2023, págs. 1365-1391
- Idioma: inglés
- Texto completo no disponible (Saber más ...)
-
Resumen
We address the multiple testing problem under the assumption that the true/false hypotheses are driven by a hidden Markov model (HMM), which is recognized as a fundamental setting to model multiple testing under dependence since the seminal work of Sun and Cai (J R Stat Soc Ser B (Stat Methodol) 71:393–424, 2009). While previous work has concentrated on deriving specific procedures with a controlled false discovery rate under this model, following a recent trend in selective inference, we consider the problem of establishing confidence bounds on the false discovery proportion, for a user-selected set of hypotheses that can depend on the observed data in an arbitrary way. We develop a methodology to construct such confidence bounds first when the HMM model is known, then when its parameters are unknown and estimated, including the data distribution under the null and the alternative, using a nonparametric approach. In the latter case, we propose a bootstrap-based methodology to take into account the effect of parameter estimation error. We show that taking advantage of the assumed HMM structure allows for a substantial improvement of confidence bound sharpness over existing agnostic (structure-free) methods, as witnessed both via numerical experiments and real data examples.
