arXiv Machine Learning
Jun 18
FORGE: Foundational Optimization Representations from Graph Embeddings
arXiv:2508. 20330v5 Announce Type: replace Abstract: Combinatorial optimization problems are ubiquitous in science and engineering.
A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention
arXiv:2601. 04509v2 Announce Type: replace Abstract: Mixed-integer linear programming (MILP) is a foundational framework for combinatorial optimization across science and engineering, but remains hard to solve at scale due to NP-hardness.
Related stories
arXiv AI
Jun 11
GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning
arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).
arXiv Machine Learning
Jun 2
Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
arXiv:2605. 09382v2 Announce Type: replace Abstract: The Linear Assignment Problem is a fundamental combinatorial optimization task where classical exact solvers ensure optimality but suffer from an $\mathcal{O}(N^{3})$ bottleneck, while recent neural approximations struggle with scalability and exactness.
arXiv Machine Learning
Aug 11
Input convex neural networks as surrogates in mathematical optimisation
arXiv:2608. 09707v1 Announce Type: cross Abstract: Embedding trained neural networks as surrogates within optimisation problems is an established practice in operations research.
arXiv AI
Aug 12
Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?
arXiv:2603. 02462v2 Announce Type: replace-cross 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.
arXiv Machine Learning
Jul 28
WeCon: An Efficient Weight-Conditioned Neural Solver for Multi-Objective Combinatorial Optimization Problems
arXiv:2605. 22876v2 Announce Type: replace Abstract: Existing neural solvers for Multi-Objective Combinatorial Optimization Problems (MOCOPs) commonly adopt decomposition-based strategies that scalarize a MOCOP into multiple subproblems associated with distinct weight vectors.
arXiv AI
Jul 14
Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm
arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.
arXiv Machine Learning
Jun 15
Neural Slack Variables for Shape Constraints
arXiv:2606. 13803v1 Announce Type: new Abstract: Enforcing functional inequality constraints such as monotonicity and convexity in neural networks is a fundamental challenge in many industrial and scientific applications.
arXiv Machine Learning
Jul 21
A Weisfeiler-Leman Characterization of Global-Attention Graph Transformers for Mixed-Integer Linear Programs
arXiv:2607. 17570v1 Announce Type: new Abstract: Graph foundation models (GFMs) with global attention are increasingly used to represent mixed-integer linear programs (MILPs), aiming to capture structure beyond the locality of standard graph neural networks.
arXiv AI
Aug 10
Not All Problems Are Best Modeled as MILP: A DSL-Centric Framework for Flexible and Accurate Optimization Modeling
arXiv:2608. 07040v1 Announce Type: new Abstract: Solving combinatorial optimization problems (COPs) requires not only efficient algorithms but also carefully crafted formulations.
arXiv AI
Jun 4
Learning Admissible Heuristics via Cost Partitioning
arXiv:2606. 04597v1 Announce Type: new Abstract: Admissible heuristics are essential for optimal planning, yet learning them remains challenging due to the risk of overestimation.
arXiv AI
Jun 9
Capacity-Controlled Global Attention for Graph Transformers
arXiv:2604. 17324v2 Announce Type: replace-cross Abstract: Global self-attention drives modern graph transformers, yet the softmax at its core imposes a structural constraint rarely examined directly: every attention row is non-negative and sums to one, so each per-head output is a mass-conserving convex combination of value vectors.