Sonia Vanier, Clément Elliker, Mathis Le Bail, Ousema Bouaneni, Maël Jenny
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Mixed-integer linear programs (MILP) model many real-world decision problems, motivating machine-learning methods that exploit recurring structure to accelerate MILP solving. MILPs can admit many equivalent formulations: integrality-preserving changes of variables and the addition of redundant constraints can alter their formulations while preserving the optimization problem. We leverage these reformulations as a source of self-supervision for learning general-purpose representations of MILP variables and constraints. We characterize the affine reformulations that are valid for every input instance, and distinguish re-descriptions, which leave variables unchanged, from substitutions, which transform them predictably. Building on equivariant self-supervised learning, we introduce ReMILP (reformulation-contrastive MILP representation learning), which jointly trains a graph neural network and a hypernetwork to predict how variable embeddings transform under changes of variables. Without solver-derived labels, ReMILP learns representations that exhibit the intended invariance and equivariance on unseen problem classes. Across binary solution, constraint activity and integrality gap prediction, these representations carry task-relevant information when frozen and provide a useful initialization for fine-tuning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2610.00730")
get_code_for_paper("2610.00730")
have("2610.00730")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2610.00730.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2610.00730)
Connect an agent — have() is free.