Pith. sign in

REVIEW 19 cited by

Large Dual Encoders Are Generalizable Retrievers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.07899 v1 pith:IEAI7A3N submitted 2021-12-15 cs.IR cs.CL

Large Dual Encoders Are Generalizable Retrievers

classification cs.IR cs.CL
keywords dualencodersmodelout-of-domainretrievalsizetextbfbelief
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

It has been shown that dual encoders trained on one domain often fail to generalize to other domains for retrieval tasks. One widespread belief is that the bottleneck layer of a dual encoder, where the final score is simply a dot-product between a query vector and a passage vector, is too limited to make dual encoders an effective retrieval model for out-of-domain generalization. In this paper, we challenge this belief by scaling up the size of the dual encoder model {\em while keeping the bottleneck embedding size fixed.} With multi-stage training, surprisingly, scaling up the model size brings significant improvement on a variety of retrieval tasks, especially for out-of-domain generalization. Experimental results show that our dual encoders, \textbf{G}eneralizable \textbf{T}5-based dense \textbf{R}etrievers (GTR), outperform %ColBERT~\cite{khattab2020colbert} and existing sparse and dense retrievers on the BEIR dataset~\cite{thakur2021beir} significantly. Most surprisingly, our ablation study finds that GTR is very data efficient, as it only needs 10\% of MS Marco supervised data to achieve the best out-of-domain performance. All the GTR models are released at https://tfhub.dev/google/collections/gtr/1.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 19 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Re-Ranking Through an Attribution Lens for Citation Quality in Legal QA

    cs.CL 2026-06 unverdicted novelty 7.0

    Re-ranking retrieval candidates via a cross-encoder trained on continuous perturbation-based attribution scores improves citation faithfulness and gold-answer alignment in legal QA over semantic similarity.

  2. Scaling Laws for Cross-Encoder Reranking

    cs.IR 2026-03 unverdicted novelty 7.0

    Cross-encoder reranker performance scales predictably via power laws with model size and training exposure, allowing accurate forecasts for 400M and 1B models and data-heavy compute allocation.

  3. M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation

    cs.CL 2024-02 unverdicted novelty 7.0

    M3-Embedding is a single model for multi-lingual, multi-functional, and multi-granular text embeddings trained via self-knowledge distillation that achieves new state-of-the-art results on multilingual, cross-lingual,...

  4. C-Pack: Packed Resources For General Chinese Embeddings

    cs.CL 2023-09 accept novelty 7.0

    C-Pack releases a new Chinese embedding benchmark, large training dataset, and optimized models that outperform priors by up to 10% on C-MTEB while also delivering English SOTA results.

  5. Certified Domain Consistency for Multi-Domain Retrieval: Label-Free Per-Domain Contamination Control with Conformal Risk Guarantees

    cs.LG 2026-07 conditional novelty 6.0

    C3R certifies per-domain retrieval contamination budgets using a two-split conformal scheme, without query-time domain labels.

  6. KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Reranking

    cs.CL 2026-06 accept novelty 6.0

    KaLM-Reranker-V1 uses encoder–decoder FBNL with Matryoshka pooling to match Qwen3-class reranking quality at substantially lower online cost.

  7. GrocLM: Grocery Category Recommendation in E-Commerce with Large Language Models

    cs.AI 2026-06 conditional novelty 6.0

    A LoRA-tuned LLM with trie-constrained decoding improves grocery category recommendation and yields a 7.5% cart-add lift in production.

  8. Semantic Retrieval for Product Search in E-Commerce

    cs.IR 2026-05 unverdicted novelty 6.0

    A dual-encoder LLM is trained via contrastive learning then ROAR to retrieve exact matches and rank substitutes in e-commerce search.

  9. EmbeddingGemma: Powerful and Lightweight Text Representations

    cs.CL 2025-09 unverdicted novelty 6.0

    A 300M-parameter open embedding model sets new SOTA on MTEB for its size class and matches models twice as large while staying effective when compressed.

  10. NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Models

    cs.CL 2024-05 accept novelty 6.0

    NV-Embed achieves first place on the MTEB leaderboard across 56 tasks by combining a latent attention layer, causal-mask removal, two-stage contrastive training, and data curation for LLM-based embedding models.

  11. Uncovering Logit Suppression Vulnerabilities in LLM Safety Alignment

    cs.CR 2024-05 unverdicted novelty 6.0

    SSAG bypasses logit suppression in five LLMs to produce harmful responses at 95% success rate and 86% lower latency; VulMine reaches 77% attack success against defenses.

  12. KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Reranking

    cs.CL 2026-06 unverdicted novelty 5.0

    KaLM-Reranker-V1 introduces a fast but not late-interaction reranker that decouples passage pre-encoding from query processing via encoder-decoder architecture and cross-attention to achieve efficiency and competitive...

  13. IUQ: Interrogative Uncertainty Quantification for Long-Form Large Language Model Generation

    cs.CL 2026-04 unverdicted novelty 5.0

    IUQ quantifies claim-level uncertainty in long-form LLM generation by combining inter-sample consistency and intra-sample faithfulness through an interrogate-then-respond approach and outperforms baselines on two datasets.

  14. IDEAlign: Comparing Large Language Models to Human Experts in Open-ended Interpretive Annotations

    cs.CL 2025-09 conditional novelty 5.0

    IDEAlign uses a pick-the-odd-one-out triplet task to measure idea-level similarity between LLMs and expert human annotations, and shows LLM judges using this protocol outperform lexical and vector-based baselines.

  15. From Attack Descriptions to Vulnerabilities: A Sentence Transformer-Based Approach

    cs.CR 2025-09 conditional novelty 5.0

    A sentence-transformer benchmark finds MMPNet best links ATT&CK attack technique descriptions to CVE vulnerability records (F1=89) and proposes 275 manually vetted new links.

  16. Text Embeddings by Weakly-Supervised Contrastive Pre-training

    cs.CL 2022-12 unverdicted novelty 5.0

    E5 text embeddings trained with weakly-supervised contrastive pre-training on CCPairs outperform BM25 on BEIR zero-shot and achieve top results on MTEB, beating much larger models.

  17. Unveil: Unified Visual-Textual Integration and Distillation for Multi-modal Document Retrieval

    cs.CL 2026-05 unverdicted novelty 4.0

    Unveil proposes a visual-textual embedding model for multi-modal documents that is distilled into an efficient visual-only retriever.

  18. Accurate, Efficient, and Explainable Deep Learning Approaches for Environmental Science Problems

    cs.LG 2026-05 unverdicted novelty 4.0

    The work introduces WaLeF/FIDLAr for flood forecasting, CoDiCast for probabilistic weather, and Hypercube-RAG for explainable environmental QA, claiming superior accuracy, efficiency, and interpretability over baselines.

  19. Choosing a Text Embedding Model: A Practical Benchmarking and Decision Framework

    cs.IR 2026-07 conditional novelty 3.0

    On four BEIR subsets T3EM leads nDCG@10 (0.638) but mE5-L is the recommended open default; training objective and chunk size dominate size, and no model wins every MTEB task.