Reformulation-Contrastive Learning for Mixed Integer Programs

arXiv:2610.00730v1 Announce Type: new Abstract: 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.

Related

• Fusing Backdoors, Machine Learning, and Optimization for Large-Scale Parametric Mixed-Integer Programs
• SHSP: Structure-Aware Hierarchical Solution Prediction for Mixed-Integer Linear Programming
• Feature Augmentation of GNNs for ILPs: Local Uniqueness Suffices
• Scalable Decision-Focused Learning through Cost-Sensitive Regression

Source: arXiv cs.LG | 2026-10-02