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

高效图着色与神经网络:一种受物理启发的大型图问题求解方法

Physics Inspired Neural Networks Enable Efficient Graph Coloring

Sapienza University of Rome(罗马萨皮恩扎大学)

Lorenzo Colantonio, Andrea Cacioppo, Federico Scarpati, Maria Chiara Angelini, Federico Ricci-Tersenghi, Stefano Giagu

AI总结:

本文提出一种受物理启发的神经框架,结合图神经网络和统计力学原理,高效解决大规模图着色问题,接近理论动态相变并实现接近最优的检测性能。

摘要:

组合优化问题在算法相变附近代表了对经典算法和机器学习方法的基本挑战。其中,图着色作为典型的约束满足问题,表现出尖锐的动态和可满足性阈值。本文介绍了一种受物理启发的神经框架,通过结合图神经网络和统计力学原理,学习解决大规模图着色实例。我们的方法整合了基于种植的监督信号、对称性破坏正则化以及迭代噪声退火神经动力学,以导航聚类的解景观。当迭代次数与图规模平方成正比时,所学求解器能够达到接近随机图理论动态相变的算法阈值,并在种植推断范围内实现接近最优的检测性能。模型能够从小训练图泛化到规模大十倍的实例,证明神经架构可以学习可扩展的算法策略,在困难的连接区域仍保持有效。这些结果建立了一种通用范式,用于学习在组合优化和推断中接近基本相界的基础的神经求解器。

英文摘要:

Combinatorial optimization problems near algorithmic phase transitions represent a fundamental challenge for both classical algorithms and machine learning approaches. Among them, graph coloring is a prototypical constraint satisfaction problem characterized by phase transitions that fragment the solution space into distinct clusters, making the search for valid solutions challenging. Here we introduce a physics-inspired neural framework that learns to solve large-scale graph coloring instances by combining graph neural networks with statistical-mechanics principles. Our approach integrates a planting-based supervised signal, symmetry-breaking regularization, and iterative noise-annealed neural dynamics to navigate complex solution landscapes. When the number of iterations scales quadratically with graph size, the learned solver successfully tackles increasingly challenging instances, even in regimes where finding valid solutions becomes particularly difficult, demonstrating its ability to extract meaningful information from the graph structure. The model generalizes from small training graphs to instances up to 20 times larger, demonstrating that neural architectures can learn scalable algorithmic strategies that remain effective in hard connectivity regions. These results establish a general framework for learning neural solvers that operate near fundamental phase boundaries in combinatorial optimization and inference.

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

↑