UniSearch: Unified Generative Search

• UniSearch is a unified generative search framework that collapses multi-stage pipelines into a single, end-to-end architecture using shared semantic representations.
• It jointly trains a Search Generator and Video Encoder with combined objectives like residual contrastive learning, codebook learning, and next-token prediction to enhance precision and efficiency.
• Constrained decoding with Trie structures and integrated Search Preference Optimization yield improved recall and MRR, demonstrating the framework's effectiveness across multimodal and heterogeneous data retrieval.

Searching arXiv for the cited papers to ground the article in current literature. UniSearch most specifically denotes an end-to-end unified generative search framework for Kuaishou Search that replaces the conventional recall–pre-ranking–ranking cascade with a jointly trained Search Generator and Video Encoder (Chen et al., 8 Sep 2025). In a broader research sense, the term also names a family of “unified” search formulations that collapse previously separate retrieval stages, modalities, query regimes, or downstream tasks into a single representation and inference framework, including instruction-guided multimodal retrieval, joint search–recommendation modeling, metadata-only table union search, and unified index structures for filtered nearest-neighbor search (Wei et al., 2023, Xie et al., 2023, Martorana et al., 28 Feb 2025, Liang et al., 2024). The common objective is not merely architectural simplification, but the replacement of brittle stage-wise or modality-specific pipelines with shared semantic representations, constrained search spaces, and training objectives that align retrieval more closely with the final search goal.

1. Conceptual foundations

The industrial UniSearch paper starts from the standard search-engine cascade: recall, pre-ranking, and ranking. Its critique is twofold. First, each stage is trained separately with different models and loss functions, creating objective inconsistency; second, the multi-module stack increases inference and maintenance complexity, making holistic optimization difficult (Chen et al., 8 Sep 2025). UniSearch therefore reframes search as generation over semantic item identifiers rather than successive filtering and rescoring.

Related work generalizes the same “unification” impulse in other directions. UniIR defines a unified instruction-guided multimodal retriever that handles eight retrieval tasks across ten datasets, arguing that a practical universal multimodal search engine must encode not only query content but also retrieval intention, especially when the candidate pool is heterogeneous across image, text, and image–text pairs (Wei et al., 2023). UIS-Digger identifies a different boundary of unification: conventional LLM agents excel mainly at indexed information seeking, whereas real-world search often requires proactive exploration of overlooked webpages, dynamic interfaces, and embedded files, which motivates a system that combines search, browsing, downloading, and parsing (Liu et al., 9 Mar 2026).

A recurring theme across these systems is that “unified” does not mean a single algorithmic template. In some papers it means replacing cascades with a single generator; in others it means sharing representation spaces across query and candidate modalities, merging user behavior across search and recommendation, or using one index to support multiple query selectivities and filtering regimes (Chen et al., 8 Sep 2025, Wei et al., 2023, Yao et al., 2021, Liang et al., 2024). This suggests that UniSearch is best understood as a systems principle: search quality and efficiency improve when the representational unit, optimization target, and serving mechanism are aligned.

2. End-to-end generative UniSearch

In the narrow sense, UniSearch comprises two main components: a Search Generator and a Video Encoder (Chen et al., 8 Sep 2025). The Search Generator uses an encoder–decoder Transformer. It takes the user query text together with auxiliary user features such as historical behavior sequences, prepends a special <cls> token, and uses the contextualized hidden state of <cls> as the global query embedding $q$. The decoder then autoregressively generates a sequence of semantic tokens

$S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$

which is the semantic identifier of a relevant video item.

The Video Encoder is a unidirectional Transformer that encodes each item from textual metadata, multimodal content features, and side statistical features. These inputs are concatenated with $k$ learnable tokens, producing latent embeddings

$D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$

A VQ-VAE quantizes each $d^{(n)}$ to a codebook entry $e^{(n)}$, and the corresponding discrete code index becomes the semantic token $s^{(n)}$. Each item is thus mapped to a compact semantic ID sequence rather than a document score vector or a term-based posting list (Chen et al., 8 Sep 2025).

