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.

Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs

PDF] Adaptive Tabu Search for Traveling Salesman Problems

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

Petar Veličković on LinkedIn: Building Google Maps' Algorithm & AI Research at Google Deepmind - The…

Petar Veličković - CatalyzeX

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

arxiv-sanity

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

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