arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.27643stat.MLcs.LGcs.NAmath.NAmath.OCstat.CO
收藏

网络上的贝叶斯优化

Bayesian Optimization on Networks

Committee on Computational and Applied Mathematics, University of Chicago(芝加哥大学计算与应用数学委员会);Department of Statistics, University of Chicago(芝加哥大学统计系);Institute for Mathematical and Statistical Innovation(数学与统计创新研究所);University of Chicago(芝加哥大学)

Wenwen Li, Daniel Sanz-Alonso, Ruiyi Yang

AI总结:

本文研究了以度量图建模的网络优化问题,提出基于高斯过程代理模型的贝叶斯优化算法,通过序列更新指导查询点获取,采用Whittle-Matérn高斯过程先验模型提升网络几何适应性,并通过数值实验验证算法在基准函数优化和电信网络贝叶斯反演中的有效性。

摘要:

本文研究了以度量图建模的网络优化问题。受目标函数昂贵或仅作为黑箱可用的应用启发,我们开发了贝叶斯优化算法,通过序列更新高斯过程代理模型来指导查询点获取。为确保代理模型适应网络几何,我们采用通过度量图上的随机偏微分方程定义的Whittle-Matérn高斯过程先验模型。除了建立足够光滑目标函数的遗憾界,我们还分析了实际情况下目标函数光滑性未知且Whittle-Matérn先验通过有限元表示的情况。数值结果展示了我们的算法在合成度量图上优化基准目标函数以及在电信网络上通过最大后验估计进行贝叶斯反演的有效性。

英文摘要:

This paper studies optimization on networks modeled as metric graphs. Motivated by applications where the objective function is expensive to evaluate or only available as a black box, we develop Bayesian optimization algorithms that sequentially update a Gaussian process surrogate model of the objective to guide the acquisition of query points. To ensure that the surrogates are tailored to the network's geometry, we adopt Whittle-Matérn Gaussian process prior models defined via stochastic partial differential equations on metric graphs. In addition to establishing regret bounds for optimizing sufficiently smooth objective functions, we analyze the practical case in which the smoothness of the objective is unknown and the Whittle-Matérn prior is represented using finite elements. Numerical results demonstrate the effectiveness of our algorithms for optimizing benchmark objective functions on a synthetic metric graph and for Bayesian inversion via maximum a posteriori estimation on a telecommunication network.

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

↑