Optimal rates of convergence for convex set estimation from support functions
Statistics Theory
2012-05-31 v2 Statistics Theory
Abstract
We present a minimax optimal solution to the problem of estimating a compact, convex set from finitely many noisy measurements of its support function. The solution is based on appropriate regularizations of the least squares estimator. Both fixed and random designs are considered.
Cite
@article{arxiv.1108.5341,
title = {Optimal rates of convergence for convex set estimation from support functions},
author = {Adityanand Guntuboyina},
journal= {arXiv preprint arXiv:1108.5341},
year = {2012}
}
Comments
Published in at http://dx.doi.org/10.1214/11-AOS959 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)