arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.16258cs.AIcond-mat.dis-nncond-mat.stat-mechcs.NE
收藏

基于编码的优化:重整化群视角

Optimisation via encodings: a renormalisation group perspective

Santa Fe Institute(圣塔菲研究所)

Konstantin Klemm, Anita Mehta, Peter F. Stadler

AI总结:

该研究从重整化群视角探究覆盖编码映射的粗粒化机制,通过解析与计算验证其与重整化群粗粒化的高度相似性,揭示二者可能存在深层数学关联。

摘要:

困难的优化问题,尤其是NP完全问题,传统上采用搜索启发式算法近似求解。这类算法通常会因遇到的崎岖景观而减速,因为局部极小值会阻滞搜索过程。覆盖编码映射(cover-encoding maps)的设计旨在规避这一问题,它将原始景观转化为无局部极小值且富含近优解的景观。根据定义,这类映射通过通常等同于某种粗粒化的过程,将原始(更大的)搜索空间映射到更小的子空间中。本文中,我们利用形式化论证以及覆盖编码映射的具体实例,从解析和计算两方面探究了这种粗粒化的细节。我们的结果有力表明,覆盖编码映射涉及的粗粒化与重整化群(renormalisation group)方案中遇到的粗粒化高度相似。鉴于这两种形式体系看似截然不同,这些强相似性相当出人意料,也暗示存在有待进一步探索的深层数学基础。

英文摘要:

Difficult, in particular NP-complete, optimization problems are traditionally solved approximately using search heuristics. These are usually slowed down by the rugged landscapes encountered, because local minima arrest the search process. Cover-encoding maps were devised to circumvent this problem by transforming the original landscape to one that is free of local minima and enriched in near-optimal solutions. By definition, these involve the mapping of the original (larger) search space into smaller subspaces, by processes that typically amount to a form of coarse-graining. In this paper, we explore the details of this coarse-graining using formal arguments, as well as concrete examples of cover-encoding maps, that are investigated analytically as well as computationally. Our results strongly suggest that the coarse-graining involved in cover-encoding maps bears a strong resemblance to that encountered in renormalisation group schemes. Given the apparently disparate nature of these two formalisms, these strong similarities are rather startling, and suggest deep mathematical underpinnings that await further exploration.

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

↑