Papers › LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation

LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation

20 May 2022arXiv:2205.10106archive 2025-07-28

David Ireland, Giovanni Montana

Combinatorial Optimisation problems arise in several application domains and are often formulated in terms of graphs. Many of these problems are NP-hard, but exact solutions are not always needed. Several heuristics have been developed to provide near-optimal solutions; however, they do not typically scale well with the size of the graph. We propose a low-complexity approach for identifying a (possibly much smaller) subgraph of the original graph where the heuristics can be run in reasonable time and with a high likelihood of finding a global near-optimal solution. The core component of our approach is LeNSE, a reinforcement learning algorithm that learns how to navigate the space of possible subgraphs using an Euclidean subgraph embedding as its map. To solve CO problems, LeNSE is provided with a discriminative embedding trained using any existing heuristics using only on a small portion of the original graph. When tested on three problems (vertex cover, max-cut and influence maximisation) using real graphs with up to 10 million edges, LeNSE identifies small subgraphs yielding solutions comparable to those found by running the heuristics on the entire graph, but at a fraction of the total run time.

PaperPDFCodeCode 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.

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

Code

Syntology 20 code samples harvested from 1 repository linked to this paper: 11 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 9 unverified. Where Syntology's instrument failed: 5 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: official repository: 20 samples from 1 repository, 11 ran (5 with no instrument failure; 6 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-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

davidireland3/lense officialmentioned in papermentioned on GitHubpytorchSyntology: 20 samples, 11 ran (6 instrument-failed) · 9 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

20 samples harvested: 11 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 9 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.

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

Licence: 20 of the 20 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 davidireland3/lense. “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.

davidireland3/lense official repository 20 samples, 11 ran (6 instrument-failed) · 9 unverified
Worker IM/environment.py ran no licence file found · pointer only · 3e065407364bc76f · report fixture: returned Worker · level recorded 2026-09-22
generate_rr IM/environment.py ran · honoured contract no licence file found · pointer only · 8b977e858e065127 · report fixture: signature v:int/0/int, model:str/0/str, graph:Graph/0/? · returned list · level recorded 2026-09-22
generate_rr_ic IM/environment.py ran · honoured contract no licence file found · pointer only · bfac2181c831ea72 · report fixture: signature node:int/0/int, graph:Graph/0/? · returned list · level recorded 2026-09-22
generate_rr_lt IM/environment.py ran · honoured contract no licence file found · pointer only · b47c4238e4bc15f3 · report fixture: signature node:int/0/int, graph:Graph/0/? · returned list · level recorded 2026-09-22
get_graph in 15 papers IM/environment.py ran · our draft was wrong no licence file found · pointer only · d43be97e1132fc8f · report fixture: signature network:DiGraph/0/? · returned tuple · level recorded 2026-09-22
logcnk IM/environment.py ran · honoured contract fingerprinted no licence file found · pointer only · 9d331a19f8957fa6 · report fixture: signature n:int/0/int, k:int/0/int · returned float · level recorded 2026-09-22
make_graph_features_for_encoder IM/environment.py ran · our draft was wrong no licence file found · pointer only · 90d49c367c418c13 · report fixture: signature graph:DiGraph/0/?, graph_name:str/0/str · returned dict · level recorded 2026-09-22
node_selection IM/environment.py ran · our draft was wrong no licence file found · pointer only · 23c3ca8a0aef28fd · report fixture: signature R:list/1/list, k:int/0/int, node_num:int/0/int · returned tuple · level recorded 2026-09-22
relabel_edgelist IM/environment.py ran; the contract check could not run (RAISES) fingerprinted no licence file found · pointer only · c1ba64834670d871 · report fixture: signature roots:list/1/int, dests:list/1/int, unique:list/1/int · returned tuple · level recorded 2026-09-22
relabel_graph IM/environment.py ran · our draft was wrong no licence file found · pointer only · fda53e336a8bdbfa · report fixture: signature graph:Graph/0/?, return_reverse_transformation_dic:bool/0/bool, return_forward_transformation_dic:bool/0/bool · returned tuple · level recorded 2026-09-22
sampling in 26 papers IM/environment.py ran · our draft was wrong no licence file found · pointer only · 46936d1547cdad31 · report fixture: signature epsoid:float/0/float, l:int/0/int, node_num:int/0/int, seed_size:int/0/int, worker:list/1/empty, graph_:SimpleGraph/0/?, model:str/0/str · returned list · level recorded 2026-09-24
BaseEnvironment IM/environment.py unverified no licence file found · pointer only · ac916420d1fd853a · report
Graph in 18 papers IM/environment.py unverified no licence file found · pointer only · 615fee04c551f7eb · report
GraphModification IM/environment.py unverified no licence file found · pointer only · 97cd6b4c29a422a6 · report
GuidedExplorationEnv IM/environment.py unverified no licence file found · pointer only · 78b0e7b7e4da9f30 · report
create_worker IM/environment.py unverified no licence file found · pointer only · e027d64126246691 · report
expected_spread IM/environment.py unverified no licence file found · pointer only · 596d1f7c21defb6c · report
finish_worker IM/environment.py unverified no licence file found · pointer only · 5d2523ccb379f385 · report
imm IM/environment.py unverified no licence file found · pointer only · e202328780981f8d · report
spread IM/environment.py unverified no licence file found · pointer only · 591f1210480b0800 · 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. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

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

harvested Assembly for LeNSE (graph method: LeNSE). 20 bricks; individually on a fixture: 11 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 9 unverified. The assembly has not been run end-to-end.

  1. GuidedExplorationEnv entry · level 0 · unverified · 78b0e7b7e4da9f30
  2. GraphModification helper · level 0 · unverified · 97cd6b4c29a422a6
  3. expected_spread helper · level 0 · unverified · 596d1f7c21defb6c
  4. imm helper · level 0 · unverified · e202328780981f8d
  5. BaseEnvironment helper · level 0 · unverified · ac916420d1fd853a
  6. spread helper · level 0 · unverified · 591f1210480b0800
  7. get_graph helper · level 1 · ran · our draft was wrong · d43be97e1132fc8f
  8. node_selection helper · level 1 · ran · our draft was wrong · 23c3ca8a0aef28fd
  9. sampling helper · level 1 · ran · our draft was wrong · 46936d1547cdad31
  10. make_graph_features_for_encoder helper · level 1 · ran · our draft was wrong · 90d49c367c418c13
  11. relabel_edgelist helper · level 1 · ran; the contract check could not run (RAISES) · c1ba64834670d871
  12. relabel_graph helper · level 1 · ran · our draft was wrong · fda53e336a8bdbfa
  13. Graph helper · level 0 · unverified · 615fee04c551f7eb
  14. create_worker helper · level 0 · unverified · e027d64126246691
  15. finish_worker helper · level 0 · unverified · 5d2523ccb379f385
  16. logcnk helper · level 1 · ran · honoured contract · 9d331a19f8957fa6
  17. Worker helper · level 1 · ran · 3e065407364bc76f
  18. generate_rr helper · level 1 · ran · honoured contract · 8b977e858e065127
  19. generate_rr_ic helper · level 1 · ran · honoured contract · bfac2181c831ea72
  20. generate_rr_lt helper · level 1 · ran · honoured contract · b47c4238e4bc15f3

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="2205.10106") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Navigate

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