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

高维全局optimization的二元交互方法与机器学习

Binary interaction methods for high dimensional global optimization and machine learning

Alessandro Benfenati, Giacomo Borghi, Lorenzo Pareschi

摘要:

在这项工作中,我们介绍了一类新的梯度自由的全球最优化方法的基础上的二元相互作用动力学的玻尔兹曼型方程。在每个相互作用中,粒子的行为都考虑到最佳微观二元位置和最佳宏观集体位置。在平均场的限制,我们表明,由此产生的福克-普朗克偏微分方程推广目前的一类共识为基础的优化(CBO)方法。对于后者的方法,收敛到全局最小值,可以显示为一大类功能。在动力学理论中著名的直接模拟蒙特卡罗方法的启发下,推导并讨论了数学实现。几个例子的原型检验函数的全局优化的报告,包括应用到机器学习。

英文摘要:

In this work we introduce a new class of gradient-free global optimization methods based on a binary interaction dynamics governed by a Boltzmann type equation. In each interaction the particles act taking into account both the best microscopic binary position and the best macroscopic collective position. In the mean-field limit we show that the resulting Fokker-Planck partial differential equations generalize the current class of consensus based optimization (CBO) methods. For the latter methods, convergence to the global minimizer can be shown for a large class of functions. Algorithmic implementations inspired by the well-known direct simulation Monte Carlo methods in kinetic theory are derived and discussed. Several examples on prototype test functions for global optimization are reported including applications to machine learning.

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

↑