Skip to content

We leverage recent advancements in Graph Neural Networks to compute a maximal independent set inside a noisy communication network to estimate its Shannon capacity.

License

Notifications You must be signed in to change notification settings

tonamatos/neuro-shannon

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

ASSESSING AND ENHANCING GRAPH NEURAL NETWORKS FOR COMBINATORIAL OPTIMIZATION: NOVEL APPROACHES AND APPLICATION IN MAXIMUM INDEPENDENT SET PROBLEMS

We leverage recent advancements in Graph Neural Networks to compute a maximal independent set inside a noisy communication network to estimate its Shannon capacity.

Combinatorial optimization (CO) problems are challenging as the computation time grows exponentially with the input. Graph Neural Networks (GNNs) show promise for researchers in solving CO problems. This study investigates the effectiveness of GNNs in solving the maximum independent set (MIS) problem, inspired by the intriguing findings of Schuetz et al., and aimed to enhance this solver. Despite the promise shown by GNNs, some researchers observed discrepancies when reproducing the findings, particularly compared to the greedy algorithm, for instance. We reproduced Schuetz’ Quadratic Unconstrained Binary Optimization (QUBO) unsupervised approach and explored the possibility of combining it with a supervised learning approach for solving MIS problems.

While the QUBO unsupervised approach did not guarantee maximal or optimal solutions, it provided a solid first guess for post-processing techniques like greedy decoding or tree-based methods. Moreover, our findings indicated that the supervised approach could further refine the QUBO unsupervised solver, as the learned model assigned meaningful probabilities for each node as initial node features, which could then be improved with the QUBO unsupervised approach. Thus, GNNs offer a valuable method for solving CO problems by integrating learned graph structures rather than relying solely on traditional heuristic functions. This research highlights the potential of GNNs to boost solver performance by leveraging ground truth during training and using optimization functions to learn structural graph information, marking a pioneering step towards improving prediction accuracy in a non-autoregressive manner.

Based on the work of Chenchuhui Hu, Brandeis University. Supervised by Tonatiuh Matos, University of Toronto. Paper pending publication, link will be posted here.

About

We leverage recent advancements in Graph Neural Networks to compute a maximal independent set inside a noisy communication network to estimate its Shannon capacity.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages