mlsanityData to 7 Oct 2026

Natural Logic-guided Autoregressive Multi-hop Document Retrieval for Fact Verification

arXiv 2212.05276 ↗First posted 10 Dec 2022cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

A key component of fact verification is thevevidence retrieval, often from multiple documents. Recent approaches use dense representations and condition the retrieval of each document on the previously retrieved ones. The latter step is performed over all the documents in the collection, requiring storing their dense representations in an index, thus incurring a high memory footprint. An alternative paradigm is retrieve-and-rerank, where documents are retrieved using methods such as BM25, their sentences are reranked, and further documents are retrieved conditioned on these sentences, reducing the memory requirements. However, such approaches can be brittle as they rely on heuristics and assume hyperlinks between documents. We propose a novel retrieve-and-rerank method for multi-hop retrieval, that consists of a retriever that jointly scores documents in the knowledge source and sentences from previously retrieved documents using an autoregressive formulation and is guided by a proof system based on natural logic that dynamically terminates the retrieval process if the evidence is deemed sufficient. This method is competitive with current state-of-the-art methods on FEVER, HoVer and FEVEROUS-S, while using 5 to 10 times less memory than competing systems. Evaluation on an adversarial dataset indicates improved stability of our approach compared to commonly deployed threshold-based methods. Finally, the proof system helps humans predict model decisions correctly more often than using the evidence alone.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 24 of its 46 references that are in the map. First posted on arXiv 10 Dec 2022.

Builds on

24 of 46 references.

References · 24

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  4. 2019Language Models as Knowledge Bases?cited by 1,922
  5. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,400
  6. 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,362
  7. 2020KILT: a Benchmark for Knowledge Intensive Language Taskscited by 571
  8. 2021A Survey on Automated Fact-Checkingcited by 376
  9. 2020Autoregressive Entity Retrievalcited by 333
  10. 2020HoVer: A Dataset for Many-Hop Fact Extraction And Claim Verificationcited by 199
  11. 2021FEVEROUS: Fact Extraction and VERification Over Unstructured and Structured informationcited by 166
  12. 2020Answering Complex Open-Domain Questions with Multi-Hop Dense Retrievalcited by 160
12 more
  1. 2019Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answeringcited by 147
  2. 2018Combining Fact Extraction and Verification with Neural Semantic Matching Networkscited by 120
  3. 2019Fine-grained Fact Verification with Kernel Graph Attention Networkcited by 105
  4. 2021A Survey on Stance Detection for Mis- and Disinformation Identificationcited by 75
  5. 2019Reasoning Over Semantic-Level Graph for Fact Checkingcited by 69
  6. 2021Baleen: Robust Multi-Hop Reasoning at Scale via Condensed Retrievalcited by 63
  7. 2018UKP-Athene: Multi-Sentence Textual Entailment for Claim Verificationcited by 60
  8. 2021Pyserini: An Easy-to-Use Python Toolkit to Support Replicable IR Research with Sparse and Dense Representationscited by 60
  9. 2021ProoFVer: Natural Logic Theorem Proving for Fact Verificationcited by 52
  10. 2020Answering Open-Domain Questions of Varying Reasoning Steps from Textcited by 43
  11. 2020DeSePtion: Dual Sequence Prediction and Adversarial Examples for Improved Fact-Checkingcited by 26
  12. 2020HopRetriever: Retrieve Hops over Wikipedia to Answer Complex Questionscited by 19

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 4; 2024: 4; 2025: 1; 2026: 1.

11 papers.