Optimal adaptive estimation of linear functionals under sparsity

From MaRDI portal
Publication:1991697

DOI10.1214/17-AOS1653zbMATH Open1456.62141arXiv1611.09744MaRDI QIDQ1991697FDOQ1991697


Authors: Olivier Collier, Alexandre B. Tsybakov, Nicolas Verzelen, Laetitia Comminges Edit this on Wikidata


Publication date: 30 October 2018

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: We consider the problem of estimation of a linear functional in the Gaussian sequence model where the unknown vector theta in R^d belongs to a class of s-sparse vectors with unknown s. We suggest an adaptive estimator achieving a non-asymptotic rate of convergence that differs from the minimax rate at most by a logarithmic factor. We also show that this optimal adaptive rate cannot be improved when s is unknown. Furthermore, we address the issue of simultaneous adaptation to s and to the variance sigma^2 of the noise. We suggest an estimator that achieves the optimal adaptive rate when both s and sigma^2 are unknown.


Full work available at URL: https://arxiv.org/abs/1611.09744




Recommendations




Cites Work


Cited In (17)





This page was built for publication: Optimal adaptive estimation of linear functionals under sparsity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991697)