One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction
Jan T\"onshoff, Berke Kisin, Jakob Lindner, Martin Grohe

TL;DR
This paper introduces a universal Graph Neural Network architecture that learns efficient, problem-specific heuristics for solving various Constraint Satisfaction Problems through end-to-end training, outperforming previous neural methods and rivaling traditional heuristics.
Contribution
The paper presents a novel, general GNN-based framework for CSPs that operates on a global search space and can be trained unsupervised, enabling scalable and effective problem-solving across diverse CSPs.
Findings
Outperforms prior neural approaches on CSP benchmarks.
Can handle larger and more complex instances than training data.
Competes with traditional heuristics on challenging CSPs.
Abstract
We propose a universal Graph Neural Network architecture which can be trained as an end-2-end search heuristic for any Constraint Satisfaction Problem (CSP). Our architecture can be trained unsupervised with policy gradient descent to generate problem specific heuristics for any CSP in a purely data driven manner. The approach is based on a novel graph representation for CSPs that is both generic and compact and enables us to process every possible CSP instance with one GNN, regardless of constraint arity, relations or domain size. Unlike previous RL-based methods, we operate on a global search action space and allow our GNN to modify any number of variables in every step of the stochastic search. This enables our method to properly leverage the inherent parallelism of GNNs. We perform a thorough empirical evaluation where we learn heuristics for well known and important CSPs from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · AI-based Problem Solving and Planning
MethodsGraph Neural Network · Test
