26 citations · 55 across the 12 of their papers we have counts for
9 papers · 1 filter
One Step Forward and K Steps Back: Better Reasoning with Denoising Recursion Models
Chris Cameron, Wangzheng Wang, Nikita Ivanov +3
Looped transformers scale computational depth without increasing parameter count by repeatedly applying a shared transformer block and can be used for iterative refinement, where e…
The Graph's Apprentice: Teaching an LLM Low Level Knowledge for Circuit Quality Estimation
Reza Moravej, Saurabh Bodhe, Zhanguang Zhang +6
Logic synthesis is a crucial phase in the circuit design process, responsible for transforming hardware description language (HDL) designs into optimized netlists. However, traditi…
GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection
Zhanguang Zhang, Didier Chetelat, Joseph Cotnareanu +7
Boolean satisfiability (SAT) problems are routinely solved by SAT solvers in real-life applications, yet solving time can vary drastically between solvers for the same instance. Th…
Exploring the Power of Graph Neural Networks in Solving Linear Optimization Problems
Chendi Qian, Didier Chételat, Christopher Morris
Recently, machine learning, particularly message-passing graph neural networks (MPNNs), has gained traction in enhancing exact optimization algorithms. For example, MPNNs speed up…
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Maxime Gasse, Quentin Cappart, Jonas Charfreitag +38
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolatio…
Ecole: A Library for Learning Inside MILP Solvers
Antoine Prouvost, Justin Dumouchelle, Maxime Gasse +2
In this paper we describe Ecole (Extensible Combinatorial Optimization Learning Environments), a library to facilitate integration of machine learning in combinatorial optimization…