TY - GEN
T1 - GenBoost
T2 - 29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023
AU - Cheng, Zhen
AU - Niu, Jianwei
AU - Mo, Shasha
AU - Chen, Jia
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Multi-hop question answering over incomplete knowledge graphs involves iteratively reasoning on the provided question and graph to find answers, while also tackling the inherent sparsity problem in the graph. Walk-based methods transform the reasoning process into a graph traversal task; however, they encounter challenges in convergence and stability due to the extensive action space and sensitivity to missing triples. On the other hand, embedding-based methods address the problem of missing triples but compromise interpretability in answer selection because of their black-box nature. We present GenBoost, a Generate-then-Boost framework for generative reasoning. By transforming the question-answering task into an inference path generation task, GenBoost effectively addresses existing limitations and offers a more efficient and interpretable approach for answer selection. GenBoost possesses two key features: (1) The reasoning procedure does not explicitly rely on the existing triples in the knowledge graph. By combining graph traversal and link prediction, our approach mitigates the impact of knowledge graph incompleteness. (2) Each entity in the reasoning path is generated autoregressively, providing insights into the decision-making process during multi-hop reasoning and enhancing interpretability. Extensive experiments conducted on incomplete knowledge graphs have demonstrated the effectiveness of our approach.
AB - Multi-hop question answering over incomplete knowledge graphs involves iteratively reasoning on the provided question and graph to find answers, while also tackling the inherent sparsity problem in the graph. Walk-based methods transform the reasoning process into a graph traversal task; however, they encounter challenges in convergence and stability due to the extensive action space and sensitivity to missing triples. On the other hand, embedding-based methods address the problem of missing triples but compromise interpretability in answer selection because of their black-box nature. We present GenBoost, a Generate-then-Boost framework for generative reasoning. By transforming the question-answering task into an inference path generation task, GenBoost effectively addresses existing limitations and offers a more efficient and interpretable approach for answer selection. GenBoost possesses two key features: (1) The reasoning procedure does not explicitly rely on the existing triples in the knowledge graph. By combining graph traversal and link prediction, our approach mitigates the impact of knowledge graph incompleteness. (2) Each entity in the reasoning path is generated autoregressively, providing insights into the decision-making process during multi-hop reasoning and enhancing interpretability. Extensive experiments conducted on incomplete knowledge graphs have demonstrated the effectiveness of our approach.
KW - generative reasoning
KW - information retrieval
KW - knowledge graph
KW - multi-hop question answering
KW - weak supervision
UR - https://www.scopus.com/pages/publications/85190274919
U2 - 10.1109/ICPADS60453.2023.00166
DO - 10.1109/ICPADS60453.2023.00166
M3 - 会议稿件
AN - SCOPUS:85190274919
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 1131
EP - 1138
BT - Proceedings - 2023 IEEE 29th International Conference on Parallel and Distributed Systems, ICPADS 2023
PB - IEEE Computer Society
Y2 - 17 December 2023 through 21 December 2023
ER -