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.

ASoT] Natural abstractions and AlphaZero — AI Alignment Forum

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

PDF] Proving Theorems using Incremental Learning and Hindsight Experience Replay

PDF] Adaptive Tabu Search for Traveling Salesman Problems

Adversarial learning-based method for recognition of bionic and highly contextual underwater targets

Adam Zsolt Wagner

AI-Local search&Nodeterministic Problems&Partial observations&Online search - 丹尼尔奥利瓦- 博客园

Juan (@jeandut14000) / X

Anian Ruoss (@anianruoss) / X

Adam Zsolt Wagner

graphml - Telegram channel posts - Graph Machine Learning - Telemetrio