OBLIQ-Bench: Exposing Overlooked Bottlenecks in Modern Retrievers with Latent and Implicit Queries
Not on the map. Why?
Abstract (arXiv)
Retrieval benchmarks are increasingly saturating, but we argue that efficient search is far from a solved problem. We identify a class of queries we call oblique, which seek documents that instantiate a latent pattern, like finding all tweets that express an implicit stance, chat logs that demonstrate a particular failure mode, or transcripts that match an abstract scenario. We study three mechanisms through which obliqueness may arise and introduce OBLIQ-Bench, a suite of five oblique search problems over real long-tail corpora. OBLIQ-Bench exposes an overlooked asymmetry between retrieval and verification, where reasoning LLMs reliably recognize latent relevance whenever relevant documents are surfaced, but even sophisticated retrieval pipelines fail to surface most relevant documents in the first place. We hope that OBLIQ-Bench will drive research into retrieval architectures that efficiently capture latent patterns and implicit signals in large corpora.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 31 of its 44 references that are in the map. First posted on arXiv 7 May 2026.
Builds on
31 of 44 references.
References · 31
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,259
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
- 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,175
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 893
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2025BrowseComp: A Simple Yet Challenging Benchmark for Browsing Agentscited by 616
19 more
- 2024WildChat: 1M ChatGPT Interaction Logs in the Wildcited by 598
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
- 2020HoVer: A Dataset for Many-Hop Fact Extraction And Claim Verificationcited by 199
- 2025BrowseComp-Plus: A More Fair and Transparent Evaluation Benchmark of Deep-Research Agentcited by 183
- 2024BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrievalcited by 153
- 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 95
- 2025Gemini Embedding: Generalizable Embeddings from Geminicited by 93
- 2024TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategycited by 47
- 2025A Reasoning-Focused Legal Retrieval Benchmarkcited by 37
- 2025DIVER: A Multi-Stage Approach for Reasoning-intensive Information Retrievalcited by 35
- 2019Multi-Hop Paragraph Retrieval for Open-Domain Question Answeringcited by 34
- 2023Decomposing Complex Queries for Tip-of-the-tongue Retrievalcited by 24
- 2025MoNaCo: More Natural and Complex Questions for Reasoning Across Dozens of Documentscited by 20
- 2025PyLate: Flexible Training and Retrieval for Late Interaction Modelscited by 17
- 2023Expand, Rerank, and Retrieve: Query Reranking for Open-Domain Question Answeringcited by 15
- 2025FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documentscited by 15
- 2021Tip of the Tongue Known-Item Retrieval: A Case Study in Movie Identificationcited by 14
- 2025Benchmarking Information Retrieval Models on Complex Retrieval Taskscited by 6
- 2026KARL: Knowledge Agents via Reinforcement Learningcited by 4
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Prime Agent: A Self-Improving RLM Harnesscited by 8
- 2026Can Language Models Actually Retrieve In-Context? Drowning in Documents at Million Token Scalecited by 2
- 2026RATIO: A Benchmark for Retrieval Across Typed Ideation Operations in Scientific Literaturecited by 0
- 2026You Know What I Mean: A Benchmark for Agentic Conversational Reference Groundingcited by 0
- 2026No More Free Lunch: Corpus Task Complexity Matters as Corpora Growcited by 0
- 2026No More Free Lunch: Corpus Task Complexity Matters as Corpora Grow24 Sep 2026
- 2026You Know What I Mean: A Benchmark for Agentic Conversational Reference Grounding30 Aug 2026
- 2026RATIO: A Benchmark for Retrieval Across Typed Ideation Operations in Scientific Literature27 Aug 2026
- 2026Prime Agent: A Self-Improving RLM Harness24 Aug 2026
- 2026Can Language Models Actually Retrieve In-Context? Drowning in Documents at Million Token Scale1 Jul 2026
Similar, not cited
Close in wording, no citation either way
- 2026OBLIQ-IR: Training a Dense Retriever for Oblique Queries ↗
- 2026Over-Searching in Search-Augmented Large Language Models
- 2025Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM
- 2026Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints
- 2026BM25 Wins at Scale: A Scaling Study of Retrieval-Augmented Generation Paradigms
- 2026Latent Abstraction for Retrieval-Augmented Generation
- 2026Query, Decompose, Compress: Structured Query Expansion for Efficient Multi-Hop Retrieval
- 2026Skill-RAG: Failure-State-Aware Retrieval Augmentation via Hidden-State Probing and Skill Routing