The core technical claim is that tokenization and generation are learned jointly rather than in two disconnected stages. The pre-training objective combines residual contrastive learning, codebook learning, and next-token prediction: $$\mathcal{L} = \lambda_{1}\mathcal{L}_{\text{contrast}} + \lambda_{2}\mathcal{L}_{\text{codebook}} + \lambda_{3}\mathcal{L}_{\text{NTP}}.$$ The residual contrastive component progressively aligns query and item semantics across token positions,

$$\mathcal{L}_{\text{contrast}} = \sum_{n=1}^{k} \mathcal{L}\Big(q_i,\operatorname{sg}\big[\sum_{m<n} d_i^{(m)}\big] + d_i^{(n)}\Big),$$

with

$$\mathcal{L}(q,d) = -\log \frac{\exp(\operatorname{sim}(q,d)/\tau)}{\exp(\operatorname{sim}(q,d)/\tau)+\sum_{d^- \in \mathcal{N}}\exp(\operatorname{sim}(q,d^-)/\tau)},$$

and

$S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$0

The next-token prediction loss trains the generator directly on item IDs: $S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$1 A coarse-to-fine schedule further structures learning: earlier tokens model coarse discrimination using in-batch negatives, while later tokens face semantically harder negatives (Chen et al., 8 Sep 2025).

This training design is echoed in other generative retrieval systems. GenTUS reformulates table union search as constrained generation over discrete semantic table identifiers rather than encode–search–rerank, and uses a unionability-aware contrastive loss so that unionable tables receive nearby latent vectors before seq2seq generation (Zhang et al., 1 Jul 2026). A plausible implication is that generative UniSearch is part of a broader shift from “retrieve candidates, then judge them” toward “generate valid candidate identities directly.”

3. Semantic identifiers, constrained decoding, and preference alignment

Semantic identifiers are central to UniSearch because they define both the retrieval vocabulary and the output space. The paper uses a three-level codebook in its live-search configuration and reports that codebook depth saturates when depth exceeds $S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$2; deeper codebooks increase latency and generalization difficulty. Codebook size also exhibits a precision–coverage trade-off: larger codebooks improve MRR but reduce recall, leading to a practical choice of $S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$3 in live search (Chen et al., 8 Sep 2025).

Serving depends on constrained generation. UniSearch uses a Trie so that decoding is restricted to valid semantic ID paths, a requirement that is especially important in live search where content changes rapidly. The reported effect is substantial: the Trie improves path validity from $S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$4 to $S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$5, while also improving Recall@300 and MRR (Chen et al., 8 Sep 2025). Constrained decoding plays an analogous role in GenTUS, where a prefix tree over valid table identifiers masks invalid next tokens by assigning them logit $S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$6, ensuring that every completed sequence corresponds to a real table in the data lake (Zhang et al., 1 Jul 2026).

After pre-training, UniSearch adds Search Preference Optimization (SPO), which aligns generation with production ranking signals and real user behavior. The reward combines a system-estimated component and a user-interaction component: $S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$7 Candidate generations are scored relative to one another through

$S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$8

and optimized with a policy-style objective regularized toward a reference policy (Chen et al., 8 Sep 2025). The paper reports that SPO yields modest recall gains but substantial MRR gains, indicating stronger effects on ranking quality than on coarse coverage.

Offline and online results place this architecture in a production setting rather than a benchmark-only regime. UniSearch was evaluated on about 80 million live-search sessions collected from July 9 to July 23, 2025, and deployed in both live search and short-video search. In live search, the online A/B test reports $S=\{s^{(1)}, s^{(2)}, \ldots, s^{(k)}\},$9 on TPC, $k$0 on CTR, $k$1 on CQR, and $k$2 on FCP/PFC; the paper characterizes the live-search deployment as the largest single-experiment improvement in recent years of that product’s history (Chen et al., 8 Sep 2025).

4. Multimodal, semantic, and interaction-level unification

