Pith. sign in

REVIEW 27 cited by

Precise Zero-Shot Dense Retrieval without Relevance Labels

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2212.10496 v1 pith:WBQYXAMU submitted 2022-12-20 cs.IR cs.CL

Luyu Gao , Xueguang Ma , Jimmy Lin , Jamie Callan This is my paper
classification cs.IRcs.CL
keywords densedocumentrelevancezero-shothyderetrievalvectoracross
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

While dense retrieval has been shown effective and efficient across tasks and languages, it remains difficult to create effective fully zero-shot dense retrieval systems when no relevance label is available. In this paper, we recognize the difficulty of zero-shot learning and encoding relevance. Instead, we propose to pivot through Hypothetical Document Embeddings~(HyDE). Given a query, HyDE first zero-shot instructs an instruction-following language model (e.g. InstructGPT) to generate a hypothetical document. The document captures relevance patterns but is unreal and may contain false details. Then, an unsupervised contrastively learned encoder~(e.g. Contriever) encodes the document into an embedding vector. This vector identifies a neighborhood in the corpus embedding space, where similar real documents are retrieved based on vector similarity. This second step ground the generated document to the actual corpus, with the encoder's dense bottleneck filtering out the incorrect details. Our experiments show that HyDE significantly outperforms the state-of-the-art unsupervised dense retriever Contriever and shows strong performance comparable to fine-tuned retrievers, across various tasks (e.g. web search, QA, fact verification) and languages~(e.g. sw, ko, ja).

Discussion (0). Sign in to comment.

Forward citations

