Papers › Multi-Hop Knowledge Graph Reasoning with Reward Shaping

Multi-Hop Knowledge Graph Reasoning with Reward Shaping

31 Aug 2018EMNLP 2018 10arXiv:1808.10568archive 2025-07-28

Xi Victoria Lin, Richard Socher, Caiming Xiong

Multi-hop reasoning is an effective approach for query answering (QA) over incomplete knowledge graphs (KGs). The problem can be formulated in a reinforcement learning (RL) setup, where a policy-based agent sequentially extends its inference path until it reaches a target. However, in an incomplete KG environment, the agent receives low-quality rewards corrupted by false negatives in the training data, which harms generalization at test time. Furthermore, since no golden action sequence is used for training, the agent can be misled by spurious search trajectories that incidentally lead to the correct answer. We propose two modeling advances to address both issues: (1) we reduce the impact of false negative supervision by adopting a pretrained one-hop embedding model to estimate the reward of unobserved facts; (2) we counter the sensitivity to spurious paths of on-policy RL by forcing the agent to explore a diverse set of paths using randomly generated edge masks. Our approach significantly improves over existing path-based KGQA models on several benchmark datasets and is comparable or better than embedding-based models.

PaperPDFConference PDFCodeCode Syntology ran

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 12 code samples harvested from 2 repositories linked to this paper: 12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 11 samples from 1 repository, 11 ran (11 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 1 sample from 1 repository, 1 ran (1 with no instrument failure; 0 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.

No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:

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

salesforce/MultiHopKG officialmentioned on GitHubpytorchBSD-3-ClauseSyntology: 11 samples, 11 ran (0 instrument-failed) · 0 unverified report
kingsaint/InductiveExplainableLinkPrediction mentioned on GitHubpytorchBSD-3-ClauseSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
kracr/document-level-relation-extraction mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Modeling Relational Data with Graph Convolutional Networks (arXiv:1703.06103; that paper's own run record: 18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

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

12ran

Licence: 1 of the 12 samples is 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 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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.

salesforce/MultiHopKG official repository 11 samples, 11 ran (0 instrument-failed) · 0 unverified
batch_lookup src/utils/ops.py ran BSD-3-Clause (permissive) · bf5d078656e9a5cb · report fixture: signature M:Tensor/2/float, idx:Tensor/2/int, vector_output:bool/0/bool · returned Tensor · level recorded 2026-09-25
change_to_test_model_path src/data_utils.py ran fingerprinted BSD-3-Clause (permissive) · cfe498d227766f79 · report fixture: signature dataset:str/0/str, model_path:str/0/str · returned str · level recorded 2026-09-25
check_answer_ratio src/data_utils.py ran BSD-3-Clause (permissive) · 10c22da7cb9db158 · report fixture: signature examples:list/1/tuple · returned float · level recorded 2026-09-25
check_relation_answer_ratio src/data_utils.py ran BSD-3-Clause (permissive) · a7e3705996bcffee · report fixture: signature input_file:str/0/str, kg:MinimalKG/0/? · returned dict · level recorded 2026-09-25
compute_venn_areas src/error_analysis/analysis_modules.py ran BSD-3-Clause (permissive) · 84a0e853fae6b04f · report fixture: signature model_error_list:list/1/ModelErrors · returned dict · level recorded 2026-09-25
convert_to_dist src/utils/ops.py ran fingerprinted BSD-3-Clause (permissive) · 788b295e650aa151 · report fixture: signature x:Tensor/2/float · returned Tensor · level recorded 2026-09-25
entropy in 112 papers
census: 22 implementations from 25 papers, 16 distinct outputs across 4 buckets, one shared input per bucket
src/utils/ops.py ran fingerprinted BSD-3-Clause (permissive) · 84a908f10b383452 · report fixture: signature p:Tensor/2/float · returned Tensor · level recorded 2026-09-25
get_complex_kg_state_dict src/emb/fact_network.py ran BSD-3-Clause (permissive) · f19a8b7eac90f996 · report fixture: signature state_dict:dict/0/? · returned dict · level recorded 2026-09-25
get_conve_kg_state_dict src/emb/fact_network.py ran BSD-3-Clause (permissive) · 54cd6b30f57076ba · report fixture: signature state_dict:dict/0/? · returned dict · level recorded 2026-09-25
get_conve_nn_state_dict src/emb/fact_network.py ran BSD-3-Clause (permissive) · 2d2c990dd61cae71 · report fixture: signature state_dict:dict/0/? · returned dict · level recorded 2026-09-25
visualize_step src/utils/vis.py ran BSD-3-Clause (permissive) · cde5ea85581be0d2 · report fixture: signature action_dist:ndarray/1/float, e:int/0/int, action_space:list/1/str, plot:Axes/0/? · returned AxesImage · level recorded 2026-09-25
kingsaint/InductiveExplainableLinkPrediction community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
check_relation_answer_ratio src/data_utils.py ran BSD-3-Clause recorded; this copy not marked cleared · pointer only · 567cf7c18073ed45 · report fixture: signature input_file:str/0/str, kg:KnowledgeGraph/0/? · returned dict · level recorded 2026-09-26

Tasks

Knowledge Graph EmbeddingsKnowledge GraphsReinforcement LearningReinforcement Learning (RL)

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