M3: A Multi-Task Mixed-Objective Learning Framework for Open-Domain Multi-Hop Dense Sentence Retrieval
Not on the map. Why?
Abstract (arXiv)
In recent research, contrastive learning has proven to be a highly effective method for representation learning and is widely used for dense retrieval. However, we identify that relying solely on contrastive learning can lead to suboptimal retrieval performance. On the other hand, despite many retrieval datasets supporting various learning objectives beyond contrastive learning, combining them efficiently in multi-task learning scenarios can be challenging. In this paper, we introduce M3, an advanced recursive Multi-hop dense sentence retrieval system built upon a novel Multi-task Mixed-objective approach for dense text representation learning, addressing the aforementioned challenges. Our approach yields state-of-the-art performance on a large-scale open-domain fact verification benchmark dataset, FEVER. Code and data are available at: https://github.com/TonyBY/M3
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 32 of its 48 references that are in the map. First posted on arXiv 21 Mar 2024.
Builds on
32 of 48 references.
References · 32
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
- 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,362
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
20 more
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
- 2020HoVer: A Dataset for Many-Hop Fact Extraction And Claim Verificationcited by 199
- 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 175
- 2020Answering Complex Open-Domain Questions with Multi-Hop Dense Retrievalcited by 160
- 2019Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answeringcited by 147
- 2018Combining Fact Extraction and Verification with Neural Semantic Matching Networkscited by 120
- 2019GEAR: Graph-based Evidence Aggregating and Reasoning for Fact Verificationcited by 100
- 2021Adversarial Retriever-Ranker for dense text retrievalcited by 82
- 2019Reasoning Over Semantic-Level Graph for Fact Checkingcited by 69
- 2018UKP-Athene: Multi-Sentence Textual Entailment for Claim Verificationcited by 60
- 2019BERT for Evidence Retrieval and Claim Verificationcited by 57
- 2021ProoFVer: Natural Logic Theorem Proving for Fact Verificationcited by 52
- 2019Revealing the Importance of Semantic Retrieval for Machine Reading at Scalecited by 50
- 2021A Replication Study of Dense Passage Retrievercited by 37
- 2022From Easy to Hard: Two-stage Selector and Reader for Multi-hop Question Answeringcited by 12
- 2022Claim-Dissector: An Interpretable Fact-Checking System with Joint Re-ranking and Veracity Predictioncited by 12
- 2020Hierarchical Evidence Set Modeling for Automated Fact Extraction and Verificationcited by 11
- 2021Sentence-aware Contrastive Learning for Open-Domain Passage Retrievalcited by 11
- 2022Natural Logic-guided Autoregressive Multi-hop Document Retrieval for Fact Verificationcited by 11
- 2023BEVERS: A General, Simple, and Performant Framework for Automatic Fact Verificationcited by 11
Built on by
Citing papers per year: 2024: 1.
1 paper.