ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “query-level diversity”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.IREmpiricalRecentJun 11, 2026

CQC-RAG: Robust Retrieval-Augmented Generation via Cross-Query Consistency

Yanjia Sun, Sifan Liu, Jie Shao

Cross-Query Consistency Hypothesis and CQC-RAG framework

View →
cs.CLcs.AIcs.IRRecentMay 28, 2026

OmniRetrieval: Unified Retrieval across Heterogeneous Knowledge Sources

Jinheon Baek, Soyeong Jeong, Sangwoo Park, Woongyeong Yeo +4 more

OmniRetrieval introduces a unified framework that handles natural language queries across diverse, heterogeneous knowledge sources (text, relational, graphs) by dispatching source-native queries witho…

View →
cs.AIcs.IREmpiricalRecentJun 15, 2026

Beyond Parallel Sampling: Diverse Query Initialization for Agentic Search

Sidhaarth Murali, João Coelho, Jingjie Ning, João Magalhães +2 more

This paper improves test-time scaling for agentic search by reducing query redundancy at the first turn.

View →
cs.AIRecentMay 31, 2026

SIRIUS-SQL: Anchoring Multi-Candidate Text-to-SQL in Execution Feedback

Leo Luo, Haining Xie, Siqi Shen, Zhipeng Ma +7 more

SIRIUS-SQL introduces a robust multi-candidate text-to-SQL system that addresses weaknesses in candidate generation, error handling, and selection, achieving state-of-the-art performance on complex be…

View →
cs.DBcs.AIRecentMay 29, 2026

Sophrosyne: Agentic Exploration of Relational Data Systems Needs Moderation

Madhav Jivrajani, Ramnatthan Alagappan, Aishwarya Ganesan

The paper introduces Sophrosyne, a system that moderates LLM agent exploration in relational data systems, significantly reducing over-exploration and boosting SQL generation accuracy by guiding the a…

View →
cs.DScs.CCcs.ITTheoreticalRecentJun 9, 2026

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

Yuzhou Gu, Xin Li, Yinzhan Xu

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

View →
cs.IREmpiricalRecentJul 7, 2026

Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration

Mooho Song, Jay-Yoon Lee

This paper proposes a framework for multi-hop retrieval as query-set compatibility scoring, improving retrieval performance and downstream QA task performance.

View →
cs.PLcs.CCcs.DBRecentJun 1, 2026

From Time to Space: The Impact of Linearity in Higher-Order Datalog

Angelos Charalambidis, Babis Kostopoulos, Panos Rondogiannis

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

View →
cs.AIcs.DBRecentMay 27, 2026

A Query Engine for the Agents

Kenny Daniel

The paper introduces Hyperparam, a set of lightweight JavaScript libraries designed to enable direct, model-aware querying of unstructured data (like agent traces) within client-side AI applications.

View →
cs.AIcs.DBTheoreticalRecentJun 23, 2026

Abstractions of Queries in Ontology-Based Data Access

Michel Leclère, Marie-Laure Mugnier, Guillaume Pérution-Kihli

This paper studies query abstraction in ontology-based data access using existential rules and certain answer semantics.

View →
cs.DBcs.DSEmpiricalRecentJun 15, 2026

C^2: Cache-Conscious Succinct Tries with Adaptive Unary Path Compression

Kepan Zhang, Tiancheng Zhao, Helen Xu

This paper proposes C^2, a set of techniques to improve the spatial locality of succinct tries, resulting in faster query performance and reduced memory footprint.

View →
cs.IRmath.OCEmpiricalRecentJun 26, 2026

Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization

Svetlana Shirokovskikh, Anastasiia Soboleva, Ekaterina Solodneva, Aleksandr Katrutsa +2 more

This paper presents PermR, a lightweight algorithm for reranking search results in e-commerce platforms to maximize revenue while preserving relevance and other constraints.

View →
cs.DBcs.CCcs.LGTheoreticalRecentJun 10, 2026

Neuro-Relational Programs: Unifying Queries and Neural Computation over Structured Data

Arie Soeteman, Balder ten Cate, Maurice Funk, Benny Kimelfeld +2 more

This paper introduces Neuro-Relational Programs (NRPs), a declarative query language for relational databases that combines relational reasoning and neural components.

View →
cs.DBcs.IREmpiricalRecentOct 30, 2026

Fidelity Synopses: Pre-Execution Plan Selection for Approximate Vector Search

Adithya Ramanatha, Sanskar S. Singh, Maya Ramanath

This paper proposes a synopsis-guided approach to optimize vector search in databases by predicting the fidelity of different configurations and selecting the most cost-effective one for each query.

View →
cs.CLRecentMay 29, 2026

DeSQ: Decomposition-based SPARQL Query Generation

Papa Abdou Karim Karou Diallo, Aditya Sharma, Neshat Elhami Fard, Amal Zouaq

DeSQ is a novel, KB-agnostic framework that improves Knowledge Base Question Answering by decomposing complex questions into atomic constraints and generating structured SPARQL queries, achieving supe…

View →
cs.IREmpiricalRecentOct 27, 2026

TaskBridge: Technical Report for SIGIR 2026 eCommerce Challenge

Zhiheng Fu, Yupeng Hu, Zixu Li, Zhiwei Chen +6 more

The paper proposes TaskBridge, a framework for reformulating task-oriented queries into product retrieval expressions.

View →
cs.AIRecentMay 28, 2026

RAISE: RAG Design as an Architecture Search Problem

Zhen Chen, Yibing Liu, Weihao Xie, Yu Liang +2 more

The paper proposes formulating RAG design as an architecture search problem and introduces RAISE, a comprehensive framework and benchmark for systematically optimizing RAG hyperparameters.

View →