Minimax estimation of linear and quadratic functionals on sparsity classes
Olivier Collier, La\"etitia Comminges, Alexandre B. Tsybakov

TL;DR
This paper derives optimal non-asymptotic minimax rates for estimating linear, quadratic, and L2-norm functionals on sparse vectors in the Gaussian sequence model, introducing adaptive estimators and analyzing different convergence zones.
Contribution
It provides the first comprehensive non-asymptotic minimax analysis for these functionals on sparsity classes, including adaptive estimators and new rate characterizations.
Findings
Optimal rates for linear, quadratic, and L2-norm functionals on sparse vectors.
Adaptive estimators with near-minimax rates independent of sparsity and noise.
Identification of convergence zones: sparse, dense, and degenerate.
Abstract
For the Gaussian sequence model, we obtain non-asymptotic minimax rates of estimation of the linear, quadratic and the L2-norm functionals on classes of sparse vectors and construct optimal estimators that attain these rates. The main object of interest is the class s-sparse vectors for which we also provide completely adaptive estimators (independent of s and of the noise variance) having only logarithmically slower rates than the minimax ones. Furthermore, we obtain the minimax rates on the Lq-balls where 0 < q < 2. This analysis shows that there are, in general, three zones in the rates of convergence that we call the sparse zone, the dense zone and the degenerate zone, while a fourth zone appears for estimation of the quadratic functional. We show that, as opposed to estimation of the vector, the correct logarithmic terms in the optimal rates for the sparse zone scale as log(d/s^2)…
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.
