20 results for “query-level diversity”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Cross-Query Consistency Hypothesis and CQC-RAG framework
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…
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.
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…
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…
The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.
This paper proposes a framework for multi-hop retrieval as query-set compatibility scoring, improving retrieval performance and downstream QA task performance.
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…
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.
This paper studies query abstraction in ontology-based data access using existential rules and certain answer semantics.
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.
This paper presents PermR, a lightweight algorithm for reranking search results in e-commerce platforms to maximize revenue while preserving relevance and other constraints.
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.
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.
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…
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.
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.