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

有限混料预测递推估计的收敛速度

Convergence rate for predictive recursion estimation of finite mixtures

Ryan Martin

摘要:

预测递归(PR)是混合模型中非参数估计的一种快速随机算法。众所周知,PR估计的混合和混合密度是一致的,在相当温和的条件下,但目前很少知道的收敛速率。在这里,我首先研究的渐近收敛性质的PR估计下的模型误设定的特殊情况下,有限混合已知的支持。从随机逼近理论的工具被用来证明PR估计收敛,最好的Kullback-Leibler近似,在近根$n$率。当支持度未知时,PR可用于构造目标函数,当优化时,该目标函数产生支持度的估计。我适用于已知的支持结果,推导出一个收敛速率为这个修改后的PR估计在未知的支持情况下,这比已知的最佳速率有利。

英文摘要:

Predictive recursion (PR) is a fast stochastic algorithm for nonparametric estimation of mixing distributions in mixture models. It is known that the PR estimates of both the mixing and mixture densities are consistent under fairly mild conditions, but currently very little is known about the rate of convergence. Here I first investigate asymptotic convergence properties of the PR estimate under model misspecification in the special case of finite mixtures with known support. Tools from stochastic approximation theory are used to prove that the PR estimates converge, to the best Kullback--Leibler approximation, at a nearly root-$n$ rate. When the support is unknown, PR can be used to construct an objective function which, when optimized, yields an estimate the support. I apply the known-support results to derive a rate of convergence for this modified PR estimate in the unknown support case, which compares favorably to known optimal rates.

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

↑