From Item-Only to Query-Item: Query-Conditioned Generative Search with QGS in Quark

• URL: http://arxiv.org/abs/2605.25514v1
• Date: Mon, 25 May 2026 07:18:51 GMT
• Title: From Item-Only to Query-Item: Query-Conditioned Generative Search with QGS in Quark
• Abstract summary: Generative sequence models have shown strong results in recommendation.<n>Applying them to search ranking is more challenging.<n>We present Query-Conditioned Generative Search (QGS)
• Score: 8.408261237886899
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Generative sequence models have shown strong results in recommendation. Applying them to search ranking is more challenging. Search behavior is inherently query-driven. Each query switch introduces a sharp topic shift in the user's interaction history. Existing generative methods flatten queries and items into a single token sequence. They do not distinguish query boundaries. This causes the model to mix different query intents into one prediction target, resulting in noisy supervision. We present Query-Conditioned Generative Search (QGS). QGS encodes each interaction as a (query, item) pair token. It trains with a query-conditioned next-item objective. The prediction target changes from a noisy marginal P(item_{t+1}|context_{<=t}) to a clean conditional P(item_{t+1}|context_{<=t}, query_{t+1}). This directly removes the semantic discontinuity caused by query switches. Encoding long interaction histories with standard attention has quadratic cost. This is impractical under strict online latency budgets. We introduce a Linear HSTU encoder. It replaces full attention with causal linear recurrence. Per-layer complexity drops from O(L^2) to O(L) with no loss in ranking quality. Traditional search ranking depends on hand-crafted features like text-matching scores, statistical signals, and behavioral features. We propose HFG-Attention to preserve them in the generative framework. It organizes heterogeneous features into semantic groups and fuses them through a dedicated attention block. This bridges sparse engineered signals with dense sequential representations. QGS is deployed in the ranking module of Quark Search, a major commercial search engine in China. Online A/B tests show statistically significant gains: +0.62% CTR, +0.38% Click-Search Ratio, and +3.55% PV Duration over the production deep learning baseline.

Related papers

• QO-Bench: Diagnosing Query-Operator-Preserving Retrieval over Typed Event Tuples [3.4933579621415576]
  We introduce QO-Bench, a diagnostic benchmark for query-operator question answering over typed events.<n>The benchmark covers 22,984 news articles and 614 corporate events across 18 query templates, evaluated on 785 questions.
  arXiv  Detail & Related papers  (2026-06-03T09:14:43Z)
• MDER-DR: Multi-Hop Question Answering with Entity-Centric Summaries [2.756584457554517]
  Map-Disambiguate-Enrich-Reduce (MDER) generates context-derived triple descriptions and integrates them with entity-level summaries.<n>Decompose-Resolve (DR) decomposes user queries into resolvable triples and grounds them in the Knowledge Graph.<n>MDER and DR form an LLM-driven QA pipeline that is robust to sparse, incomplete, and complex relational data.
  arXiv  Detail & Related papers  (2026-03-11T18:38:44Z)
• Cooperative Retrieval-Augmented Generation for Question Answering: Mutual Information Exchange and Ranking by Contrasting Layers [2.007262412327553]
  CoopRAG is a novel RAG framework for the question answering task in which a retriever and an LLM work cooperatively with each other.<n>Our experiments demonstrate that CoopRAG consistently outperforms state-of-the-art QA methods on three multi-hop QA datasets as well as a simple QA dataset.
  arXiv  Detail & Related papers  (2025-12-11T08:35:17Z)
• TeaRAG: A Token-Efficient Agentic Retrieval-Augmented Generation Framework [62.66056331998838]
  TeaRAG is a token-efficient agentic RAG framework capable of compressing both retrieval content and reasoning steps.<n>Our reward function evaluates the knowledge sufficiency by a knowledge matching mechanism, while penalizing excessive reasoning steps.
  arXiv  Detail & Related papers  (2025-11-07T16:08:34Z)
