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

使用深度Q-Learning和图神经网络生成图着色启发式算法

Generating a Graph Colouring Heuristic with Deep Q-Learning and Graph Neural Networks

University of Warwick(华威大学)

George Watkins, Giovanni Montana, Juergen Branke

AI总结:

本研究提出基于深度Q-Learning和图神经网络的ReLCol方法,通过新颖的图参数化方式生成图着色构造启发式算法,实验证明其具有竞争力且表明强化学习在该问题上的潜力。

摘要:

图着色问题包括为图的顶点分配标签或颜色,使得没有两个相邻顶点共享相同的颜色。在本研究中,我们探讨是否可以使用深度强化学习来为图着色发现一种有竞争力的构造启发式算法。我们提出的方法ReLCol使用深度Q-Learning和图神经网络进行特征提取,并采用一种新颖的图参数化方法,从而提升了性能。我们使用具有不同拓扑结构的标准基准图,实证评估了ReLCol学习到的启发式算法相对于现有构造算法的优势和局限性,并证明强化学习是图着色问题进一步研究的有前景的方向。

英文摘要:

The graph colouring problem consists of assigning labels, or colours, to the vertices of a graph such that no two adjacent vertices share the same colour. In this work we investigate whether deep reinforcement learning can be used to discover a competitive construction heuristic for graph colouring. Our proposed approach, ReLCol, uses deep Q-learning together with a graph neural network for feature extraction, and employs a novel way of parameterising the graph that results in improved performance. Using standard benchmark graphs with varied topologies, we empirically evaluate the benefits and limitations of the heuristic learned by ReLCol relative to existing construction algorithms, and demonstrate that reinforcement learning is a promising direction for further research on the graph colouring problem.

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

↑