Learning Combinatorial Node Labeling Algorithms

Abstract

We present a novel neural architecture to solve graph optimization problems where the solution consists of arbitrary node labels, allowing us to solve hard problems like graph coloring. We train our model using reinforcement learning, specifically policy gradients, which gives us both a greedy and a probabilistic policy. Our architecture builds on a graph attention network and uses several inductive biases to improve solution quality. Our learned deterministic heuristics for graph coloring give better solutions than classical degree-based greedy heuristics and only take seconds to apply to graphs with tens of thousands of vertices. Moreover, our probabilistic policies outperform all greedy state-of-the-art coloring baselines and a machine learning baseline. Finally, we show that our approach also generalizes to other problems by evaluating it on minimum vertex cover and outperforming two greedy heuristics.

References in corpus (11)

• Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
• Statistical mechanics of complex networks
• Learning Combinatorial Optimization Algorithms over Graphs
• Layer Normalization
• Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
• Neural Combinatorial Optimization with Reinforcement Learning
• An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem
• Attention, Learn to Solve Routing Problems!
• Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning
• Learning Heuristics over Large Graphs via Deep Reinforcement Learning
• Coloring Big Graphs with AlphaGoZero