Not constructing Ramsey Graphs using Deep Reinforcement Learning

David Berghaus

Track: long paper (up to 4 pages)

Keywords: ramsey graphs, reinforcement learning, machine learning for mathematics, graph construction

Abstract: We consider the problem of constructing Ramsey graphs using deep reinforcement learning. We introduce a novel permutation invariant architecture that combines ideas from GNNs with self-attention algorithms over the cliques, which shows promising results in a related regression task. To generate graphs, we train our model using established reinforcement learning algorithms such as PPO and A2C. Our results are however very poor compared to traditional local-search algorithms, indicating that this problem is not well-suited for neural networks yet.

Anonymization: This submission has been anonymized for double-blind review via the removal of identifying information such as names, affiliations, and identifying URLs.

Submission Number: 7