The paper introduces a generative query suggestion framework that focuses on covering distinct user intents while ensuring each suggested query is useful. It employs a two‑stage optimization: first, intent‑aware diversity modeling creates supervised fine‑tuning data and a reward that encourages intent coverage; second, query‑level credit assignment directs quality signals to individual query tokens while sharing a slate‑level diversity signal. Experiments on a large production dataset, including online A/B tests, demonstrate gains in click‑through rate, query quality, and intent coverage.
arXiv:2607. 01530v1 Announce Type: cross Abstract: Understanding user intent is fundamental to delivering relevant search results in e-commerce.
arXiv:2609.15094v1 Announce Type: cross Abstract: In industrial recommendation feeds, presenting a static headline for an item often fails to satisfy the diverse, multimodal interests of the user pop...
Intent-Driven Dynamic Chunking (IDC) segments documents by predicting user queries with a Large Language Model and then applying dynamic programming to find optimal chunk boundaries. This method outperforms traditional fixed-length or coherence-based segmentation on five out of six question-answering datasets, improving top-1 retrieval accuracy by 5% to 67% and reducing the number of chunks by 40–60% while maintaining 93–100% answer coverage. IDC demonstrates that aligning document structure with anticipated information needs can significantly boost retrieval performance for long and heterogeneous documents.
The paper "Query Implied Generative Engine Optimization" introduces QI‑GEO, a method that infers user intent directly from documents to enhance visibility in Generative Search Engines. By approximating a document’s intent space, QI‑GEO identifies missing yet relevant content, improving objective scores by up to 15.9% and subjective scores by up to 17.6% on GEO‑Bench datasets. The approach yields nearly twice as many citation gains as losses, demonstrating that document‑derived intent approximations can boost content visibility without explicit query inputs.
arXiv:2607. 27172v1 Announce Type: cross Abstract: Traditional search systems are optimized to retrieve items that strictly match a query, often prioritizing precision over recall.
arXiv:2607. 23121v1 Announce Type: cross Abstract: Dynamic Product Ads (DPA) require retrieving relevant items from multi-million product catalogs, balancing two competing objectives: retargeting (re-surfacing known interests) and prospecting (discovering new categories).
The paper proposes a retrieval‑grounded credit‑assignment method for generative recommenders that use Semantic IDs (SIDs). By structuring each generated trace into a history summary, a set of interest hypotheses, and a final SID, and then verifying each hypothesis with a frozen retriever, the method assigns reward at the hypothesis level rather than only at the final SID. Experiments on Amazon Reviews datasets show consistent improvements in SID recommendation, and an oracle analysis on Video Games data demonstrates that selecting target‑relevant queries among generated interests boosts recall and ranking.
The paper introduces a retrieval‑grounded credit‑assignment method for generative recommenders that use Semantic IDs (SIDs). By structuring each autoregressive trace into a history summary, a set of interest hypotheses, and a final SID, a frozen retriever verifies each hypothesis as a catalog query. Rewards are assigned at the hypothesis level when any query retrieves the target within the top‑K, allowing distinct updates for rollouts that share the same SID reward and improving SID recommendation performance on Amazon Reviews datasets.
arXiv:2607. 03162v1 Announce Type: new Abstract: LLM-powered agents struggle with personalization when users issue raw, underspecified queries.
arXiv:2609.23880v1 Announce Type: new Abstract: Temporal Information Retrieval (TIR) has been increasingly critical given the rise of Retrieval-Augmented Generation (RAG). Since temporally mismatched...
arXiv:2604. 28076v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have advanced Table Question Answering, where most queries can be answered by extracting information or simple aggregation.
Traditional search systems are optimized to retrieve items that strictly match a query, often prioritizing precision over recall. In e-commerce marketplaces and particularly grocery, this paradigm is limiting, as user satisfaction and commercial outcomes depend heavily on the discoverability of substitute, complementary, and thematically related items.