Is multi-hop reasoning really explainable? Towards benchmarking reasoning interpretability

• Main Authors: LV, Xin, CAO, Yixin, HOU, Lei, LI, Juanzi, LIU, Zhiyuan, ZHANG, Yichi, DAI, Zelin
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2021
• Subjects: Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/7317; https://ink.library.smu.edu.sg/context/sis_research/article/8320/viewcontent/2021.emnlp_main.700.pdf
• Institution: Singapore Management University

Multi-hop reasoning has been widely studied in recent years to obtain more interpretable link prediction. However, we find in experiments that many paths given by these models are actually unreasonable, while little work has been done on interpretability evaluation for them. In this paper, we propose a unified framework to quantitatively evaluate the interpretability of multi-hop reasoning models so as to advance their development. In specific, we define three metrics, including path recall, local interpretability, and global interpretability for evaluation, and design an approximate strategy to calculate these metrics using the interpretability scores of rules. We manually annotate all possible rules and establish a benchmark. In experiments, we verify the effectiveness of our benchmark. Besides, we run nine representative baselines on our benchmark, and the experimental results show that the interpretability of current multi-hop reasoning models is less satisfactory and is 51.7% lower than the upper bound given by our benchmark. Moreover, the rule-based models outperform the multi-hop reasoning models in terms of performance and interpretability, which points to a direction for future research, i.e., how to better incorporate rule information into the multi-hop reasoning model. We will publish our codes and datasets upon acceptance.