2000 character limit reached
Optimal rates of convergence for convex set estimation from support functions
Published 26 Aug 2011 in math.ST and stat.TH | (1108.5341v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.