Unified search is not limited to generative item retrieval. UniIR extends the idea to multimodal information retrieval by training a single instruction-guided retriever across eight task types, including $k$3, $k$4, and $k$5, using ten datasets assembled into the M-BEIR benchmark (Wei et al., 2023). On the full 5.6M global candidate pool, the best UniIR variants achieve average Recall@5 of $k$6 for CLIP$k$7 and $k$8 for BLIP$k$9, compared with $D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$0 and $D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$1 for their multitask baselines. The paper’s error analysis is especially notable: wrong-modality error rates drop from around $D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$2 for CLIP$D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$3 and $D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$4 for BLIP$D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$5, supporting the claim that instruction tuning teaches the retriever to follow retrieval intent rather than merely semantic similarity (Wei et al., 2023).

UniDex preserves the inverted-index paradigm but replaces lexical terms with semantic IDs. Its UniTouch component encodes queries and documents into discrete SIDs using finite scalar quantization, while UniRank reranks candidates with ColBERT-style late interaction. UniTouch uses Max–Max matching,

$D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$6

whereas UniRank scores candidates with

$D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$7

On a 10 million-video offline evaluation pool, the strongest UniDex variant reaches $D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$8 Recall@300 and $D=\{d^{(1)}, d^{(2)}, \ldots, d^{(k)}\}.$9 MRR@10 on the ranking and click subsets, and in online deployment reduces 20,550 cores, 37 TB memory/storage, and 25% latency while improving CTR by $d^{(n)}$0 and VPD by $d^{(n)}$1 (Li et al., 29 Sep 2025).

EMUSE shows how multimodal unification operates in a scientific domain rather than a consumer search engine. It fine-tunes OpenCLIP on 2,900 radio galaxies and indexes about 170,000 extended EMU radio sources as multimodal embeddings, enabling both image- and text-based search over radio and infrared cutouts. Search is defined by cosine similarity in a shared embedding space,

$d^{(n)}$2

and the paper reports classification accuracy of about $d^{(n)}$3 after 100 epochs, along with the practical observation that embeddings require only a few hundred megabytes whereas the original images would require over 150 GB (Gupta et al., 18 Jun 2025). This suggests that UniSearch-like principles are portable to domain-specific corpora when query modality and corpus modality must be aligned in a common latent space.

5. Joint search with recommendation, browsing, and structured data discovery

Another major line of unification concerns user behavior rather than content modality. USER integrates search and recommendation into a heterogeneous behavior sequence of queries, clicked documents, and browsed articles, and treats recommendation as personalized search with an empty query. It separates short-term and long-term history, uses co-attention for search behaviors, and applies unified pre-training followed by task-specific fine-tuning (Yao et al., 2021). UnifiedSSR refines this direction with a dual-branch network that models recommendation product interactions, search product interactions, and user-issued queries as three distinct behavior types, together with an Intent-oriented Session Modeling module and self-supervised losses for session discrimination and alignment: $d^{(n)}$4 On JDsearch, UnifiedSSR reports HR@5 $d^{(n)}$5, HR@10 $d^{(n)}$6, NDCG@5 $d^{(n)}$7, and NDCG@10 $d^{(n)}$8, while also improving recommendation metrics on Amazon-CL and Amazon-EL (Xie et al., 2023).

UIS-Digger expands unification from ranking to action space. It defines Unindexed Information Seeking as cases where search-engine results and indexed context are insufficient, formalizing indexed and unindexed information as $d^{(n)}$9 and $e^{(n)}$0. The system uses four agents—Planner, Web Searcher, Web Surfer, and File Reader—and a dual-mode, memory-shared browsing strategy that combines textual and visual browsing while supporting simultaneous webpage searching and file parsing (Liu et al., 9 Mar 2026). On the UIS-QA benchmark of 110 expert-annotated QA pairs, even strong agents drop sharply relative to conventional benchmarks; UIS-Digger sets a baseline at $e^{(n)}$1, compared with $e^{(n)}$2 in the abstract for state-of-the-art agents on UIS-QA and much higher scores on GAIA and BrowseComp-zh (Liu et al., 9 Mar 2026).

