arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.08463stat.MLcs.LG
收藏

Mean Shift的收敛性分析

Convergence Analysis of Mean Shift

Kyoto University(京都大学)

Ryoya Yamasaki, Toshiyuki Tanaka

AI总结:

该研究借助Łojasiewicz不等式,在温和条件下给出mean shift算法生成的核密度估计众数序列的收敛保证与收敛速率评估,拓展了现有结论,覆盖了渐近统计效率最优的biweight核。

摘要:

均值漂移(mean shift, MS)算法用于寻找核密度估计(kernel density estimate, KDE)的众数。本研究借助Łojasiewicz不等式相关论证,在相当温和的条件下,给出了MS算法生成的众数估计序列的收敛保证,并评估了收敛速率。我们的结论拓展了现有涵盖解析核与Epanechnikov核的研究成果。这些结论的重要意义在于覆盖了biweight核——在基于KDE的众数估计中,该核在非负核里的渐近统计效率是最优的。

英文摘要:

The mean shift (MS) algorithm seeks a mode of the kernel density estimate (KDE). This study presents a convergence guarantee of the mode estimate sequence generated by the MS algorithm and an evaluation of the convergence rate, under fairly mild conditions, with the help of the argument concerning the Łojasiewicz inequality. Our findings extend existing ones covering analytic kernels and the Epanechnikov kernel. Those are significant in that they cover the biweight kernel, which is optimal among non-negative kernels in terms of the asymptotic statistical efficiency for the KDE-based mode estimation.

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

↑