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

图着色问题的图神经网络再思考

Rethinking Graph Neural Networks for the Graph Coloring Problem

Carnegie Mellon University(卡内基梅隆大学);The Chinese University of Hong Kong(香港中文大学);The Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));The University of Texas at Austin(德克萨斯大学奥斯汀分校)

Wei Li, Ruxuan Li, Yuzhe Ma, Siu On Chan, David Pan, Bei Yu

摘要:

图着色是一个经典的、关键的NP-难问题,它是指给连通的节点分配尽可能不同的颜色。然而,我们观察到最先进的GNN在图着色问题上不太成功。我们从两个方面分析其原因。首先,大多数GNN未能将同质性下的任务推广到异质性,即,连接的节点被分配不同颜色的图形。其次,GNNs是由网络深度的限制,使他们可能是一个局部的方法,这已被证明是非最优的最大独立集(MIS)问题。在本文中,我们专注于聚合组合GNN(AC-GNN),这是一类流行的GNN。我们首先将AC-GNN在着色问题中的能力定义为节点分配不同颜色的能力。这一定义与以往基于同质性假设的定义不同。我们识别AC-GNN无法区分的节点对。此外,我们证明了任何AC-GNN是一个局部着色方法,任何局部着色方法都是非最优的,通过探索稀疏随机图上局部方法的限制,从而证明了AC-GNN的非最优性,由于其局部性质。然后,我们证明了模型深度和它的着色能力之间的正相关关系。此外,我们还讨论了图的颜色等变性,以解决一些实际的限制,如预固定的限制。在上面的讨论之后,我们总结了一系列规则,这些规则使得GNN颜色等变并且在着色问题中很强大。然后,我们提出了一个简单的AC-GNN变化满足这些规则。我们经验验证我们的理论研究结果,并证明我们的简单模型大大优于国家的最先进的启发式算法的质量和运行时间。

英文摘要:

Graph coloring, a classical and critical NP-hard problem, is the problem of assigning connected nodes as different colors as possible. However, we observe that state-of-the-art GNNs are less successful in the graph coloring problem. We analyze the reasons from two perspectives. First, most GNNs fail to generalize the task under homophily to heterophily, i.e., graphs where connected nodes are assigned different colors. Second, GNNs are bounded by the network depth, making them possible to be a local method, which has been demonstrated to be non-optimal in Maximum Independent Set (MIS) problem. In this paper, we focus on the aggregation-combine GNNs (AC-GNNs), a popular class of GNNs. We first define the power of AC-GNNs in the coloring problem as the capability to assign nodes different colors. The definition is different with previous one that is based on the assumption of homophily. We identify node pairs that AC-GNNs fail to discriminate. Furthermore, we show that any AC-GNN is a local coloring method, and any local coloring method is non-optimal by exploring the limits of local methods over sparse random graphs, thereby demonstrating the non-optimality of AC-GNNs due to its local property. We then prove the positive correlation between model depth and its coloring power. Moreover, we discuss the color equivariance of graphs to tackle some practical constraints such as the pre-fixing constraints. Following the discussions above, we summarize a series of rules a series of rules that make a GNN color equivariant and powerful in the coloring problem. Then, we propose a simple AC-GNN variation satisfying these rules. We empirically validate our theoretical findings and demonstrate that our simple model substantially outperforms state-of-the-art heuristic algorithms in both quality and runtime.

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

↑