Minimax estimation of linear and quadratic functionals on sparsity classes

For the Gaussian sequence model, we obtain non-asymp-totic minimax rates of estimation of the linear, quadratic and the 2-norm functionals on classes of sparse vectors and construct optimal estimators that attain these rates. The main object of interest is the class B 0 (s) of s-sparse vectors θ = (θ 1 ,. .. , θ d), for which we also provide completely adaptive estimators (independent of s and of the noise variance σ) having logarithmically slower rates than the minimax ones. Furthermore, we obtain the minimax rates on the q-balls B q (r) = {θ ∈ R d : q ≤ r} where 0 < q ≤ 2, and q = d i=1 |θ i | q 1/q. 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 correct logarithmic terms in the optimal rates for the sparse zone scale as log(d/s 2) and not as log(d/s). For the class B 0 (s), the rates of estimation of the linear functional and of the 2-norm have a simple elbow at s = √ d (boundary between the sparse and the dense zones) and exhibit similar performances, whereas the estimation of the quadratic functional Q(θ) reveals more complex effects: the minimax risk on B 0 (s) is infinite and the sparseness assumption needs to be combined with a bound on the 2-norm. Finally, we apply our results on estimation of the 2-norm to the problem of testing against sparse alternatives. In particular, we obtain a non-asymptotic analog of the Ingster-Donoho-Jin theory revealing some effects that were not captured by the previous asymptotic analysis