• Hybrid Deep Searcher: Integrating Parallel and Sequential Search Reasoning [57.78245296980122]
  We introduce HDS-QA (Hybrid Deep Search QA), a dataset automatically generated from Natural Questions.<n>It comprises hybrid-hop questions that combine parallelizable independent subqueries (executable simultaneously) and sequentially dependent subqueries (requiring step-by-step resolution)<n>We name the model HybridDeepSearcher, which outperforms state-of-the-art baselines across multiple benchmarks.
  arXiv  Detail & Related papers  (2025-08-26T15:15:17Z)
• The benefits of query-based KGQA systems for complex and temporal questions in LLM era [55.20230501807337]
  Large language models excel in question-answering (QA) yet still struggle with multi-hop reasoning and temporal questions.<n> Query-based knowledge graph QA (KGQA) offers a modular alternative by generating executable queries instead of direct answers.<n>We explore multi-stage query-based framework for WikiData QA, proposing multi-stage approach that enhances performance on challenging multi-hop and temporal benchmarks.
  arXiv  Detail & Related papers  (2025-07-16T06:41:03Z)
• RAGONITE: Iterative Retrieval on Induced Databases and Verbalized RDF for Conversational QA over KGs with RAG [6.4032082023113475]
  SPARQL is brittle for complex intents and conversational questions.<n>We propose a novel two-pronged system where we fuse: (i) SPARQL results over a database automatically derived from the knowledge graph, and (ii) text-search results over verbalizations of KG facts.<n>Our pipeline supports iterative retrieval: when the results of any branch are found to be unsatisfactory, the system can automatically opt for further rounds.<n>We demonstrate the superiority of our proposed system over several baselines on a knowledge graph of BMW automobiles.
  arXiv  Detail & Related papers  (2024-12-23T16:16:30Z)
• Allies: Prompting Large Language Model with Beam Search [107.38790111856761]
  In this work, we propose a novel method called ALLIES. Given an input query, ALLIES leverages LLMs to iteratively generate new queries related to the original query. By iteratively refining and expanding the scope of the original query, ALLIES captures and utilizes hidden knowledge that may not be directly through retrieval.
  arXiv  Detail & Related papers  (2023-05-24T06:16:44Z)
• NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs [1.415350927301928]
  Complex query answering is an essential task for logical reasoning on knowledge graphs. We propose a novel N-ary Query Embedding (NQE) model for CQA over hyper-relational knowledge graphs (HKGs) NQE utilizes a dual-heterogeneous Transformer encoder and fuzzy logic theory to satisfy all n-ary FOL queries. We generate a new CQA dataset WD50K-NFOL, including diverse n-ary FOL queries over WD50K.
  arXiv  Detail & Related papers  (2022-11-24T08:26:18Z)
• What Are Expected Queries in End-to-End Object Detection? [28.393693394478724]
  This paper shows that the expected queries should be COCO Distinct Queries (DDQ) DDQ is stronger, more robust, and converges faster than previous methods. It obtains 44.5 AP on the MSarity detection dataset with only 12 epochs.
  arXiv  Detail & Related papers  (2022-06-02T18:15:44Z)
• Online Learning of Optimally Diverse Rankings [63.62764375279861]
  We propose an algorithm that efficiently learns the optimal list based on users' feedback only. We show that after $T$ queries, the regret of LDR scales as $O((N-L)log(T))$ where $N$ is the number of all items.
  arXiv  Detail & Related papers  (2021-09-13T12:13:20Z)
• Session-Aware Query Auto-completion using Extreme Multi-label Ranking [61.753713147852125]
  We take the novel approach of modeling session-aware query auto-completion as an e Multi-Xtreme Ranking (XMR) problem. We adapt a popular XMR algorithm for this purpose by proposing several modifications to the key steps in the algorithm. Our approach meets the stringent latency requirements for auto-complete systems while leveraging session information in making suggestions.
  arXiv  Detail & Related papers  (2020-12-09T17:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.