Adaptive Threshold Estimation by FDR
Wenhua Jiang, Cun-Hui Zhang

TL;DR
This paper demonstrates that adaptive minimax threshold estimators based on FDR control can achieve optimality across a wide range of sparsity levels in Gaussian mean estimation, outperforming traditional methods.
Contribution
It introduces a class of smooth threshold estimators using FDR rules that are adaptively minimax over various sparsity regimes, extending the applicability of FDR-based methods.
Findings
FDR-based smooth threshold estimators achieve adaptive minimaxity in sparse Gaussian models.
The class includes soft and firm thresholds but not hard thresholds.
FDR smooth-threshold estimators outperform the sample mean when the mean is very small.
Abstract
This paper addresses the following simple question about sparsity. For the estimation of an -dimensional mean vector in the Gaussian sequence model, is it possible to find an adaptive optimal threshold estimator in a full range of sparsity levels where nonadaptive optimality can be achieved by threshold estimators? We provide an explicit affirmative answer as follows. Under the squared loss, adaptive minimaxity in strong and weak balls with is achieved by a class of smooth threshold estimators with the threshold level of the Benjamini-Hochberg FDR rule or its a certain approximation, provided that the minimax risk is between and for some . For , this means adaptive minimaxity in balls when . The class of smooth threshold estimators includes the soft…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Mathematical Approximation and Integration · Bayesian Methods and Mixture Models
