Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

M3: A Multi-Task Mixed-Objective Learning Framework for Open-Domain Multi-Hop Dense Sentence Retrieval (2403.14074v1)

Published 21 Mar 2024 in cs.IR, cs.CL, and cs.LG

Abstract: 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

Definition Search Book Streamline Icon: https://streamlinehq.com
References (47)
  1. Cross-domain modeling of sentence-level evidence for document retrieval. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 3490–3496, Hong Kong, China. Association for Computational Linguistics.
  2. Rami Aly and Andreas Vlachos. 2022. Natural logic-guided autoregressive multi-hop document retrieval for fact verification. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, pages 6123–6135, Abu Dhabi, United Arab Emirates. Association for Computational Linguistics.
  3. Learning to retrieve reasoning paths over wikipedia graph for question answering. ArXiv, abs/1911.10470.
  4. Mythqa: Query-based large-scale check-worthy claim detection through multi-answer open-domain question answering. Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval.
  5. P. Baudis and J. Sedivý. 2015. Modeling of the question answering task in the yodaqa system. In CLEF.
  6. Semantic parsing on freebase from question-answer pairs. In EMNLP.
  7. Tianqi Chen and Carlos Guestrin. 2016. Xgboost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’16, page 785–794, New York, NY, USA. Association for Computing Machinery.
  8. Mitchell DeHaven and Stephen Scott. 2023. BEVERS: A general, simple, and performant framework for automatic fact verification. In Proceedings of the Sixth Fact Extraction and VERification Workshop (FEVER), pages 58–65, Dubrovnik, Croatia. Association for Computational Linguistics.
  9. Claim-dissector: An interpretable fact-checking system with joint re-ranking and veracity prediction. In Findings of the Association for Computational Linguistics: ACL 2023, pages 10184–10205, Toronto, Canada. Association for Computational Linguistics.
  10. SimCSE: Simple contrastive learning of sentence embeddings. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pages 6894–6910, Online and Punta Cana, Dominican Republic. Association for Computational Linguistics.
  11. Dimensionality reduction by learning an invariant mapping. 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’06), 2:1735–1742.
  12. UKP-athene: Multi-sentence textual entailment for claim verification. In Proceedings of the First Workshop on Fact Extraction and VERification (FEVER), pages 103–108, Brussels, Belgium. Association for Computational Linguistics.
  13. Deberta: Decoding-enhanced bert with disentangled attention. In International Conference on Learning Representations.
  14. Exploring listwise evidence reasoning with t5 for fact verification. In Annual Meeting of the Association for Computational Linguistics.
  15. Hover: A dataset for many-hop fact extraction and claim verification. In Findings.
  16. Billion-scale similarity search with gpus. IEEE Transactions on Big Data, 7:535–547.
  17. Triviaqa: A large scale distantly supervised challenge dataset for reading comprehension. In ACL.
  18. Dense passage retrieval for open-domain question answering. In Conference on Empirical Methods in Natural Language Processing.
  19. Omar Khattab and Matei Zaharia. 2020. Colbert: Efficient and effective passage search via contextualized late interaction over bert. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR ’20, page 39–48, New York, NY, USA. Association for Computing Machinery.
  20. Proofver: Natural logic theorem proving for fact verification. Transactions of the Association for Computational Linguistics, 10:1013–1030.
  21. Natural questions: A benchmark for question answering research. Transactions of the Association for Computational Linguistics, 7:453–466.
  22. From easy to hard: Two-stage selector and reader for multi-hop question answering. In ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 1–5.
  23. Pyserini: A python toolkit for reproducible information retrieval research with sparse and dense representations. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR ’21, page 2356–2362, New York, NY, USA. Association for Computing Machinery.
  24. Roberta: A robustly optimized bert pretraining approach. ArXiv, abs/1907.11692.
  25. Fine-grained fact verification with kernel graph attention network. In Annual Meeting of the Association for Computational Linguistics.
  26. A replication study of dense passage retriever. ArXiv, abs/2104.05740.
  27. Combining fact extraction and verification with neural semantic matching networks. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, AAAI’19/IAAI’19/EAAI’19. AAAI Press.
  28. Revealing the importance of semantic retrieval for machine reading at scale. ArXiv, abs/1909.08041.
  29. Rocketqa: An optimized training approach to dense passage retrieval for open-domain question answering. In North American Chapter of the Association for Computational Linguistics.
  30. Squad: 100,000+ questions for machine comprehension of text. In EMNLP.
  31. Juan Enrique Ramos. 2003. Using tf-idf to determine word relevance in document queries. In Proceedings of the first instructional conference on machine learning.
  32. Nils Reimers and Iryna Gurevych. 2019. Sentence-bert: Sentence embeddings using siamese bert-networks. In Conference on Empirical Methods in Natural Language Processing.
  33. RocketQAv2: A joint training method for dense passage retrieval and passage re-ranking. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pages 2825–2835, Online and Punta Cana, Dominican Republic. Association for Computational Linguistics.
  34. Okapi at trec-3. In Text Retrieval Conference.
  35. Bert for evidence retrieval and claim verification. In Advances in Information Retrieval: 42nd European Conference on IR Research, ECIR 2020, Lisbon, Portugal, April 14–17, 2020, Proceedings, Part II, page 359–366, Berlin, Heidelberg. Springer-Verlag.
  36. Dominik Stammbach. 2021. Evidence selection as a token-level prediction task. In Proceedings of the Fourth Workshop on Fact Extraction and VERification (FEVER), pages 14–20, Dominican Republic. Association for Computational Linguistics.
  37. Shyam Subramanian and Kyumin Lee. 2020. Hierarchical Evidence Set Modeling for automated fact extraction and verification. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 7798–7809, Online. Association for Computational Linguistics.
  38. FEVER: a large-scale dataset for fact extraction and VERification. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), pages 809–819, New Orleans, Louisiana. Association for Computational Linguistics.
  39. Transformers: State-of-the-art natural language processing. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, pages 38–45, Online. Association for Computational Linguistics.
  40. Sentence-aware contrastive learning for open-domain passage retrieval. In Annual Meeting of the Association for Computational Linguistics.
  41. Approximate nearest neighbor negative contrastive learning for dense text retrieval. In International Conference on Learning Representations.
  42. Answering complex open-domain questions with multi-hop dense retrieval. In International Conference on Learning Representations.
  43. Anserini: Enabling the use of lucene for information retrieval research. Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval.
  44. UCL machine reading group: Four factor framework for fact finding (HexaF). In Proceedings of the First Workshop on Fact Extraction and VERification (FEVER), pages 97–102, Brussels, Belgium. Association for Computational Linguistics.
  45. Adversarial retriever-ranker for dense text retrieval. In International Conference on Learning Representations.
  46. Reasoning over semantic-level graph for fact checking. In Annual Meeting of the Association for Computational Linguistics.
  47. GEAR: Graph-based evidence aggregating and reasoning for fact verification. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 892–901, Florence, Italy. Association for Computational Linguistics.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets