On false discovery rate thresholding for classification under sparsity
From MaRDI portal
Abstract: We study the properties of false discovery rate (FDR) thresholding, viewed as a classification procedure. The "0"-class (null) is assumed to have a known density while the "1"-class (alternative) is obtained from the "0"-class either by translation or by scaling. Furthermore, the "1"-class is assumed to have a small number of elements w.r.t. the "0"-class (sparsity). We focus on densities of the Subbotin family, including Gaussian and Laplace models. Nonasymptotic oracle inequalities are derived for the excess risk of FDR thresholding. These inequalities lead to explicit rates of convergence of the excess risk to zero, as the number m of items to be classified tends to infinity and in a regime where the power of the Bayes rule is away from 0 and 1. Moreover, these theoretical investigations suggest an explicit choice for the target level of FDR thresholding, as a function of m. Our oracle inequalities show theoretically that the resulting FDR thresholding adapts to the unknown sparsity regime contained in the data. This property is illustrated with numerical experiments.
Recommendations
- Asymptotic minimaxity of false discovery rate thresholding for sparse exponential data
- Adapting to unknown sparsity by controlling the false discovery rate
- Learning false discovery rates by fitting sigmoidal threshold functions
- Adaptive threshold-based classification of sparse high-dimensional data
- False Discovery and its Control in Low Rank Estimation
- The false discovery rate for statistical pattern recognition
- Binary Credal Classification Under Sparsity Constraints
- Sparse linear discriminant analysis by thresholding for high dimensional data
- False discovery rate control via debiased Lasso
- Estimating the false discovery rate using the stochastic approximation algorithm
Cites work
- scientific article; zbMATH DE number 5604036 (Why is no real title available?)
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- A Direct Approach to False Discovery Rates
- A general decision theoretic formulation of procedures controlling FDR and FNR from a Bayesian perspective
- A generalized step-up-down multiple test procedure
- A stochastic process approach to false discovery control.
- Adapting to unknown sparsity by controlling the false discovery rate
- Adaptive false discovery rate control under independence and dependence
- Adaptive linear step-up procedures that control the false discovery rate
- An adaptive step-down procedure with proven FDR control under independence
- Asymptotic Bayes-optimality under sparsity of some multiple testing procedures
- Asymptotic minimaxity of false discovery rate thresholding for sparse exponential data
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Empirical Bayes Analysis of a Microarray Experiment
- Exact calculations for false discovery proportion with application to least favorable configura\-tions
- Higher criticism for detecting sparse heterogeneous mixtures.
- Microarrays, empirical Bayes and the two-groups model
- Multiple hypotheses testing and expected number of type I errors
- On false discovery rate thresholding for classification under sparsity
- On methods controlling the false discovery rate
- On the Benjamini-Hochberg method
- On the false discovery rate and an asymptotically optimal rejection curve
- On the performance of FDR control: constraints and a partial solution
- Operating Characteristics and Extensions of the False Discovery Rate Procedure
- Semi-supervised novelty detection
- Some remarks on Simes-type multiple tests of significance.
- Some results on false discovery rate in stepwise multiple testing procedures.
- The positive false discovery rate: A Bayesian interpretation and the \(q\)-value
- Type I error rate control for testing many hypotheses: a survey with proofs
Cited in
(19)- Variable selection with Hamming loss
- Rate of convergence of a risk estimator to the normal law in a multiple hypothesis testing problem using the FDR threshold
- On false discovery rate thresholding for classification under sparsity
- Optimal classification in sparse Gaussian graphic model
- Some optimality properties of FDR controlling rules under sparsity
- Group SLOPE – Adaptive Selection of Groups of Predictors
- On the power of some sequential multiple testing procedures
- Inferring the finest pattern of mutual independence from data
- Binary classification with pFDR-pFNR losses
- Asymptotically optimal sequential FDR and pFDR control with (or without) prior information on the number of signals
- Feature selection by higher criticism thresholding achieves the optimal phase diagram
- Asymptotic minimaxity of false discovery rate thresholding for sparse exponential data
- The Indian official statistical system revisited
- Adapting to unknown sparsity by controlling the false discovery rate
- New procedures controlling the false discovery proportion via Romano-Wolf's heuristic
- On spike and slab empirical Bayes multiple testing
- Sharp multiple testing boundary for sparse sequences
- On the asymptotic properties of SLOPE
- Bayes multiple decision functions
This page was built for publication: On false discovery rate thresholding for classification under sparsity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741797)
