AI Summary: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Por um escritor misterioso
Descrição
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.
A new hyper-heuristic based on ant lion optimizer and Tabu search algorithm for replica management in cloud environment
AI high: The island of Anguilla is riding the AI wave
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Tabu Search Algorithm - an overview
A new hyper-heuristic based on ant lion optimizer and Tabu search algorithm for replica management in cloud environment
Nearly 100 Mila-affiliated scientific papers accepted at NeurIPS 2023 - Mila
AI-Local search&Nodeterministic Problems&Partial observations&Online search - 丹尼尔奥利瓦- 博客园
TransformerCVAE/data/arxiv/artificial intelligence_10047_15000_15_title.txt at master · fangleai/TransformerCVAE · GitHub
Petar Veličković - CatalyzeX
LinkedInのPetar Veličković: Our Learning on Graphs Conference tutorial on Neural Algorithmic Reasoning…
PDF] Proving Theorems using Incremental Learning and Hindsight Experience Replay
AI Summary: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Petar Veličković on LinkedIn: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Juan (@jeandut14000) / X
AI Summary: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
