Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?

[Submitted on 2 Mar 2026 (v1), last revised 11 Aug 2026 (this version, v2)]

View PDF HTML (experimental)

Abstract:A key challenge in developing unified neural solvers for combinatorial optimization (CO) is the efficient generalization of models from a given set of tasks to new tasks unseen during initial training. To address this, we first establish a new GNN encoder, which uses a GCON module as a form of expressive message passing together with energy-based unsupervised loss functions. This model achieves highly competitive performance across multiple CO tasks when trained individually on each task. We then leverage knowledge from the computational reducibility literature to propose pretraining and fine-tuning strategies that transfer effectively (a) between MVC, MIS and MaxClique, and (b) in a multi-task learning setting that additionally incorporates MaxCut, MDS and graph coloring. Additionally, in a leave-one-out, multi-task learning setting, we observe that pretraining on all but one task almost always leads to faster convergence on the remaining task when fine-tuning, while avoiding negative transfer. Our findings indicate that learning common representations across multiple graph CO problems is viable through the use of expressive message passing coupled with pretraining strategies that are informed by the polynomial reducibility literature, thereby taking an important step towards enabling the development of foundational models for neural CO. We provide an open source implementation of our work at this https URL.

Submission history

From: Semih Cantürk [view email]
[v1] Mon, 2 Mar 2026 23:03:00 UTC (239 KB)
[v2] Tue, 11 Aug 2026 12:08:13 UTC (245 KB)