Papers › Neural Combinatorial Optimization via Preference Optimization

Neural Combinatorial Optimization via Preference Optimization

10 Mar 2025arXiv:2503.07580archive 2025-07-28

Zijun Liao, Jinbiao Chen, Debing Wang, Zizhen Zhang, Jiahai Wang

Neural Combinatorial Optimization (NCO) has emerged as a promising approach for NP-hard problems. However, prevailing RL-based methods suffer from low sample efficiency due to sparse rewards and underused solutions. We propose Preference Optimization for Combinatorial Optimization (POCO), a training paradigm that leverages solution preferences via objective values. It introduces: (1) an efficient preference pair construction for better explore and exploit solutions, and (2) a novel loss function that adaptively scales gradients via objective differences, removing reliance on reward models or reference policies. Experiments on Job-Shop Scheduling (JSP), Traveling Salesman (TSP), and Flexible Job-Shop Scheduling (FJSP) show POCO outperforms state-of-the-art neural methods, reducing optimality gaps impressively with efficient inference. POCO is architecture-agnostic, enabling seamless integration with existing NCO models, and establishes preference optimization as a principled framework for combinatorial optimization.

PaperPDFCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Syntology holds a reference implementation of BOPO, generated from the paper text (not the authors' code), at level 2 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='BOPO') (how to connect); the free check have('2503.07580') needs no token.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 13 code samples harvested from 1 repository linked to this paper: 11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: found in paper text by Syntology: 13 samples from 1 repository, 11 ran (9 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

L-Z-7/BOPO found in paper text by SyntologyMITSyntology: 13 samples, 11 ran (2 instrument-failed) · 2 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested: 11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
1ran; the contract check could not run
9ran
2unverified

Licence: 2 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. For 2 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from L-Z-7/BOPO. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

L-Z-7/BOPO found in paper text by Syntology 13 samples, 11 ran (2 instrument-failed) · 2 unverified
SROLoss FJSP/sampling.py ran MIT (permissive) · 83afac5eb44353b7 · report fixture: signature info_b:Solutions/0/?, info_w:Solutions/0/? · returned Tensor · level recorded 2026-09-25
SROLoss JSP/sampling.py ran MIT (permissive) · 6037c676f6c34423 · report fixture: signature info_w:Solutions/0/?, info_l:Solutions/0/? · returned tuple · level recorded 2026-09-25
find_nearest_distances JSP/utils.py ran MIT (permissive) · d8e128a319c026ce · report fixture: signature seq:list/1/int · returned tuple · level recorded 2026-09-24
gen_fjsp_instance FJSP/inout.py ran MIT (permissive) · 74af803734a04c3f · report fixture: signature instance:DesFJSP/0/?, random:RandomState/0/? · returned ndarray · level recorded 2026-09-24
graph_edges JSP/inout.py ran MIT (permissive) · 1060d49a2d882ad8 · report fixture: signature num_j:int/0/int, num_m:int/0/int, machines:Tensor/1/int, device:str/0/str · returned Tensor · level recorded 2026-09-24
multi_head_attention in 24 papers TSP/TSPModel.py ran; the contract check could not run (RAISES) MIT (permissive) here; the stored copy is pointer only · 6dc103e776ff9eed · report fixture: signature q:Tensor/4/float, k:Tensor/4/float, v:Tensor/4/float, rank2_ninf_mask:Tensor/2/float, rank3_ninf_mask:Tensor/3/float · returned Tensor · level recorded 2026-09-22
read_basic FJSP/inout.py ran MIT (permissive) · 42c8b38938313614 · report fixture: signature f_path:str/0/str · returned tuple · level recorded 2026-09-24
read_basic JSP/inout.py ran MIT (permissive) · a71aced07e2d5109 · report fixture: signature f_path:str/0/str, sep:str/0/str, device:str/0/str · returned tuple · level recorded 2026-09-24
reshape_by_heads in 18 papers TSP/TSPModel.py ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only · 459fe521069329c6 · report fixture: signature qkv:Tensor/3/float, head_num:int/0/int · returned Tensor · level recorded 2026-09-22
shift in 22 papers
census: 5 implementations from 5 papers, 5 distinct outputs across 4 buckets, one shared input per bucket
JSP/utils.py ran MIT (permissive) · b010e092280877d0 · report fixture: signature a:ndarray/1/int, idx:int/0/int, bias:int/0/int · returned ndarray · level recorded 2026-09-25
standardize in 47 papers FJSP/inout.py ran fingerprinted MIT (permissive) · 16c504e24ee35b7e · report fixture: signature input:Tensor/2/float, dim:int/0/int, eps:float/0/float · returned Tensor · level recorded 2026-09-24
sample_training_pair FJSP/sampling.py unverified MIT (permissive) · 01597056ecf8f858 · report
solve_problem FJSP/sampling.py unverified MIT (permissive) · c2da96b9d22a09b5 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

1 assembly on this paper: 0 harvested, 1 generated.

generated Assembly for BOPO (graph method: BOPO), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 2).

label matches by construction: the code was generated for this method (not judged by a model)

  1. bopo_loss entry · level 2 · ran · 0c881380752687e8d08b27be1ec980f8fffab37926f0a7b9980ab5cb53f26599

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2503.07580") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Combinatorial OptimizationJob Shop SchedulingScheduling

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections