The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Multi-Hop Knowledge Graph Reasoning with Reward Shaping
Open accessAbstract
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 onehop 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
(2010) · Cited by 14,134
(1999) · Cited by 12,854
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
(2013) · Cited by 5,726
Convolutional 2D Knowledge Graph Embeddings
Dettmers, T., Minervini, P., Stenetorp, P., & Riedel, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11573 · Cited by 2,486
Embedding Entities and Relations for Learning and Inference in Knowledge Bases
Yang, B., Yih, W.-T., He, X., Gao, J., & Deng, L. (2014) · arXiv · doi:10.48550/arxiv.1412.6575 · Cited by 2,252
Complex Embeddings for Simple Link Prediction
Trouillon, T., Welbl, J., Riedel, S., Gaussier, É., & Bouchard, G. (2016) · arXiv · doi:10.48550/arxiv.1606.06357 · Cited by 2,100
Policy Invariance Under Reward Transformations: Theory and Application to Reward Shaping
Ng, A. Y., Harada, D., & Russell, S. (1999) · Cited by 1,744
Reasoning With Neural Tensor Networks for Knowledge Base Completion
Socher, R., Chen, D., Manning, C. D., & Ng, A. Y. (2013) · Cited by 1,667
Self-citationSemantic Parsing on Freebase from Question-Answer Pairs
Berant, J., Chou, A., Frostig, R., & Liang, P. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1160 · Cited by 1,517
Reinforcement Learning: An Introduction
(1998) · Kybernetes · doi:10.1108/k.1998.27.9.1093.3 · Cited by 1,472
Sequence Level Training with Recurrent Neural Networks
Ranzato, M., Chopra, S., Auli, M., & Zaremba, W. (2015) · arXiv · doi:10.48550/arxiv.1511.06732 · Cited by 1,426
A Deep Reinforced Model for Abstractive Summarization
Paulus, R., Xiong, C., & Socher, R. (2017) · arXiv · doi:10.48550/arxiv.1705.04304 · Cited by 1,182
Self-citationSimple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Reinforcement Learning · doi:10.1007/978-1-4615-3618-5_2 · Cited by 903
DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning
Xiong, W., Hoang, T., & Wang, W. Y. (2017) · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d17-1060 · Cited by 812
Representing Text for Joint Embedding of Text and Knowledge Bases
Toutanova, K., Chen, D., Pantel, P., Poon, H., Choudhury, P., & Gamon, M. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1174 · Cited by 750
Convolutional 2D Knowledge Graph Embeddings
Dettmers, T., Minervini, P., Stenetorp, P., & Riedel, S. (2017) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.833287 · Cited by 639
Random Walk Inference and Learning in A Large Scale Knowledge Base
Lao, N., Mitchell, T. M., & Cohen, W. W. (2018) · Figshare · doi:10.1184/r1/6476267 · Cited by 482
Das, R., Dhuliawala, S., Zaheer, M., Vilnis, L., Durugkar, I., Krishnamurthy, A., Smola, A. J., & McCallum, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.05851 · Cited by 374
Traversing Knowledge Graphs in Vector Space
Guu, K., Miller, J., & Liang, P. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1038 · Cited by 319
Statistical predicate invention
Kok, S., & Domingos, P. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273551 · Cited by 259
Chains of Reasoning over Entities, Relations, and Text using Recurrent Neural Networks
Das, R., Neelakantan, A., Belanger, D., & McCallum, A. (2017) · Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers · doi:10.18653/v1/e17-1013 · Cited by 231
Neural Generative Question Answering
Yin, J., Jiang, X., Lu, Z., Shang, L., Li, H., & Li, X. (2016) · Proceedings of the Workshop on Human-Computer Question Answering · doi:10.18653/v1/w16-0106 · Cited by 186
Learning Symmetric Collaborative Dialogue Agents with Dynamic Knowledge Graph Embeddings
He, H., Balakrishnan, A., Eric, M., & Liang, P. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1162 · Cited by 175
From Language to Programs: Bridging Reinforcement Learning and Maximum Marginal Likelihood
Guu, K., Pasupat, P., Liu, E., & Liang, P. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1097 · Cited by 158
Variational Knowledge Graph Reasoning
Chen, W., Xiong, W., Yan, X., & Wang, W. Y. (2018) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/n18-1165 · Cited by 149
Compositional Learning of Embeddings for Relation Paths in Knowledge Base and Text
Toutanova, K., Lin, V., Yih, W.-T., Poon, H., & Quirk, C. (2016) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p16-1136 · Cited by 148
Liu, Z., Xiong, C., Sun, M., & Liu, Z. (2018) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p18-1223 · Cited by 148
Self-citationImproving Learning and Inference in a Large Knowledge-Base using Latent Syntactic Cues
Gardner, M., Talukdar, P. P., Kisiel, B., & Mitchell, T. M. (2013) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d13-1080 · Cited by 93
Reading The Web with Learned Syntactic-Semantic Inference Rules
Lao, N., Subramanya, A., Pereira, F. M. B., & Cohen, W. W. (2018) · doi:10.1184/r1/6476270 · Cited by 73
Agent-Aware Dropout DQN for Safe and Efficient On-line Dialogue Policy Learning
Chen, L., Zhou, X., Chang, C., Yang, R., & Yu, K. (2017) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d17-1260 · Cited by 49
Ruminating Reader: Reasoning with Gated Multi-hop Attention
Gong, Y., & Bowman, S. R. (2018) · Workshop on Machine Reading for Question Answering (MRQA) · doi:10.18653/v1/w18-2601 · Cited by 46
ReinforceWalk: Learning to Walk in Graph with Monte Carlo Tree SearchPreprint
Shen, Y., Chen, J., Huang, P.-S., Guo, Y., & Gao, J. (2018) · arXiv (Cornell University) · Cited by 20
Cited by
A Survey on Knowledge Graphs: Representation, Acquisition, and Applications
Ji, S., Pan, S., Cambria, E., Marttinen, P., & Yu, P. S. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3070843 · Cited by 2,947
A review: Knowledge reasoning over knowledge graph
Chen, X., Jia, S., & Xiang, Y. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112948 · Cited by 1,035
Transfer Learning in Deep Reinforcement Learning: A Survey
Zhu, Z., Lin, K., Jain, A. K., & Zhou, J. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3292075 · Cited by 861
“Examples include learning from expert demonstrations for Spoken Dialogue Systems [154], VQA [152]; or reward shaping for Sequence Generation [155], Spoken Dialogue Systems [80], QA [81], [156], and Image Caption [153], or transferring policies for Structured Prediction [157] and VQA [158].”
BackgroundMethodA Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Liang, K., Meng, L., Liu, M., Liu, Y., Tu, W., Wang, S., Zhou, S., Liu, X., Sun, F., & He, K. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3417451 · Cited by 553
Reinforcement Knowledge Graph Reasoning for Explainable Recommendation
Xian, Y., Fu, Z., Muthukrishnan, S., de Melo, G., & Zhang, Y. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331203 · Cited by 446
Metadata
- Authors
- Lin, X. V., Socher, R., & Xiong, C.
- Venue
- Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
- Published
- 2018
- Pages
- 3243-3253
- OpenAlex
- W2889344053
- Cited by
- 399
- References
- 38
- FWCI
- 15.40
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.