Papers › Variational Annealing on Graphs for Combinatorial Optimization

Variational Annealing on Graphs for Combinatorial Optimization

23 Nov 2023NeurIPS 2023 11arXiv:2311.14156archive 2025-07-28

Sebastian Sanokowski, Wilhelm Berghammer, Sepp Hochreiter, Sebastian Lehner

Several recent unsupervised learning methods use probabilistic approaches to solve combinatorial optimization (CO) problems based on the assumption of statistically independent solution variables. We demonstrate that this assumption imposes performance limitations in particular on difficult problem instances. Our results corroborate that an autoregressive approach which captures statistical dependencies among solution variables yields superior performance on many popular CO problems. We introduce subgraph tokenization in which the configuration of a set of solution variables is represented by a single token. This tokenization technique alleviates the drawback of the long sequential sampling procedure which is inherent to autoregressive methods without sacrificing expressivity. Importantly, we theoretically motivate an annealed entropy regularization and show empirically that it is essential for efficient and stable learning.

PaperPDFConference PDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2311.14156")

Code

Syntology Ran 7 of 16 code samples harvested from 1 repository linked to this paper; 9 have no recorded run. Of those that ran: 7 ran with no contract checked.

By repository: official repository: 16 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

ml-jku/vag-co officialmentioned in paperjax 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

16 samples harvested; 7 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7ran
9unverified

Licence: 16 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from ml-jku/vag-co. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

MVC_Energy ml-jku/vag-co/VAG_CO/EnergyFunctions/MIS.py official repository ran no licence file found · pointer only · 1e9376234eeec7f8 · report
calcEnergy ml-jku/vag-co/VAG_CO/EnergyFunctions/MIS.py official repository ran no licence file found · pointer only · a2d96c2a6684943c · report
calcEnergy ml-jku/vag-co/VAG_CO/EnergyFunctions/MaxCut.py official repository ran no licence file found · pointer only · 416ca0676ff4a352 · report
calcEnergy_sparse ml-jku/vag-co/VAG_CO/EnergyFunctions/MaxCut.py official repository ran no licence file found · pointer only · 07fa5f598e184f5d · report
compute_Energy_full_graph ml-jku/vag-co/VAG_CO/EnergyFunctions/jraphEnergy.py official repository ran no licence file found · pointer only · c60168563fd17c6c · report
compute_Energy_full_graph_np ml-jku/vag-co/VAG_CO/EnergyFunctions/jraphEnergy.py official repository ran no licence file found · pointer only · 9bd0b9def968f8a4 · report
compute_self_loop_Energy ml-jku/vag-co/VAG_CO/EnergyFunctions/jraphEnergy.py official repository ran no licence file found · pointer only · b7dd17f565a419e9 · report
AutoregressiveGreedy ml-jku/vag-co/VAG_CO/GreedyAlgorithms/GreedyGeneral.py official repository unverified no licence file found · pointer only · 27547f08c3c74fff · report
AutoregressiveGreedy_old ml-jku/vag-co/VAG_CO/GreedyAlgorithms/GreedyMaxCut.py official repository unverified no licence file found · pointer only · 8a98d582d30a1f75 · report
calc ml-jku/vag-co/VAG_CO/EnergyFunctions/calculateEnergy.py official repository unverified no licence file found · pointer only · e0333ad180fa5096 · report
calcEnergy_sparse ml-jku/vag-co/VAG_CO/EnergyFunctions/MIS.py official repository unverified no licence file found · pointer only · 5f15a847fd297cf0 · report
calc_sparse ml-jku/vag-co/VAG_CO/EnergyFunctions/calculateEnergy.py official repository unverified no licence file found · pointer only · f0c18ef0f6d9b969 · report
make_NbNt_spins ml-jku/vag-co/VAG_CO/EnergyFunctions/Masking.py official repository unverified no licence file found · pointer only · 2326be85a2c30c76 · report
mask ml-jku/vag-co/VAG_CO/EnergyFunctions/Masking.py official repository unverified no licence file found · pointer only · 8b41a6333091c869 · report
random ml-jku/vag-co/VAG_CO/GreedyAlgorithms/GreedyGeneral.py official repository unverified no licence file found · pointer only · 54144a0233d5f681 · report
random_greedy ml-jku/vag-co/VAG_CO/GreedyAlgorithms/GreedyGeneral.py official repository unverified no licence file found · pointer only · 9e0b705c7d62fbc6 · report

Tasks

Combinatorial Optimization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Entropy RegularizationSET

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