基于超图神经网络的分布式约束组合优化
Distributed Constrained Combinatorial Optimization leveraging Hypergraph Neural Networks
AI总结:
针对带高阶约束的通用组合优化问题求解难题,提出基于超图神经网络的HypOp框架,结合分布式并行训练、知识迁移与模拟退火微调,在多基准任务上性能优于现有无监督求解器与通用优化方法,还可应用于科学发现场景。
摘要:
可扩展地求解高维约束组合优化问题是多个科学与工程学科中出现的挑战。近期研究引入了图神经网络的新应用,用于求解二次成本组合优化问题。然而,如何有效利用图神经网络等模型来求解带有高阶约束的通用问题,仍是一个尚未解决的难题。本文提出了HypOp框架,该框架在多个方面推动了组合优化问题求解的现有技术水平:(i)它通过利用超图神经网络,将先前的研究成果推广到具有任意成本函数的高阶约束问题;(ii)通过引入一种全新的分布式并行训练架构,实现了对更大规模问题的可扩展性;(iii)通过在同一超图内进行知识迁移,证明了其在不同问题表述间的泛化能力;(iv)通过提出一种使用模拟退火的微调步骤,与现有技术相比大幅提升了解的精度;(v)在多个基准示例(包括超图MaxCut、可满足性问题和资源分配问题)上取得了显著进展,结合微调与分布式训练技术,运行时间得到了明显改善。我们通过在NDC药物-物质超图上求解超图MaxCut问题,展示了HypOp在科学发现中的应用。通过在各类优化问题上开展大量实验,HypOp展现出优于现有基于无监督学习的求解器和通用优化方法的性能。
英文摘要:
Scalable addressing of high dimensional constrained combinatorial optimization problems is a challenge that arises in several science and engineering disciplines. Recent work introduced novel application of graph neural networks for solving quadratic-cost combinatorial optimization problems. However, effective utilization of models such as graph neural networks to address general problems with higher order constraints is an unresolved challenge. This paper presents a framework, HypOp, which advances the state of the art for solving combinatorial optimization problems in several aspects: (i) it generalizes the prior results to higher order constrained problems with arbitrary cost functions by leveraging hypergraph neural networks; (ii) enables scalability to larger problems by introducing a new distributed and parallel training architecture; (iii) demonstrates generalizability across different problem formulations by transferring knowledge within the same hypergraph; (iv) substantially boosts the solution accuracy compared with the prior art by suggesting a fine-tuning step using simulated annealing; (v) shows a remarkable progress on numerous benchmark examples, including hypergraph MaxCut, satisfiability, and resource allocation problems, with notable run time improvements using a combination of fine-tuning and distributed training techniques. We showcase the application of HypOp in scientific discovery by solving a hypergraph MaxCut problem on NDC drug-substance hypergraph. Through extensive experimentation on various optimization problems, HypOp demonstrates superiority over existing unsupervised learning-based solvers and generic optimization methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。