AI Summary: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search

This paper studies the problem of finding graphs that maximize the number of edges, while avoiding short cycles. It formulates graph generation as a reinforcement learning task, and compares methods like AlphaZero and tabu search. A key finding is that using a curriculum - building larger graphs from good smaller graphs - significantly improves performance. The work makes progress on an open problem in extremal graph theory.

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search

LinkedInのPetar Veličković: Our Learning on Graphs Conference tutorial on Neural Algorithmic Reasoning…

Adam Zsolt Wagner

Nearly 100 Mila-affiliated scientific papers accepted at NeurIPS 2023 - Mila

A new hyper-heuristic based on ant lion optimizer and Tabu search algorithm for replica management in cloud environment

Juan (@jeandut14000) / X

AI/ML: Data Trojan Horse - by Rayfe Gaspar-Asaoka

PDF] Proving Theorems using Incremental Learning and Hindsight Experience Replay

Petar Veličković on LinkedIn: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search

Tabu Search Baeldung on Computer Science

A new hyper-heuristic based on ant lion optimizer and Tabu search algorithm for replica management in cloud environment