[공지사항]을 빙자한 안부와 근황 
Show more

Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

Binarizing Physics-Inspired GNNs for Combinatorial Optimization

Created by
  • Haebom

Author

Martin Krutsk y, Gustav \v{S} ir, Vyacheslav Kungurtsev, Georgios Korpas

Outline

This paper presents an unsupervised learning framework for solving combinatorial optimization problems using physics-inspired graph neural networks (PI-GNNs). PI-GNNs show good performance on various combinatorial optimization problems, but their performance deteriorates rapidly as the density of the problem graph increases. Through analysis, we show that this is due to the degenerate solutions for high-density problems and the mismatch between the real-valued output of PI-GNNs and the binary-valued problem solutions. To address this issue, we propose novel methods that improve the simple strategy of existing PI-GNNs based on insights from fuzzy logic and binarized neural networks. Experimental results show that the proposed methods significantly improve the performance of PI-GNNs in high-density environments.

Takeaways, Limitations

Takeaways: The cause of the performance degradation of PI-GNNs for combinatorial optimization problems with dense graphs was identified, and an improved method based on fuzzy logic and binarization neural networks was proposed to achieve performance improvement. This can contribute to expanding the application scope of PI-GNNs.
Limitations: The effectiveness of the proposed methods may be limited to certain types of combinatorial optimization problems and graph structures. Additional experiments and analyses on more diverse problems and graph structures are needed. In addition, the analysis of the computational cost and complexity of the proposed methods is insufficient.
👍