Yuille-Poggio流与通过热演化凸化实现多项式的全局极小化
Yuille-Poggio's Flow and Global Minimizer of Polynomials through Convexification by Heat Evolution
AI总结:
本文通过热演化凸化与高斯滤波研究多项式全局极小化,建立Yuille-Poggio流并给出凸化后向微分流算法成功的充要条件,同时提出无需凸化即可全局极小化四次多项式的简化牛顿法。
摘要:
本研究考察了由O. Arikan等人在文献[ABK]中提出的用于多项式全局极小化的后向微分流算法的凸化版本。研究探讨了该方法为何在高次多项式上可能失败,而在四次多项式上却能成功。我们采用热演化方法进行凸化,并结合高斯滤波,后者可视为Steklov正则化的一种累积形式。在此背景下,我们应用了来自计算机视觉的指纹理论。指纹理论最初由A.L. Yuille和T. Poggio于20世纪80年代为计算机视觉而发展,特别是其中的指纹轨迹方程,被用来刻画极小化子的尺度(时间)演化。对于一般多项式,我们的研究促成了Yuille-Poggio流的建立以及对指纹概念更广泛的解释,特别是我们建立了凸化后向微分流算法成功实现全局极小化的充分必要条件。对于四次多项式,我们的分析不仅反映了O. Arikan等人[ABK]的结果,还给出了一个显著更简单的牛顿法版本,该版本无需凸化即可始终全局极小化四次多项式。
英文摘要:
This study examines the convexification version of the backward differential flow algorithm for the global minimization of polynomials, introduced by O. Arikan \textit{et al} in \cite{ABK}. It investigates why this approach might fail with high-degree polynomials yet succeeds with quartic polynomials. We employ the heat evolution method for convexification combined with Gaussian filtering, which acts as a cumulative form of Steklov's regularization. In this context, we apply the fingerprint theory from computer vision. Originally developed by A.L. Yuille and T. Poggio in the 1980s for computer vision, the fingerprint theory, particularly the fingerprint trajectory equation, is used to illustrate the scaling (temporal) evolution of minimizers. In the case of general polynomials, our research has led to the creation of the Yuille-Poggio flow and a broader interpretation of the fingerprint concepts, in particular we establish the condition both sufficient and necessary for the convexified backward differential flow algorithms to successfully achieve global minimization. For quartic polynomials, our analysis not only reflects the results of O. Arikan et al. \cite{ABK} but also presents a significantly simpler version of Newton's method that can always globally minimize quartic polynomials without convexification.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。