7 papers
Learning to Approximate Uniform Facility Location via Graph Neural Networks
Chendi Qian, Christopher Morris, Stefanie Jegelka +1
Neural networks, particularly message-passing neural networks (MPNNs), are increasingly used as heuristics for hard combinatorial optimization problems. Yet many learning-based met…
Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
Hao Chen, Chendi Qian, Christopher Morris +2
Exact solution of hard combinatorial optimization problems often relies on strong convex relaxations, but solving these relaxations repeatedly inside a branch-and-bound algorithm c…
On the Expressive Power of GNNs to Solve Linear SDPs
Chendi Qian, Christopher Morris
Semidefinite programs (SDPs) are a powerful framework for convex optimization and for constructing strong relaxations of hard combinatorial problems. However, solving large SDPs ca…
GraIP: A Benchmarking Framework For Neural Graph Inverse Problems
Semih Cantürk, Andrei Manolache, Arman Mielke +5
A wide range of graph learning tasks, such as structure discovery, temporal graph analysis, and combinatorial optimization, focus on inferring graph structures from data, rather th…
Principled Data Augmentation for Learning to Solve Quadratic Programming Problems
Chendi Qian, Christopher Morris
Linear and quadratic optimization are crucial in numerous real-world applications, ranging from training machine learning models to solving integer linear programs. Recently, learn…
Towards graph neural networks for provably solving convex optimization problems
Chendi Qian, Christopher Morris
Recently, message-passing graph neural networks (MPNNs) have shown potential for solving combinatorial and continuous optimization problems due to their ability to capture variable…