mlsanityData to 7 Oct 2026

Passage-Mask: A Learnable Regularization Strategy for Retriever-Reader Models

arXiv 2211.00915 ↗First posted 2 Nov 2022cs.CL cs.AI cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Retriever-reader models achieve competitive performance across many different NLP tasks such as open question answering and dialogue conversations. In this work, we notice these models easily overfit the top-rank retrieval passages and standard training fails to reason over the entire retrieval passages. We introduce a learnable passage mask mechanism which desensitizes the impact from the top-rank retrieval passages and prevents the model from overfitting. Controlling the gradient variance with fewer mask candidates and selecting the mask candidates with one-shot bi-level optimization, our learnable regularization strategy enforces the answer generation to focus on the entire retrieval passages. Experiments on different tasks across open question answering, dialogue conversation, and fact verification show that our method consistently outperforms its baselines. Extensive experiments and ablation studies demonstrate that our method can be general, effective, and beneficial for many NLP tasks.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 53 of its 61 references that are in the map. First posted on arXiv 2 Nov 2022.

Builds on

53 of 61 references.

References · 53

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  4. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
  5. 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
  6. 2018DARTS: Differentiable Architecture Searchcited by 1,782
  7. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
  8. 2020Leveraging Passage Retrieval with Generative Models for Open Domain Question Answeringcited by 1,203
  9. 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,097
  10. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  11. 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
  12. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
38 more
  1. 2020KILT: a Benchmark for Knowledge Intensive Language Taskscited by 571
  2. 2018Wizard of Wikipedia: Knowledge-Powered Conversational agentscited by 530
  3. 2020AmbigQA: Answering Ambiguous Open-domain Questionscited by 385
  4. 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
  5. 2021Entity-Based Knowledge Conflicts in Question Answeringcited by 349
  6. 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 302
  7. 2017How to Escape Saddle Points Efficientlycited by 284
  8. 2018DropBlock: A regularization method for convolutional networkscited by 261
  9. 2019Random Search and Reproducibility for Neural Architecture Searchcited by 253
  10. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
  11. 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 232
  12. 2014Efficient Object Localization Using Convolutional Networkscited by 226
  13. 2020Distilling Knowledge from Reader to Retriever for Question Answeringcited by 226
  14. 2020Bilevel Optimization: Convergence Analysis and Enhanced Designcited by 219
  15. 2020Sparse, Dense, and Attentional Representations for Text Retrievalcited by 213
  16. 2018Truncated Back-propagation for Bilevel Optimizationcited by 187
  17. 2020Generation-Augmented Retrieval for Open-domain Question Answeringcited by 186
  18. 2020On the Iteration Complexity of Hypergradient Computationcited by 154
  19. 2019End-to-End Open-Domain Question Answering with BERTserinicited by 152
  20. 2020GridMask Data Augmentationcited by 123
  21. 2021A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentumcited by 106
  22. 2021Provably Faster Algorithms for Bilevel Optimizationcited by 106
  23. 2020Open-Retrieval Conversational Question Answeringcited by 99
  24. 2020Relevance-guided Supervision for OpenQA with ColBERTcited by 71
  25. 2018Escaping Saddles with Stochastic Gradientscited by 66
  26. 2020Bayesian Attention Modulescited by 51
  27. 2020Adding Chit-Chat to Enhance Task-Oriented Dialoguescited by 48
  28. 2021Knowing More About Questions Can Help: Improving Calibration in Question Answeringcited by 47
  29. 2021Multi-task Retrieval for Knowledge-Intensive Taskscited by 44
  30. 2021Evidentiality-guided Generation for Knowledge-Intensive NLP Taskscited by 40
  31. 2021Hindsight: Posterior-guided training of retrievers for improved open-ended generationcited by 38
  32. 2021R2-D2: A Modular Baseline for Open-Domain Question Answeringcited by 37
  33. 2021FaVIQ: FAct Verification from Information-seeking Questionscited by 36
  34. 2019Hybrid Stochastic Gradient Descent Algorithms for Stochastic Nonconvex Optimizationcited by 31
  35. 2021Contextual Dropout: An Efficient Sample-Dependent Dropout Modulecited by 26
  36. 2021Bayesian Attention Belief Networkscited by 25
  37. 2022ALLSH: Active Learning Guided by Local Sensitivity and Hardnesscited by 23
  38. 2020Convergence Properties of Stochastic Hypergradientscited by 19

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 3.

6 papers.