Home › Code › multi_head_attention

multi_head_attention

Syntologyentry name in harvested coderead from the graph 2026-09-24

multi_head_attention appears in the code Syntology harvested for 24 papers, as 19 distinct code bodies found in 27 places (a place is one code body under one paper). At least one of them ran in 19 of the papers; 3 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named multi_head_attention do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 13 of the 19 distinct code bodies named multi_head_attention; 6 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
4ran · our draft was wrong
4ran · fixture could not drive it
5ran
6unverified
3fingerprinted

Licence is a property of each copy, so it is counted per place: 6 of the 27 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “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, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

24 papers shown of 24, newest first; 27 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 4 papers added by Syntology; 3 papers have no page here and are shown by arXiv id only. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's 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.

PaperDateFileStatus SyntologyLicence
NCO4CVRP: Neural Combinatorial Optimization for the Capacitated Vehicle Routing Problem added by Syntology 2026-04 (from id) wjalal/pomo_beam/NEW_py_ver/CVRP/POMO/CVRPModel.py 6dc103e776ff9eed ran · fixture could not drive it no licence file found · pointer only
NCO4CVRP: Neural Combinatorial Optimization for the Capacitated Vehicle Routing Problem added by Syntology 2026-04 (from id) CIAM-Group/NCO_code/single_objective/DPN-minmaxVRP-master/nets/attention_model.py 1e5f092766104b78 unverified MIT (permissive)
RESCHED: Rethinking Flexible Job Shop Scheduling from a Transformer-based Architecture with Simplified States added by Syntology 2026-03 (from id) XiangjieXiao/ReSched/PPO/SchedulingModel.py 4b7e5c1a003881c3 ran · fixture could not drive it MIT (permissive)
Learning to Solve Orienteering Problem with Time Windows and Variable Profits added by Syntology 2026-03 (from id) SwonGao/DeCoST/DeCoST/models/SINGLEModel.py 144218ff791ec47b ran · our draft was wrong MIT (permissive)
Towards Efficient Constraint Handling in Neural Solvers for Routing Problems added by Syntology 2026-02 (from id) jieyibi/CaR-constraint/models/SINGLEModel.py 657ae188fd7e1f14 unverified MIT (permissive)
Latent Guided Sampling for Combinatorial Optimization 4 Jun 2025 SobihanSurendran/LGS/CVRP/model.py 6dc103e776ff9eed ran · fixture could not drive it no licence file found · pointer only
arXiv:2506.02935 2025-06 (from id) CIAM-Group/MTLKD/student_model/model/model.py 1f7e3986000e37af unverified MIT (permissive)
Learning to Insert for Constructive Neural Vehicle Routing Solver 20 May 2025 CIAM-Group/L2C_Insert/L2C_Insert/CVRP/Train/VRPModel.py 036b0dc86d34e889 unverified MIT (permissive)
Neural Combinatorial Optimization via Preference Optimization 10 Mar 2025 L-Z-7/BOPO/TSP/TSPModel.py 6dc103e776ff9eed ran · fixture could not drive it MIT (permissive)
Destroy and Repair Using Hyper Graphs for Routing 22 Feb 2025 ciam-group/drhg/TSP/TSPModel_DRHG.py ad3bd27f42d432bc ran no licence file found · pointer only
Neural Solver Selection for Combinatorial Optimization 13 Oct 2024 lamda-bbo/neural-solver-selection/model.py 13f7aec0cb34d440 ran MIT (permissive)
MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts 2 May 2024 RoyalSkye/Routing-MVMoE/models/MOEModel.py 18442950d6cb3a1b ran · our draft was wrong MIT (permissive)
Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalization 23 Feb 2024 feiliu36/mtnco/MTPOMO/POMO/VRPModel.py 6dc103e776ff9eed ran · fixture could not drive it MIT (permissive)
ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution 2 Feb 2024 ai4co/llm-as-hh/problems/cvrp_pomo/CVRPModel.py 6dc103e776ff9eed ran · fixture could not drive it MIT (permissive)
ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution 2 Feb 2024 ai4co/llm-as-hh/problems/cvrp_lehd/VRPModel.py 388642e538834053 ran · our draft was wrong MIT (permissive)
ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution 2 Feb 2024 ai4co/llm-as-hh/problems/tsp_lehd/TSPModel.py 3ce72bef872610ae ran MIT (permissive)
Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement 22 Oct 2023 bill-cjb/nhde/NHDE-M/TSP/source/MODEL__Actor/grouped_actors.py 63b6c1a824b8f874 ran MIT (permissive)
Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy 27 Aug 2023 gaocrr/elg/CVRP/models.py c64b244e2120dadc ran MIT (permissive)
LightGlue: Local Feature Matching at Light Speed 23 Jun 2023 fabio-sim/LightGlue-ONNX/lightglue_dynamo/models/lightglue.py 7350588d723a13e5 ran · fixture could not drive it fingerprinted Apache-2.0 (permissive)
Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization 5 Jun 2023 kaist-silab/meta-sage/Meta-SAGE/train/POMO/CVRP/2_Meta/SML_Model.py c10e17f8940e2635 unverified no licence file found · pointer only
Towards Omni-generalizable Neural Methods for Vehicle Routing Problems 31 May 2023 RoyalSkye/Omni-VRP/POMO/CVRP/CVRPModel.py 6dc103e776ff9eed ran · fixture could not drive it MIT (permissive)
Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem 19 Apr 2023 pointerformer/pointerformer/models.py c984330c9499b5d2 ran · fixture could not drive it fingerprinted no licence file found · pointer only
DevFormer: A Symmetric Transformer for Context-Aware Device Placement 26 May 2022 ai4co/reevo/problems/cvrp_lehd/VRPModel.py 388642e538834053 ran · our draft was wrong MIT (permissive)
Learning to Solve Routing Problems via Distributionally Robust Optimization 15 Feb 2022 yd-kwon/POMO/OLD_ipynb_ver/POMO_CVRP/source/MODEL__Actor/grouped_actors.py 0ccee30ad1e75edd ran · our draft was wrong fingerprinted no licence file found · pointer only
Attention Is All You Need 12 Jun 2017 Maple728/transformer/models/transformer.py 37c2f89ed7499010 unverified MIT (permissive)
arXiv:openreview_vJsJPNRFIJ Regina921/PoMtVRS/VRP100/models/MVMoEmodel.py 6dc103e776ff9eed ran · fixture could not drive it MIT (permissive)
arXiv:ijcai2024_0764 lamda-bbo/ELG/CVRP/models.py c64b244e2120dadc ran MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the 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 cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

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