Variable selection, monotone likelihood ratio and group sparsity
From MaRDI portal
Publication:6042348
DOI10.1214/22-aos2251arXiv2112.15042OpenAlexW4360879322MaRDI QIDQ6042348
Enno Mammen, Alexandre B. Tsybakov, Mohamed Ndaoud, Cristina Butucea
Publication date: 10 May 2023
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.15042
variable selectionminimax risksparsitygroup variable selectionexact recoveryalmost full recoveryHamming losspivotal selection problem
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- UPS delivers optimal phase diagram in high-dimensional variable selection
- Distribution-free multiple testing
- Oracle inequalities and optimal inference under group sparsity
- Variable selection with Hamming loss
- The all-or-nothing phenomenon in sparse linear regression
- Uncertainty quantification for robust variable selection and multiple testing
- Iterative algorithm for discrete structure recovery
- False discovery rate control with unknown null distribution: is it possible to mimic the oracle?
- Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method
- Fundamental limits of exact support recovery in high dimensions
- Adaptive variable selection in nonparametric sparse regression
- Adaptive variable selection in nonparametric sparse additive models
- Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators
- High-dimensional graphs and variable selection with the Lasso
- Necessary and Sufficient Conditions for Sparsity Pattern Recovery
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Optimal Variable Selection and Adaptive Noisy Compressed Sensing
- Nearly Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Thresholded Basis Pursuit: LP Algorithm for Order-Wise Optimal Support Recovery for Sparse and Approximately Sparse Signals From Noisy Random Measurements
