Cited by 29Topic ModelingAdvanced Graph Neural NetworksMultimodal Machine Learning Applications

CGKPN: Cross-Graph Knowledge Propagation Network with Adaptive Connection for Reasoning-Based Machine Reading Comprehension

Open access
Zhao, Zhuo, Zhou, Guangyou, Xie, Zhiwen, Wu, Lingfei, Huang, Jimmy Xiangji·2024·ACM Transactions on Intelligent Systems and Technology

Abstract

The task of machine reading comprehension (MRC) is to enable machine to read and understand a piece of text and then answer the corresponding question correctly. This task requires machine to not only be able to perform semantic understanding but also possess logical reasoning capabilities. Just like human reading, it involves thinking about the text from two interacting perspectives of semantics and logic. However, previous methods based on reading comprehension either consider only the logical structure of the text or only the semantic structure of the text and cannot simultaneously balance semantic understanding and logical reasoning. This single form of reasoning cannot make the machine fully understand the meaning of the text. Additionally, the issue of sparsity in composition presents a significant challenge for models that rely on graph-based reasoning. To this end, a cross-graph knowledge propagation network (CGKPN) with adaptive connection is presented to address the above issues. The model first performs self-view node embedding on the constructed logical graph and semantic graph to update the representations of the graphs. Specifically, a relevance matrix between nodes is introduced to adaptively adjust node connections in response to the challenge posed by sparse graph. Subsequently, CGKPN conducts cross-graph knowledge propagation on nodes that are identical in both graphs, effectively resolving conflicts arising from identical nodes in different views, and enabling the model to better integrate the logical and semantic relationships of the text through efficient interaction. Experiments on the two MRC datasets ReClor and LogiQA indicate the superior performance of our proposed model CGKPN compared to other existing baselines.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3658673

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 17

  1. Tom Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared D Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. 2020. Language models are few-shot learners. Advances in neural information processing systems 33 (2020), 1877-1901.
  2. Deng Cai and Wai Lam. 2020. Graph transformer for graph-to-sequence learning. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34. 7464-7471.
  3. Dheeru Dua, Yizhong Wang, Pradeep Dasigi, Gabriel Stanovsky, Sameer Singh, and Matt Gardner. 2019. DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphs. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 2368-2378.
  4. Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. 2017. Neural message passing for quantum chemistry. In International conference on machine learning. PMLR, 1263-1272.
  5. Edward J Hu, yelong shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. 2022. LoRA: Low-Rank Adaptation of Large Language Models. In International Conference on Learning Representations.
  6. Diederick P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In Proceedings of the 3rd International Conference on Learning Representations (ICLR).
  7. Yuxuan Lai, Yansong Feng, Xiaohan Yu, Zheng Wang, Kun Xu, and Dongyan Zhao. 2019. Lattice cnns for matching based chinese question answering. In Proceedings of the AAAI conference on artificial intelligence, Vol. 33. 6634-6641.
  8. Jian Liu, Leyang Cui, Hanmeng Liu, Dandan Huang, Yile Wang, and Yue Zhang. 2021. LogiQA: a challenge dataset for machine reading comprehension with logical reasoning. In Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence. 3622-3628.
  9. Siru Ouyang, Zhuosheng Zhang, and Hai Zhao. 2021. Fact-driven logical reasoning. arXiv:2105.10334 · arXiv
  10. Ankit Pal, Logesh Kumar Umapathi, and Malaikannan Sankarasubbu. 2022. MedMCQA: A large-scale multi-subject multi-choice dataset for medical domain question answering. In Conference on Health, Inference, and Learning. PMLR, 248-260.
  11. Minjoon Seo, Aniruddha Kembhavi, Ali Farhadi, and Hannaneh Hajishirzi. 2017. Bidirectional Attention Flow for Machine Comprehen- sion. In Proceedings of International Conference on Learning Representations.
  12. Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, and Yoshua Bengio. 2018. Graph Attention Networks. In International Conference on Learning Representations.
  13. Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Carbonell, Russ R Salakhutdinov, and Quoc V Le. 2019. Xlnet: Generalized autoregressive pretraining for language understanding. Advances in neural information processing systems 32 (2019).
  14. Weihao Yu, Zihang Jiang, Yanfei Dong, and Jiashi Feng. 2020. ReClor: A Reading Comprehension Dataset Requiring Logical Reasoning. In International Conference on Learning Representations.
  15. Zhuosheng Zhang, Yuwei Wu, Junru Zhou, Sufeng Duan, Hai Zhao, and Rui Wang. 2020. SG-Net: Syntax-guided machine reading comprehension. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34. 9636-9643.
  16. Zhuosheng Zhang, Junjie Yang, and Hai Zhao. 2021. Retrospective reader for machine reading comprehension. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35. 14506-14514.
  17. Chen Zheng and Parisa Kordjamshidi. 2022. Dynamic Relevance Graph Network for Knowledge-Aware Question Answering. In Proceedings of the 29th International Conference on Computational Linguistics. 1357-1366.

Cited by

Sorted by citations

Authors
Zhao, Z., Zhou, G., Xie, Z., Wu, L., & Huang, J. X.
Affiliations
  • Central China Normal University (CN)
  • Wuhan University (CN)
  • Pinterest (United States) (US)
  • York University (CA)
Venue
ACM Transactions on Intelligent Systems and Technology
Published
2024-06-28
Volume
15
Issue
4
Pages
1-24
ISSN
  • 2157-6904 (ISSN-L)
  • 2157-6912
OpenAlex
W4394877201
Cited by
29
References
35
Citations by year
2026: 7 · 2025: 14 · 2024: 8
FWCI
4.29
Type
journal article
Language
en
Open access
Locations
ACM Transactions on Intelligent Systems and Technology (publishedVersion)
Funders
  • National Natural Science Foundation of China (62377021)
  • Fundamental Research Funds for the Central Universities, China (CCNU22QN015)
  • Natural Science Foundation of Hubei Province for Distinguished Young Scholars (2023AFA096)
  • Wuhan Knowledge Innovation Project (2022010801010278)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Multimodal Machine Learning Applications
Keywords
machine reading comprehension, semantic networks, node embeddings, graph sparsity

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