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

最大割基准:面向组合优化学习启发式算法评估的标准化

A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization

Texas A&M University(德克萨斯农工大学)

Ankur Nath, Alan Kuhnle

AI总结:

针对组合优化学习启发式算法评估不一致的问题,本文提出面向最大割问题的开源基准MaxCut-Bench,通过统一接口和多维度测试复现主流方法,发现多数学习算法未优于传统启发式,且ECO-DQN替换GNN为线性回归性能不变甚至提升。

摘要:

近年来,大量研究通过结合图神经网络(GNNs)设计面向图结构组合优化问题的通用启发式算法,以学习特定分布的解结构。然而,这些启发式算法在评估时所选用的基线和测试实例缺乏一致性,导致难以衡量不同算法的相对性能。本文提出了开源基准套件MaxCut-Bench,专门针对NP难的最大割问题(含加权和无权两种变体),其测试实例从多样的图数据集中精心筛选整理而来。该套件为传统启发式算法和基于机器学习的启发式算法提供了统一接口。随后,我们利用该基准从目标值、泛化性和可扩展性三个维度,系统验证或复现了多种主流基于学习的方法的结果,包括S2V-DQN[31]、ECO-DQN[4]等。实验结果显示,多种学习启发式算法的性能未能超过朴素贪心算法,仅有一种算法能持续优于Tabu Search(一种基于局部搜索的简单通用启发式算法)。此外我们还发现,若将ECO-DQN中的GNN替换为基于与Tabu Search相关的部分特征的简单线性回归,其性能保持不变甚至有所提升。代码、数据和预训练模型可在以下链接获取:https://github.com/ankurnath/MaxCut-Bench。

英文摘要:

Recently, there has been much work on the design of general heuristics for graph-based, combinatorial optimization problems via the incorporation of Graph Neural Networks (GNNs) to learn distribution-specific solution structures.However, there is a lack of consistency in the evaluation of these heuristics, in terms of the baselines and instances chosen, which makes it difficult to assess the relative performance of the algorithms. In this paper, we propose an open-source benchmark suite MaxCut-Bench dedicated to the NP-hard Maximum Cut problem in both its weighted and unweighted variants, based on a careful selection of instances curated from diverse graph datasets. The suite offers a unified interface to various heuristics, both traditional and machine learning-based. Next, we use the benchmark in an attempt to systematically corroborate or reproduce the results of several, popular learning-based approaches, including S2V-DQN [31], ECO-DQN [4], among others, in terms of three dimensions: objective value, generalization, and scalability. Our empirical results show that several of the learned heuristics fail to outperform a naive greedy algorithm, and that only one of them consistently outperforms Tabu Search, a simple, general heuristic based upon local search. Furthermore, we find that the performance of ECO-DQN remains the same or is improved if the GNN is replaced by a simple linear regression on a subset of the features that are related to Tabu Search. Code, data, and pretrained models are available at: \url{https://github.com/ankurnath/MaxCut-Bench}.

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

↑