mlsanityData to 7 Oct 2026

SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrieval

arXiv 2009.13013 ↗First posted 28 Sep 2020cs.CL cs.LGcited by 50

Not on the map. Why?

Abstract (arXiv)

We introduce SPARTA, a novel neural retrieval method that shows great promise in performance, generalization, and interpretability for open-domain question answering. Unlike many neural ranking methods that use dense vector nearest neighbor search, SPARTA learns a sparse representation that can be efficiently implemented as an Inverted Index. The resulting representation enables scalable neural retrieval that does not require expensive approximate vector search and leads to better performance than its dense counterpart. We validated our approaches on 4 open-domain question answering (OpenQA) tasks and 11 retrieval question answering (ReQA) tasks. SPARTA achieves new state-of-the-art results across a variety of open-domain question answering tasks in both English and Chinese datasets, including open SQuAD, Natuarl Question, CMRC and etc. Analysis also confirms that the proposed method creates human interpretable representation and allows flexible control over the trade-off between performance and efficiency.

Key facts. Cited by 50 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Sep 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 12; 2023: 9; 2024: 5; 2025: 13; 2026: 4.

50 papers.

Sort:

By area:

  1. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  2. 2021Retrieving and Reading: A Comprehensive Survey on Open-domain Question Answeringcited by 178
  3. 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
  4. 2022Autoregressive Search Engines: Generating Substrings as Document Identifierscited by 112
  5. 2022State-of-the-art generalisation research in NLP: A taxonomy and reviewcited by 97
  6. 2023Interactive Natural Language Processingcited by 31
  7. 2021Adaptive Information Seeking for Open-Domain Question Answeringcited by 29
  8. 2022An Efficiency Study for SPLADE Modelscited by 26
  9. 2023STAIR: Learning Sparse Text and Image Representation in Grounded Tokenscited by 23
  10. 2022PROD: Progressive Distillation for Dense Retrievalcited by 20
  11. 2021VisualSparta: An Embarrassingly Simple Approach to Large-scale Text-to-Image Search with Weighted Bag-of-wordscited by 14
  12. 2022Multi-Vector Retrieval as Sparse Alignmentcited by 12
38 more
  1. 2025Interpretable Text Embeddings and Text Similarity Explanation: A Surveycited by 12
  2. 2021Answering Open-Domain Multi-Answer Questions via a Recall-then-Verify Frameworkcited by 11
  3. 2025ACORD: An Expert-Annotated Retrieval Dataset for Legal Contract Draftingcited by 11
  4. 2022Can Open-Domain QA Reader Utilize External Knowledge Efficiently like Humans?cited by 10
  5. 2025CSPLADE: Learned Sparse Retrieval with Causal Language Modelscited by 10
  6. 2024Towards Competitive Search Relevance For Inference-Free Learned Sparse Retrieverscited by 8
  7. 2023Video-Text Retrieval by Supervised Sparse Multi-Grained Learningcited by 7
  8. 2025Granite Embedding Modelscited by 7
  9. 2025Granite Embedding R2 Modelscited by 7
  10. 2024Measuring and Addressing Indexical Bias in Information Retrievalcited by 6
  11. 2023Policy-Gradient Training of Language Models for Rankingcited by 5
  12. 2025Wrong Answers Can Also Be Useful: PlausibleQA -- A Large-Scale QA Dataset with Answer Plausibility Scorescited by 5
  13. 2025EqualizeIR: Mitigating Linguistic Biases in Retrieval Modelscited by 5
  14. 2025LexSemBridge: Fine-Grained Dense Representation Enhancement through Token-Aware Embedding Augmentationcited by 5
  15. 2026LACONIC: Dense-Level Effectiveness for Scalable Sparse Retrieval via a Two-Phase Training Curriculumcited by 5
  16. 2022Continual Learning of Long Topic Sequences in Neural Information Retrievalcited by 4
  17. 2022Composite Code Sparse Autoencoders for first stage retrievalcited by 4
  18. 2022Two-Step Question Retrieval for Open-Domain QAcited by 4
  19. 2024WikiHint: A Human-Annotated Dataset for Hint Ranking and Generationcited by 4
  20. 2022Overview of the SV-Ident 2022 Shared Task on Survey Variable Identification in Social Science Publicationscited by 3
  21. 2023Plot Retrieval as an Assessment of Abstract Semantic Associationcited by 3
  22. 2022Once is Enough: A Light-Weight Cross-Attention for Fast Sentence Pair Modelingcited by 2
  23. 2023NAIL: Lexical Retrieval Indices with Efficient Non-Autoregressive Decoderscited by 2
  24. 2023SPRINT: A Unified Toolkit for Evaluating and Demystifying Zero-shot Neural Sparse Retrievalcited by 2
  25. 2024MrRank: Improving Question Answering Retrieval System through Multi-Result Ranking Modelcited by 2
  26. 2025QBR: A Question-Bank-Based Approach to Fine-Grained Legal Knowledge Retrieval for the General Publiccited by 2
  27. 2026Superintelligent Retrieval Agent: The Next Frontier of Agentic Retrievalcited by 2
  28. 2022Neural Retriever and Go Beyond: A Thesis Proposalcited by 1
  29. 2025Exploring ℓ0 Sparsification for Inference-free Sparse Retrieverscited by 1
  30. 2025Rational Retrieval Acts: Leveraging Pragmatic Reasoning to Improve Sparse Retrievalcited by 1
  31. 2025LightRetriever: A LLM-based Text Retrieval Architecture with Extremely Faster Query Inferencecited by 1
  32. 2025Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Setscited by 1
  33. 2021SF-QA: Simple and Fair Evaluation Library for Open-domain Question Answeringcited by 0
  34. 2023Can a Frozen Pretrained Language Model be used for Zero-shot Neural Retrieval on Entity-centric Questions?cited by 0
  35. 2023Empowering Language Model with Guided Knowledge Fusion for Biomedical Document Re-rankingcited by 0
  36. 2024Semi-Parametric Retrieval via Binary Bag-of-Tokens Indexcited by 0
  37. 2026To Case or Not to Case: An Empirical Study in Learned Sparse Retrievalcited by 0
  38. 2026Towards Dynamic Dense Retrieval with Routing Strategycited by 0