Structured-data search has produced parallel notions of UniSearch. Metadata Union Search (MUS) performs table union search for restricted-access data using only metadata, semantic data types, and DBpedia property annotations, explicitly excluding underlying values. On ALT-gen, it reports 81% accuracy in the best reported unionability setting and outperforms existing benchmarks in precision and recall (Martorana et al., 28 Feb 2025). Table-centric and generative formulations extend this further: TACTUS learns one embedding per table and performs adaptive table-first retrieval before column reranking, while GenTUS replaces encode–ANN–rerank with constrained generation over semantic table identifiers and achieves average rank 1.05 compared to 2.57 for the strongest baseline across seven public TUS benchmarks (Sun et al., 18 Mar 2026, Zhang et al., 1 Jul 2026).

6. Unified indexes, limits, and open directions

In many systems, unification occurs below the model level, in the index itself. UNIFY addresses Range Filtered Approximate Nearest Neighbors Search by constructing a single Proximity Graph-based index that supports pre-filtering, post-filtering, and hybrid filtering through the Segmented Inclusive Graph and its hierarchical variant HSIG. The design goal is that the PG of objects from any segment combination is a subgraph of the unified index, enabling efficient reconstruction and query-time strategy selection (Liang et al., 2024). Experiments report that HSIG achieves two orders of magnitude higher QPS than ADBV on GloVe and GIST1M, one order of magnitude higher than NHQ on SIFT1M, and up to 2.29× better than SeRF, while also outperforming a dedicated multi-index design by up to 1.1× (Liang et al., 2024).

Spadas applies a similar philosophy to spatial repositories, building a two-level unified index that supports both dataset-level and point-level spatial search, together with parameter-free outlier removal and shared pruning. Its approximate Hausdorff search has error bounded by $e^{(n)}$3, and experiments over six repositories report up to 81.6% speedup over exact Hausdorff methods, up to 90% accuracy, and up to seven orders of magnitude speedup for nearest-neighbor point search (Yang et al., 2024). ULISSE provides another example in time-series search: a single index supports variable-length subsequence matching under both Euclidean Distance and Dynamic Time Warping, for exact and approximate search, $e^{(n)}$4-NN and $e^{(n)}$5-range queries, and both normalized and non-normalized series, with reported speedups up to 12× over UCR Suite for exact Euclidean search and up to 15× over CMRI for approximate Euclidean search (Linardi et al., 2020).

A common misconception is that unified search necessarily means dense end-to-end neural generation. The literature does not support that equivalence. UniDex keeps inverted retrieval but semanticizes the index; UNIFY keeps graph ANN search but unifies query-range regimes; Spadas keeps tree-based spatial pruning but unifies data granularities; MUS keeps thresholded cosine search over metadata embeddings without exposing raw data (Li et al., 29 Sep 2025, Liang et al., 2024, Yang et al., 2024, Martorana et al., 28 Feb 2025). Conversely, the strongest generative systems still rely on validity constraints, identifier design, and explicit reward shaping rather than unconstrained sequence generation (Chen et al., 8 Sep 2025, Zhang et al., 1 Jul 2026).

The principal limitations are likewise shared across formulations. UniSearch currently generates candidates in a point-wise manner using beam search, which the paper notes may limit result diversity (Chen et al., 8 Sep 2025). UniIR remains far from perfect on difficult Wikipedia-style evidence retrieval and compositional tasks (Wei et al., 2023). EMUSE is brittle with respect to prompt wording and rare-source coverage (Gupta et al., 18 Jun 2025). UIS-Digger’s 27.27% accuracy on UIS-QA is still far from satisfactory (Liu et al., 9 Mar 2026). TUS systems remain sensitive to metadata quality, annotation availability, or quantizer collision handling depending on the method (Martorana et al., 28 Feb 2025, Zhang et al., 1 Jul 2026). The broader trajectory, however, is consistent: search research is moving toward unified representations and unified serving abstractions, but not toward a single universal architecture. The more defensible conclusion is that UniSearch is an organizing paradigm for aligning representation, retrieval, ranking, and system constraints within one coherent search space.