Asymptotic minimaxity of false discovery rate thresholding for sparse exponential data

From MaRDI portal
Publication:2373587

DOI10.1214/009053606000000920zbMATH Open1114.62010arXivmath/0602311OpenAlexW3105074488WikidataQ29308446 ScholiaQ29308446MaRDI QIDQ2373587FDOQ2373587


Authors: David Donoho, Jiashun Jin Edit this on Wikidata


Publication date: 12 July 2007

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: We apply FDR thresholding to a non-Gaussian vector whose coordinates X_i, i=1,..., n, are independent exponential with individual means mui. The vector mu=(mui) is thought to be sparse, with most coordinates 1 but a small fraction significantly larger than 1; roughly, most coordinates are simply `noise,' but a small fraction contain `signal.' We measure risk by per-coordinate mean-squared error in recovering log(mui), and study minimax estimation over parameter spaces defined by constraints on the per-coordinate p-norm of log(mui): frac1nsumi=1nlogp(mui)leqetap. We show for large n and small eta that FDR thresholding can be nearly Minimax. The FDR control parameter 0<q<1 plays an important role: when qleq1/2, the FDR estimator is nearly minimax, while choosing a fixed q>1/2 prevents near minimaxity. These conclusions mirror those found in the Gaussian case in Abramovich et al. [Ann. Statist. 34 (2006) 584--653]. The techniques developed here seem applicable to a wide range of other distributional assumptions, other loss measures and non-i.i.d. dependency structures.


Full work available at URL: https://arxiv.org/abs/math/0602311




Recommendations




Cites Work


Cited In (16)





This page was built for publication: Asymptotic minimaxity of false discovery rate thresholding for sparse exponential data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373587)