mlsanityData to 7 Oct 2026

Instance-wise algorithm configuration with graph neural networks

arXiv 2202.04910 ↗First posted 10 Feb 2022cs.LG math.OCcited by 5

Not on the map. Why?

Abstract (arXiv)

We present our submission for the configuration task of the Machine Learning for Combinatorial Optimization (ML4CO) NeurIPS 2021 competition. The configuration task is to predict a good configuration of the open-source solver SCIP to solve a mixed integer linear program (MILP) efficiently. We pose this task as a supervised learning problem: First, we compile a large dataset of the solver performance for various configurations and all provided MILP instances. Second, we use this data to train a graph neural network that learns to predict a good configuration for a specific instance. The submission was tested on the three problem benchmarks of the competition and improved solver performance over the default by 12% and 35% and 8% across the hidden test instances. We ranked 3rd out of 15 on the global leaderboard and won the student leaderboard. We make our code publicly available at urlhttps://github.com/RomeoV/ml4co-competition .

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 3 of its 5 references that are in the map. First posted on arXiv 10 Feb 2022.

Builds on

3 of 5 references.

References · 3

  1. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  2. 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
  3. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 1; 2025: 1; 2026: 1.

5 papers.