Cited by 27 Pith papers

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

  1. RAG-Stack: Co-Optimizing RAG Serving Performance and Quality

    cs.DB 2026-08 conditional novelty 7.0 of 10

    RAG-Stack jointly optimizes RAG algorithm choices and serving-system settings via sub-metric-aware multi-objective Bayesian optimization plus an analytical performance model, reporting Pareto frontiers covering 52.5% ...

  2. MARVEL: Multimodal Adaptive Reasoning-intensiVe Expand-rerank and retrievaL

    cs.IR 2026-04 unverdicted novelty 7.0 of 10

    MARVEL reaches 37.9 nDCG@10 on the MM-BRIGHT benchmark by combining LLM query expansion, a reasoning-enhanced dense retriever, and GPT-4o CoT reranking, beating prior multimodal encoders by 10.3 points.

  3. Bridging the Question-Answer Gap in Retrieval-Augmented Generation: Hypothetical Prompt Embeddings

    cs.IR 2026-07 conditional novelty 6.0 of 10

    Precomputing hypothetical question embeddings for each text chunk at indexing time shifts retrieval to question–question matching and improves context precision and claim recall in RAG.

  4. 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 of 10

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

  5. Bringing Agentic Search to Earth Observation Data Discovery

    cs.IR 2026-07 unverdicted novelty 6.0 of 10

    Agentic search over NASA EO-KG yields a 47k-pair benchmark where neural scoring plus LLM reranking raises MRR by over 5x then an additional 28%.

  6. An Agent-Oriented Pluggable Experience-RAG Skill for Experience-Driven Retrieval Strategy Orchestration

    cs.AI 2026-05 unverdicted novelty 6.0 of 10

    Experience-RAG Skill uses experience memory to dynamically select retrieval strategies for agents, achieving 0.8924 nDCG@10 on BeIR/nq, hotpotqa, and scifact while outperforming fixed single-retriever baselines.

  7. FitText: Evolving Agent Tool Ecologies via Memetic Retrieval

    cs.AI 2026-05 unverdicted novelty 6.0 of 10

    FitText embeds memetic evolutionary retrieval inside the agent's reasoning loop to iteratively refine pseudo-tool descriptions, raising retrieval rank from 8.81 to 2.78 on ToolRet and pass rate to 0.73 on StableToolBench.

  8. FitText: Evolving Agent Tool Ecologies via Memetic Retrieval

    cs.AI 2026-05 unverdicted novelty 6.0 of 10

    FitText embeds evolutionary retrieval of tool descriptions into the agent loop, yielding 2.7-10.6 point NDCG@5 gains on ToolRet and 26.7-point pass-rate gains on StableToolBench.

  9. FitText: Evolving Agent Tool Ecologies via Memetic Retrieval

    cs.AI 2026-05 conditional novelty 6.0 of 10

    Agents that evolve pseudo-tool search descriptions during execution reach an 84.3% StableToolBench pass rate, +26.7 points over static query retrieval, with gains growing with base-model capability.

  10. Lever: Inference-Time Policy Reuse under Support Constraints

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    LEVER enables offline composition of pre-trained RL policies via behavioral embeddings and Q-value composition, matching or exceeding training-from-scratch performance in deterministic GridWorld while highlighting lim...

  11. A Reference Architecture for Agentic Hybrid Retrieval in Dataset Search

    cs.IR 2026-03 unverdicted novelty 6.0 of 10

    The paper defines a bounded reference architecture for LLM-orchestrated hybrid retrieval in dataset search using BM25, dense embeddings, reciprocal rank fusion, and metadata augmentation with pseudo-queries.

  12. BEAR: Budgeted Evidence Allocation for Multi-Document Reasoning

    cs.CL 2026-01 conditional novelty 6.0 of 10

    A budget-controlled two-path hierarchical retrieval method reports near-full-context accuracy on multi-hop QA with up to 94% token savings, but the reported numbers are internally inconsistent and no artifacts are released.

  13. HedraRAG: Coordinating LLM Generation and Database Retrieval in Heterogeneous RAG Serving

    cs.DB 2025-07 conditional novelty 6.0 of 10

    HedraRAG uses a graph abstraction and dynamic transformations to pipeline generation and retrieval stages, achieving 1.5x to 5x speedups in heterogeneous RAG serving.

  14. R2MED: A Benchmark for Reasoning-Driven Medical Retrieval

    cs.IR 2025-05 accept novelty 6.0 of 10

    R2MED is the first benchmark for reasoning-driven medical retrieval, where even top models reach only 41.4 nDCG@10 on queries requiring inference beyond lexical or semantic overlap.

  15. Designing Reward Signals for Portable Query Generation: A Case Study in Industrial Semantic Job Search

    cs.LG 2026-06 unverdicted novelty 5.0 of 10

    Empirical study of RLAIF for portable query generation finds reward shaping controls performance more than optimizer choice and a rule-based reward floor yields +0.147 quality gain.

  16. Decision-Aware Memory Cards: Counterfactual-Inspired Context Selection and Compression for Tool-Using LLM Agents

    cs.AI 2026-06 unverdicted novelty 5.0 of 10

    CICL scores and compresses context evidence for LLM agents via action-shift and outcome-uplift metrics, lifting hit@1 from 0.58 to 0.78 on 50 SWE-bench retrieval tasks.

  17. Retrieval-Conditioned Topology Selection with Provable Budget Conservation for Multi-Agent Code Generation

    cs.AI 2026-05 unverdicted novelty 5.0 of 10

    RGAO combines retrieval-based complexity assessment with a formal budget algebra to enable dynamic topology selection in multi-agent code generation with provable conservation.

  18. Dynamic Ranked List Truncation for Reranking Pipelines via LLM-generated Reference-Documents

    cs.IR 2026-04 unverdicted novelty 5.0 of 10

    LLM-generated reference documents enable dynamic ranked list truncation and adaptive batching for listwise reranking, outperforming prior RLT methods and accelerating processing by up to 66% on TREC benchmarks.

  19. Dynamic Ranked List Truncation for Reranking Pipelines via LLM-generated Reference-Documents

    cs.IR 2026-04 unverdicted novelty 5.0 of 10

    LLM-generated reference documents serve as relevance pivots for dynamic ranked-list truncation and adaptive/parallel listwise reranking, reportedly beating prior RLT methods and cutting LLM reranking cost by up to 66%.

  20. BRIDGE: Multimodal-to-Text Retrieval via Reinforcement-Learned Query Alignment

    cs.IR 2026-04 unverdicted novelty 5.0 of 10

    BRIDGE reaches 29.7 nDCG@10 on MM-BRIGHT by RL-aligning multimodal queries to text and using a reasoning retriever, beating multimodal encoders and, when combined with Nomic-Vision, exceeding the best text-only retrie...

  21. ARK: Answer-Centric Retriever Tuning via KG-augmented Curriculum Learning

    cs.IR 2025-11 unverdicted novelty 5.0 of 10

    ARK fine-tunes retrievers for answer alignment using KG-augmented curriculum contrastive learning on answer-sufficient positives and progressive hard negatives, reporting 14.5% gains on long-context benchmarks.

  22. Hierarchical Reranking for Scalable Financial RAG System

    cs.IR 2026-07 reject novelty 4.0 of 10

    A finance-specific RAG pipeline combining table-to-JSON conversion, two-stage reranking, and long-context split-fusion reports NDCG@20=0.7918 and second place in the ICAIF '24 FinanceRAG challenge.

  23. Efficient RAG with Intent-Aware Retrieval and Semantics-Preserving Chunking

    cs.CL 2026-05 unverdicted novelty 4.0 of 10

    InSemRAG combines dynamic intent-aware hybrid retrieval and semantics-preserving chunk repair in an iterative loop, yielding 2.65 F1 gain on HotPotQA and 1.5 accuracy gain on FEVER with 4.32x lower latency than Multi-...

  24. An Agent-Oriented Pluggable Experience-RAG Skill for Experience-Driven Retrieval Strategy Orchestration

    cs.AI 2026-05 unverdicted novelty 4.0 of 10

    Experience-RAG Skill is a reusable agent skill that selects retrieval strategies via experience memory, achieving 0.8924 nDCG@10 on BeIR/nq, hotpotqa, and scifact while outperforming fixed retriever baselines.

  25. Advancing Retrieval-Augmented Generation for Structured Enterprise and Internal Data

    cs.CL 2025-07 reject novelty 4.0 of 10

    An enterprise RAG framework combining hybrid retrieval, cross-encoder reranking, and structure-aware table indexing claims relative gains of 15% in Precision@5, 13% in Recall@5, and 16% in MRR over a dense-only baseline.

  26. LightRAG: Simple and Fast Retrieval-Augmented Generation

    cs.IR 2024-10 unverdicted novelty 4.0 of 10

    LightRAG builds graph structures into RAG indexing and retrieval with dual-level search and incremental updates to improve accuracy and speed.

  27. Retrieval-Augmented Generation for Large Language Models: A Survey

    cs.CL 2023-12 unverdicted novelty 3.0 of 10

    A survey of RAG paradigms, components, benchmarks, and challenges for improving LLMs on knowledge-intensive tasks.

Pith tools