arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.08484cs.AIcs.LG
收藏

一种结合启发式算法的最大最小割问题无监督学习框架

An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem

Harbin Institute of Technology(哈尔滨工业大学)

Huaiyuan Liu, Xianzhang Liu, Donghua Yang, Hongzhi Wang, Yingchi Long, Mengtong Ji, Dongjing Miao, Zhiyu Liang

AI总结:

针对最大最小割这一NP难组合优化问题缺乏关注且无标注下机器学习求解困难的问题,提出结合启发式的无监督学习框架,通过图神经网络参数化解、启发式树变换修复解,在保证解一致的同时简化图提速,实验验证其优于现有两种技术。

摘要:

最大最小割问题(Maximum Minimal Cut Problem, MMCP)是一类NP难的组合优化(combinatorial optimization, CO)问题,由于其双连通约束要求严苛且极具挑战性,该问题尚未得到广泛关注。此外,作为一类组合优化问题,它对机器学习而言同样是艰巨的任务,在没有标注样本的情况下尤其如此。为解决这些问题,本研究提出了一种结合启发式算法的MMCP无监督学习框架,能够生成有效且高质量的解。据我们所知,这是首项探索用机器学习与启发式方法求解MMCP的工作。该无监督求解器受松弛加舍入方法的启发,松弛后的解由图神经网络参数化,且明确写出了MMCP的代价与惩罚项,可实现模型的端到端训练。一项关键观察是,每个解至少对应一棵生成树。基于这一发现,研究采用了一种通过添加顶点实现树变换的启发式求解器,用于修复并提升无监督求解器的解质量。此外,该方法还在保证解一致性的前提下对图进行简化,从而缩短了运行时间。我们开展了大量实验以评估所提框架,并给出了一项具体应用。结果表明,我们的方法相较于两种已有的相关技术更具优势。

英文摘要:

The Maximum Minimal Cut Problem (MMCP), a NP-hard combinatorial optimization (CO) problem, has not received much attention due to the demanding and challenging bi-connectivity constraint. Moreover, as a CO problem, it is also a daunting task for machine learning, especially without labeled instances. To deal with these problems, this work proposes an unsupervised learning framework combined with heuristics for MMCP that can provide valid and high-quality solutions. As far as we know, this is the first work that explores machine learning and heuristics to solve MMCP. The unsupervised solver is inspired by a relaxation-plus-rounding approach, the relaxed solution is parameterized by graph neural networks, and the cost and penalty of MMCP are explicitly written out, which can train the model end-to-end. A crucial observation is that each solution corresponds to at least one spanning tree. Based on this finding, a heuristic solver that implements tree transformations by adding vertices is utilized to repair and improve the solution quality of the unsupervised solver. Alternatively, the graph is simplified while guaranteeing solution consistency, which reduces the running time. We conduct extensive experiments to evaluate our framework and give a specific application. The results demonstrate the superiority of our method against two techniques designed.

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

↑