mlsanityData to 14 Oct 2026

Bayesian Active Learning with Gaussian Processes Guided by LLM Relevance Scoring for Dense Passage Retrieval

arXiv 2604.17906 ↗First posted 20 Apr 2026cs.IR cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

While Large Language Models (LLMs) exhibit exceptional zero-shot relevance modeling, their high computational cost necessitates framing passage retrieval as a budget-constrained global optimization problem. Existing approaches passively rely on first-stage dense retrievers, which leads to two limitations: (1) failing to retrieve relevant passages in semantically distinct clusters, and (2) failing to propagate relevance signals to the broader corpus. To address these limitations, we propose Bayesian Active Learning with Gaussian Processes guided by LLM relevance scoring (BAGEL), a novel framework that propagates sparse LLM relevance signals across the embedding space to guide global exploration. BAGEL models the multimodal relevance distribution across the entire embedding space with a query-specific Gaussian Process (GP) based on LLM relevance scores. Subsequently, it iteratively selects passages for scoring by strategically balancing the exploitation of high-confidence regions with the exploration of uncertain areas. Extensive experiments across four benchmark datasets and two LLM backbones demonstrate that BAGEL effectively explores and captures complex relevance distributions and outperforms LLM reranking methods under the same LLM budget on all four datasets.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 22 of its 41 references that are in the map. First posted on arXiv 20 Apr 2026.

Builds on

22 of 41 references.

References · 22

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  3. 2025Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilitiescited by 3,796
  4. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  5. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  6. 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 307
  7. 2019Multi-Stage Document Ranking with BERTcited by 201
  8. 2022Improving Passage Retrieval with Zero-Shot Question Generationcited by 165
  9. 2023Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labelscited by 86
  10. 2024UMBRELA: UMbrela is the (Open-Source Reproduction of the) Bing RELevance Assessorcited by 42
  11. 2024Standard Gaussian Process is All You Need for High-Dimensional Bayesian Optimizationcited by 34
  12. 2024MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexitycited by 29
10 more
  1. 2023Large Language Models are Strong Zero-Shot Retrievercited by 26
  2. 2024Large Language Models as Foundations for Next-Gen Dense Retrieval: A Comprehensive Empirical Assessmentcited by 19
  3. 2023Active Learning and Bayesian Optimization: a Unified Perspective to Learn with a Goalcited by 17
  4. 2024Elaborative Subtopic Query Reformulation for Broad and Indirect Queries in Travel Destination Recommendationcited by 11
  5. 2024Diversify-verify-adapt: Efficient and Robust Retrieval-Augmented Ambiguous Question Answeringcited by 10
  6. 2024Adapting to Non-Stationary Environments: Multi-Armed Bandit Enhanced Retrieval-Augmented Generation on Knowledge Graphscited by 9
  7. 2025MA-DPR: Manifold-aware Distance Metrics for Dense Passage Retrievalcited by 9
  8. 2025Multimodal Item Scoring for Natural Language Recommendation via Gaussian Process Regression with LLM Relevance Judgmentscited by 9
  9. 2025AcuRank: Uncertainty-Aware Adaptive Computation for Listwise Rerankingcited by 8
  10. 2025A Simple but Effective Elaborative Query Reformulation Approach for Natural Language Recommendationcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 6.

6 papers.