基于支撑函数的凸集估计的最优收敛速度
Optimal rates of convergence for convex set estimation from support functions
摘要:
我们提出了一个极小极大最优解的问题,估计一个紧凑的,凸集从众多的噪音测量其支撑函数。该解决方案是基于适当的最小二乘估计的正则化。固定和随机设计都被考虑。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。