SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1809.03359 · 2018

Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning

arXiv · PDF · Open in the Atlas

Code that ran

1 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 0 failures of our instrument; 4 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/1809.03359.json · badge: /api/ran/1809.03359.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
qcappart/learning-DD canonical (classifier label)
classifier basis: census
1 ran · 4 no recorded run
FunctionStatusWhere it lives
find_model_file Ran
ran on a synthesized input
qcappart/learning-DD/models/maxcut-random/maxcut_evaluate_random.py
code served (permissive licence) · get_code("92076a6688eb3c6d")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned str. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import tempfile
import os

# Create a temporary directory for the test
temp_dir = tempfile.mkdtemp()

# Create a mock log file with training data
log_file_path = os.path.join(temp_dir, 'log-training.txt')
with open(log_file_path, 'w') as f:
    f.write('[DATA] 100 0.5s 0.75\n')
    f.write('[DATA] 200 1.0s 0.85\n')
    f.write('[DATA] 150 0.8s 0.90\n')

# Create a mock model file so the function's return value is valid
model_file_path = os.path.join(temp_dir, 'model_iter_150.model')
with open(model_file_path, 'w') as f:
    f.write('mock model data')

ARGS = {
    'opt': {
        'save_dir': temp_dir
    }
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
none outside the standard library — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type str — a str output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a str output the recorded ndim 0 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
gen_graph Not yet run
unverified (harvested, no recorded run)
qcappart/learning-DD/models/maxcut-random/maxcut_evaluate_random.py
code served (permissive licence) · get_code("a4cd96863cafcc86")
How it ran

no invocation recorded.

gen_graph Not yet run
unverified (harvested, no recorded run)
qcappart/learning-DD/models/maxcut-random/maxcut_training_random.py
code served (permissive licence) · get_code("a5e678f6a42649c6")
How it ran

no invocation recorded.

gen_graph Not yet run
unverified (harvested, no recorded run)
qcappart/learning-DD/models/misp-random/misp_evaluate_random.py
code served (permissive licence) · get_code("5fdc258ef71d62ec")
How it ran

no invocation recorded.

gen_graph Not yet run
unverified (harvested, no recorded run)
qcappart/learning-DD/models/misp-random/misp_training_random.py
code served (permissive licence) · get_code("9e9b108b5510419c")
How it ran

no invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 5 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Finding tight bounds on the optimal solution is a critical element of practical solution methods for discrete optimization problems. In the last decade, decision diagrams (DDs) have brought a new perspective on obtaining upper and lower bounds that can be significantly better than classical bounding mechanisms, such as linear relaxations. It is well known that the quality of the bounds achieved through this flexible bounding method is highly reliant on the ordering of variables chosen for building the diagram, and finding an ordering that optimizes standard metrics is an NP-hard problem. In this paper, we propose an innovative and generic approach based on deep reinforcement learning for obtaining an ordering for tightening the bounds obtained with relaxed and restricted DDs. We apply the approach to both the Maximum Independent Set Problem and the Maximum Cut Problem. Experimental results on synthetic instances show that the deep reinforcement learning approach, by achieving tighter objective function bounds, generally outperforms ordering methods commonly used in the literature when the distribution of instances is known. To the best knowledge of the authors, this is the first paper to apply machine learning to directly improve relaxation bounds obtained by general-purpose bounding mechanisms for combinatorial optimization problems.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1809.03359")
get_code_for_paper("1809.03359")
have("1809.03359")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1809.03359.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1809.03359.svg)](https://syntology.ai/paper/1809.03359)

Connect an agent — have() is free.