Web: http://arxiv.org/abs/2106.03594

May 11, 2022, 1:11 a.m. | Lukas Gianinazzi, Maximilian Fries, Nikoli Dryden, Tal Ben-Nun, Maciej Besta, Torsten Hoefler

cs.LG updates on arXiv.org arxiv.org

We present a novel neural architecture to solve graph optimization problems
where the solution consists of arbitrary node labels, allowing us to solve hard
problems like graph coloring. We train our model using reinforcement learning,
specifically policy gradients, which gives us both a greedy and a probabilistic
policy. Our architecture builds on a graph attention network and uses several
inductive biases to improve solution quality. Our learned deterministic
heuristics for graph coloring give better solutions than classical degree-based
greedy heuristics …

algorithms arxiv labeling learning

More from arxiv.org / cs.LG updates on arXiv.org

Data & Insights Strategy & Innovation General Manager

@ Chevron Services Company, a division of Chevron U.S.A Inc. | Houston, TX

Faculty members in Research areas such as Bayesian and Spatial Statistics; Data Privacy and Security; AI/ML; NLP; Image and Video Data Analysis

@ Ahmedabad University | Ahmedabad, India

Director, Applied Mathematics & Computational Research Division

@ Lawrence Berkeley National Lab | Berkeley, Ca

Business Data Analyst

@ MainStreet Family Care | Birmingham, AL

Assistant/Associate Professor of the Practice in Business Analytics

@ Georgetown University McDonough School of Business | Washington DC

Senior Data Science Writer

@ NannyML | Remote