The reviewed record of science sign in
Pith

arxiv: 2202.04910 · v1 · pith:OGQ5AZYD · submitted 2022-02-10 · cs.LG · math.OC

Instance-wise algorithm configuration with graph neural networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:OGQ5AZYDrecord.jsonopen to challenge →

classification cs.LG math.OC
keywords configurationsolvertaskcompetitiongoodgraphinstancesleaderboard
0
0 comments X
read the original abstract

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 \url{https://github.com/RomeoV/ml4co-competition} .

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMs

    cs.LG 2026-06 unverdicted novelty 6.0

    GRIMIP integrates LLMs as probabilistic surrogates inside Bayesian optimization to perform instance-specific MIP solver configuration and reports over 40% reduction in primal-dual integral on hard benchmark instances.