Pith. sign in

REVIEW 1 cited by

A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2601.04509 v2 pith:NZYRFEVG submitted 2026-01-08 cs.AI

A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention

classification cs.AI
keywords neuraloptimizationacrossattentionbackbonecombinatorialdualelement-centric
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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. Recent learning-based methods typically model MILP instances as variable-constraint bipartite graphs and use Graph Neural Networks (GNNs) for representation learning, yet their locality limits representation power. We propose an attention-driven neural backbone that adopts an element-centric view of variables and constraints, with dual attention performing parallel intra-type self-attention and inter-type cross-attention. Across three representative tasks at the instance, element, and solving-state levels, our model consistently outperforms conventional GNN-based architectures, highlighting attention-based, element-centric modeling as a powerful foundation for learning-enhanced combinatorial optimization.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Solving Integer Linear Programming with Parallel Tempering

    cs.LG 2026-05 unverdicted novelty 6.0

    A parallel tempering sampling method with locally-balanced proposals and penalty tempering solves ILP problems competitively with SCIP and Gurobi while showing robustness to distribution shift.