We present WeSearch, a unified, model-centric retrieval framework for large-scale, continuously evolving content search. Prevailing methods assign documents fixed hierarchical Semantic IDs, implicitly assuming each document follows a single coherent semantic path-an assumption that often breaks down for multi-topic documents. WeSearch instead retrieves query-relevant clusters and then ranks atomic documents within the resulting query-specific candidate space, decoupling candidate pruning from fine-grained relevance modeling. Combined with relevance-aware training, compact document representations, and incremental index updates, this design enables weekly-or daily when needed-model refreshes. Deployed as the primary semantic retrieval path in WeChat Search alongside a lexical syntax tree, WeSearch shows consistent one-week A/B gains on corpora from hundreds of millions to billions of documents, and a one-month full-traffic A/B test confirms stable improvements of +0.68% CTR and +2.27% per-user article clicks, together with a 41% reduction in retrieval resource cost and a 19 ms reduction in graphic-text retrieval latency. WeSearch is now fully deployed in WeChat Search, serving 100% of production traffic.
Figures & tables
Figure 1: Comparison between the existing retrieval system and the proposed retrieval system. (a) The existing system combines multiple lexical and dense retrieval sources. (b) The proposed system uses model-centric retrieval as the primary semantic retrieval path and retains one syntax tree as a complementary lexical retrieval source.
Figure 2: Overview of WeSearch. Clusters first define a query-specific candidate document space, over which fine-grained document-level ranking produces the final results.
Figure 3: The offline index construction procedure.
Figure 4: Rolling mounting of fresh documents. New documents are assigned to the existing cluster space, quantized with fixed codebooks, and made visible through an atomic index update.
Figure 5: Experimental results on the Base corpus.
Clustering
Doc Memory
Recall@300
2k×1k
OPQ (32,256)
46.66%
2k×1k
OPQ (32,512)
47.10%
2k×1k
OPQ (64,256)
51.54%
10k×200
OPQ (64,256)
51.34%
2k×1k
Dense( 32 )
33.07%
Table 1: Ablation on clustering structure and document memory. a×b denotes two-level RQ-KMeans with a coarse clusters, each split into b sub-clusters. OPQ(m,K) denotes m sub-spaces with codebook size K (Sec. 3.2.2 ); Dense( 32 ) stores a 32 -dim embedding without quantization. Cluster Recall@ 10k is stable across all rows and is therefore omitted.
Method
Relevance–1
Relevance–2
Long Dwell
Effective Click
Online
0.3621
0.3087
0.4407
0.4604
WeSearch w/o features & mining
0.4072
0.3277
0.4323
0.4379
WeSearch w/o mining
0.4271
0.3865
0.4961
0.4973
WeSearch (full)
0.4344
0.3794
0.5505
0.5481
Table 2: Ablation of structured document features and training-data mining in WeSearch, measured by Recall@100. “w/o features & mining” uses only semantic embeddings and the basic relevance supervision; “w/o mining” adds structured document features; the full model further incorporates multi-source positive/negative mining.
Method
Satisfaction density
Relevance density
Online
0.1732
0.4575
WeSearch
0.1871
0.4662
WeSearch + one syntax tree
0.2088
0.4854
Table 3: Teacher-assessed high-quality result density.
Evaluation group
CTR
Base corpus
+0.27%
Expanded corpus
+0.61%
Expanded corpus with Fresh corpus
+0.53%
Long-query traffic †
+1.10%
Table 4: Relative changes in CTR in the one-week online A/B test, compared with the corresponding production baselines. The first three rows report full-traffic results under each corpus configuration. † Long-query traffic is evaluated on the Expanded corpus with Fresh corpus configuration. Bold values indicate statistically significant gains ( p<0.05 ).
Metric
Relative change
CTR
+0.68%
Dwell time †
+0.71%
Article clicks ‡
+2.27%
Table 5: Relative changes in the one-month online A/B test on the Expanded corpus with Fresh corpus under full traffic, compared with the corresponding production baseline. † Average per-user dwell time on the search results page. ‡ Per-user clicks on WeChat Official Account articles from search results. Bold values indicate statistically significant gains ( p<0.05 ).
While language models have become dramatically more capable, retrieval still largely relies on lexical matching or similarity in fixed embedding spaces. This creates a capability asymmetry: what the retriever fails to find, even the strongest generator cannot recover. We propose DecisionRAG, which brings the capabilities of pretrained language models to retrieval using decision models that jointly evaluate candidate branches in a single forward pass, without generating any tokens, and show that judging candidates in a shared context makes their relevance estimates comparable. Like a person browsing a library, DecisionRAG navigates the corpus's inherent structure from broad topics down to individual passages, deciding at each level which branches are worth exploring. Without task-specific training or a first-stage retriever, DecisionRAG outperforms dense retrieval with an 8B reranker by 13.8 R@1 points on MultiDoc2Dial and 17.4 Hit@1 points on Natural Questions. Across four benchmarks, including a corpus of 2.68 million Wikipedia paragraphs, retrieval takes just 0.7-1.8 seconds per query.
Chao Wan, Paul Jünger, Beixi Du +3
Department of Computer Science, Cornell University, New York, USA · ASAPP, New York, USA
Retrieval models for recommendation need to account for outcomes such as watch time while searching large item corpora efficiently. We present the Controllable Retrieval Model (CRM), an outcome-conditioned retrieval framework that adds watch time as an input to the user tower. During training, CRM learns to predict the next item given its observed watch time; at inference, we supply a desired watch time to steer retrieval without retraining. The item tower is independent of the condition, so item embeddings can still be precomputed and indexed for approximate nearest neighbor (ANN) search. We implement CRM as both a DNN-based two-tower model and a Decision Transformer. The Transformer interleaves item tokens with watch-time-to-go condition tokens, using the target watch time as a numerical prompt for next-item prediction. For each online request, we choose between the average and maximum watch times in the user's recent history as the condition. CRM is deployed in Kuaishou's short-video recommendation system, which serves over 400 million users. Online A/B tests show video watch time improvements of 0.372% in Kuaishou and 0.457% in Kuaishou Lite.
Chi Liu, Jiangxia Cao, Rui Huang +5
Kuaishou Technology, Beijing, China · Unaffiliated
Existing deep-research agents use a Search--Visit workflow that retrieves whole webpages without considering the structure they expose through titles, headings, sections, and metadata. This prevents agents from directly constraining retrieval to parts of a webpage and often carries irrelevant content into their context. We introduce Sieve, a search--inspect--fetch strategy driven by a Boolean Query Language (BQL): it searches webpage fields to filter candidates, uses an interchangeable ranker to order them, presents structure-rich result cards for inspection, and fetches only selected sections. Across three QA collections, Sieve is more accurate than the strongest conventional Search--Visit configuration on each collection while using 20.7--50.6% fewer tokens. Boolean filtering improves every tested ranker, and the accuracy--context advantage persists across retriever choices and agent backbones. Our implementation is included in the SkimSearchAgent library at https://github.com/ielab/skim-search-agent.
Shuai Wang, Haodong Chen, Yu Yin +3
The University of Queensland, Brisbane, Australia · CSIRO, Brisbane, Australia