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

Juan (@jeandut14000) / X

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

Aman Madaan (@aman_madaan) / X

🌪️ Three months of AI in six charts

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

Petar Veličković posted on LinkedIn

Satheesh Kumar V na LinkedIn: Synechron CEO's Winning Formula: Agile, ethical, and culturally strong

State of AI Report: Compute Index V2 update!

Petar Veličković - CatalyzeX

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

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