View PDF HTML (experimental)

Abstract:Combinatorial optimization problems are ubiquitous in science and engineering. Still, learning-based approaches to accelerate combinatorial optimization often require solving a large number of difficult instances to collect training data, incurring significant computational cost. Existing learning-based methods require training dedicated models for each problem distribution, for each downstream task, severely limiting their scalability and generalization. We introduce Forge: Foundational Optimization Representations from Graph Embeddings, a framework that pre-trains a vector-quantized graph autoencoder on a large, diverse collection of mixed-integer programming (MIP) instances in an unsupervised manner, without relying on optimization solvers or optimal solutions. Vector quantization produces discrete code assignments that serve as a vocabulary for representing optimization instances. We evaluate Forge in both unsupervised and supervised settings. In the unsupervised setting, Forge embeddings effectively cluster unseen instances across problem domains and sizes. In the supervised setting, we fine-tune Forge embeddings and show that a single pre-trained model helps predicting both the integrality gap for cut-generation and variable hints for search guidance across multiple problem and size distributions. In both tasks, we improve the performance of a commercial optimization solver and outperform state-of-the-art learning-based methods. Finally, we open-source our training code, pre-trained Forge weights, and embeddings for multiple MIP distributions to foster further research in representation learning for optimization problems this https URL

Submission history

From: Zohair Shafi [view email]
[v1] Thu, 28 Aug 2025 00:15:57 UTC (3,149 KB)
[v2] Fri, 29 Aug 2025 16:55:40 UTC (3,148 KB)
[v3] Mon, 1 Sep 2025 01:01:53 UTC (3,148 KB)
[v4] Wed, 24 Sep 2025 15:30:04 UTC (4,996 KB)
[v5] Tue, 16 Jun 2026 20:34:24 UTC (5,657 KB)