The Minimax Risk Of Truncated Series Estimators For Symmetric Convex Polytopes

Adel Javanmard, Li Zhang

2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)(2012)

引用 5|浏览14
暂无评分
摘要
We study the optimality of the minimax risk of truncated series estimators over symmetric convex polytopes. We show that the optimal truncated series estimator is within O(log m) factor of the optimal if the polytope is defined by m hyperplanes. This represents the first such bounds towards general convex bodies. In proving our result, we first define a geometric quantity, called the approximation radius, for lower bounding the minimax risk. We then derive our bounds by establishing a connection between the approximation radius and the Kolmogorov width, the quantity that provides upper bounds for the truncated series estimator. Besides, our proof contains several ingredients which might be of independent interest: 1. The notion of approximation radius depends on the volume of the body. It is an intuitive notion and is flexible to yield strong minimax lower bounds; 2. The connection between the approximation radius and the Kolmogorov width is a consequence of a novel duality relationship on the Kolmogorov width, developed by utilizing some classical results from convex geometry [1], [18], [6].
更多
查看译文
关键词
upper bound,measurement,vectors,computational geometry,geometry,estimation,convex geometry,approximation theory,computational complexity,hyperplane,duality mathematics,series mathematics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要