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.
Immunity-based Ebola optimization search algorithm for minimization of feature extraction with reduction in digital mammography using CNN models
Explainable artificial intelligence through graph theory by generalized social network analysis-based classifier
Aman Madaan (@aman_madaan) / X
Anian Ruoss (@anianruoss) / X
Juan (@jeandut14000) / X
Petar Veličković posted on LinkedIn
AI Summary: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs
arxiv-sanity
de
por adulto (o preço varia de acordo com o tamanho do grupo)