arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.07368math.STstat.MLstat.TH
收藏

Sobolev椭球上的量化非参数估计

Quantized Nonparametric Estimation over Sobolev Ellipsoids

Yuancheng Zhu, John Lafferty

摘要:

我们制定的存储或通信约束下的极大极小估计的概念,并证明了一个扩展的非参数估计Sobolev椭球的平斯克定理。放置用于编码任何估计的比特数的限制,我们给出了严格的下限和上界的过度风险,由于量化的比特数,信号大小,和噪声水平。这建立了索伯列夫空间的量化约束下的存储和风险之间的帕累托最优权衡。我们的结果和证明技术结合元素的率失真理论和极大极小分析。建议的量化估计方案,这表明可扩展性的下界,是自适应的,在通常的统计意义上,实现最佳的量化极大极小速率的索伯列夫空间的平滑参数的知识。它在计算意义上也是自适应的,因为它仅在观察数据之后构造代码,以动态地将更多码字分配给估计信号大小较大的块。包括模拟,说明量化的统计风险的影响。

英文摘要:

We formulate the notion of minimax estimation under storage or communication constraints, and prove an extension to Pinsker's theorem for nonparametric estimation over Sobolev ellipsoids. Placing limits on the number of bits used to encode any estimator, we give tight lower and upper bounds on the excess risk due to quantization in terms of the number of bits, the signal size, and the noise level. This establishes the Pareto optimal tradeoff between storage and risk under quantization constraints for Sobolev spaces. Our results and proof techniques combine elements of rate distortion theory and minimax analysis. The proposed quantized estimation scheme, which shows achievability of the lower bounds, is adaptive in the usual statistical sense, achieving the optimal quantized minimax rate without knowledge of the smoothness parameter of the Sobolev space. It is also adaptive in a computational sense, as it constructs the code only after observing the data, to dynamically allocate more codewords to blocks where the estimated signal size is large. Simulations are included that illustrate the effect of quantization on statistical risk.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