arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1503.00946math.STstat.TH
收藏

Goldenshluger-Lepski方法的最小罚函数

Minimal penalty for Goldenshluger-Lepski method

Claire Lacour, Pascal Massart

摘要:

本文讨论了基于Goldenshluger-Lepski选择方法的自适应非参数估计。这种估计量选择方法是基于估计量之间的成对比较关于一些损失函数。该方法还涉及一个惩罚项,该惩罚项通常需要足够大,以便该方法工作(在某种意义上,可以证明所选估计量的某些Oracle类型不等式)。在核估计和二次损失的密度估计的情况下,我们表明,该过程失败,如果选择的惩罚项小于一些临界值的惩罚:最小的惩罚。更精确地说,我们表明,二次风险的选择估计爆炸时,罚款低于这个临界值,而它保持在控制下,当罚款高于这个临界值。这种惩罚校准的相变现象已经在各种情况下的惩罚模型选择方法中被观察和证明,但在这里首次出现在Goldenshluger-Lepski成对比较方法中。一些模拟说明了理论结果,并导致一些提示如何使用理论来校准的方法在实践中。

英文摘要:

This paper is concerned with adaptive nonparametric estimation using the Goldenshluger-Lepski selection method. This estimator selection method is based on pairwise comparisons between estimators with respect to some loss function. The method also involves a penalty term that typically needs to be large enough in order that the method works (in the sense that one can prove some oracle type inequality for the selected estimator). In the case of density estimation with kernel estimators and a quadratic loss, we show that the procedure fails if the penalty term is chosen smaller than some critical value for the penalty: the minimal penalty. More precisely we show that the quadratic risk of the selected estimator explodes when the penalty is below this critical value while it stays under control when the penalty is above this critical value. This kind of phase transition phenomenon for penalty calibration has already been observed and proved for penalized model selection methods in various contexts but appears here for the first time for the Goldenshluger-Lepski pairwise comparison method. Some simulations illustrate the theoretical results and lead to some hints on how to use the theory to calibrate the method in practice.

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

↑