arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.02720cs.LGcs.AI
收藏

面向组合景观结构相似性推断的研究

Towards the Inferrence of Structural Similarity of Combinatorial Landscapes

University of Glasgow(格拉斯哥大学);University of Exeter(埃克塞特大学)

Mingyu Huang, Ke Li

AI总结:

本文以局部最优网络为代理,利用图数据挖掘技术分析组合优化适应度景观的拓扑结构,通过大规模实验证实相邻维度同类景观存在结构相似性,为基于类比的求解器迁移提供了依据。

摘要:

类比是最常见的问题求解启发式方法之一。对于给定问题,求解器可被视为在其适应度景观上的策略性游走。因此,如果一个求解器对某个问题实例有效,我们期望它对其适应度景观在结构上彼此基本相似的其他实例也同样有效。然而,由于组合优化的黑箱性质,在现实场景中推断这种相似性远非易事。为弥合这一差距,本文利用局部最优网络作为适应度景观的代理,提出借助图数据挖掘技术进行定性与定量分析,以探索嵌入在这些景观中的潜在拓扑结构信息。通过在三个经典组合优化问题上开展大规模实证实验,我们获得了具体证据,支持相邻维度内同类景观之间存在结构相似性。我们还探究了不同问题类别景观之间的关系。

英文摘要:

One of the most common problem-solving heuristics is by analogy. For a given problem, a solver can be viewed as a strategic walk on its fitness landscape. Thus if a solver works for one problem instance, we expect it will also be effective for other instances whose fitness landscapes essentially share structural similarities with each other. However, due to the black-box nature of combinatorial optimization, it is far from trivial to infer such similarity in real-world scenarios. To bridge this gap, by using local optima network as a proxy of fitness landscapes, this paper proposed to leverage graph data mining techniques to conduct qualitative and quantitative analyses to explore the latent topological structural information embedded in those landscapes. By conducting large-scale empirical experiments on three classic combinatorial optimization problems, we gain concrete evidence to support the existence of structural similarity between landscapes of the same classes within neighboring dimensions. We also interrogated the relationship between landscapes of different problem classes.

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

↑