Jiwei Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiwei Tan has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Shaowei Yao
Taobao & Tmall Group of Alibaba, Hangzhou, China
2 shared publications - Xi Chen
Alibaba Group, Hangzhou, China
2 shared publications - Bo Zheng
Alibaba Group, Hangzhou, China
1 shared publication - Dan Ou
Taobao & Tmall Group of Alibaba, Hangzhou, China
1 shared publication - Guoliang Zhang
Kuaishou Technology, Beijing, China
1 shared publication - Hanqi Jin
Taobao & Tmall Group of Alibaba, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1379-1388
PLAIN: An Explainable Generative Search System Enhanced by Multi-granularity Semantic Alignment
Industrial search platforms must efficiently retrieve relevant items from billions of candidates while satisfying both query relevance and user preferences. Generative Search (GS) has emerged as a transformative paradigm that reformulates traditional indexing and matching as an autoregressive generation task. However, most existing generative search models suffer from two critical deficiencies: (1) generated Semantic IDs (SIDs) often lack explicit semantic correspondences, undermining codebook interpretability; (2) unstructured codebooks impose a fully-connected search space, forcing the generator to navigate a highly entangled decoding path. To address these limitations, we propose PLAIN, which integrates Multi-stage Codebook Construction (MCC) and Unified Generative Retrieval (UGR). MCC leverages LLM-generated taxonomy and metadata labels, applying hard assignment for closed-set taxonomy levels and soft assignment for open-set metadata levels, transforming unstructured codebooks into interpretable hierarchical topic paths. UGR operationalizes the MCC schema by employing Symmetric Context Encoders (SCE) that align both query and item representations to the structured label space via knowledge distillation and semi-supervised hierarchical quantization, enabling consistent end-to-end generative retrieval. Extensive experiments and online A/B testing in Kuaishou’s live search system demonstrate significant improvements in user engagement and content consumption.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1379-1388
Open AccessPLAIN: An Explainable Generative Search System Enhanced by Multi-granularity Semantic Alignment
Industrial search platforms must efficiently retrieve relevant items from billions of candidates while satisfying both query relevance and user preferences. Generative Search (GS) has emerged as a transformative paradigm that reformulates traditional indexing and matching as an autoregressive generation task. However, most existing generative search models suffer from two critical deficiencies: (1) generated Semantic IDs (SIDs) often lack explicit semantic correspondences, undermining codebook interpretability; (2) unstructured codebooks impose a fully-connected search space, forcing the generator to navigate a highly entangled decoding path. To address these limitations, we propose PLAIN, which integrates Multi-stage Codebook Construction (MCC) and Unified Generative Retrieval (UGR). MCC leverages LLM-generated taxonomy and metadata labels, applying hard assignment for closed-set taxonomy levels and soft assignment for open-set metadata levels, transforming unstructured codebooks into interpretable hierarchical topic paths. UGR operationalizes the MCC schema by employing Symmetric Context Encoders (SCE) that align both query and item representations to the structured label space via knowledge distillation and semi-supervised hierarchical quantization, enabling consistent end-to-end generative retrieval. Extensive experiments and online A/B testing in Kuaishou’s live search system demonstrate significant improvements in user engagement and content consumption.
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5398-5408
Deep Bag-of-Words Model: An Efficient and Interpretable Relevance Architecture for Chinese E-Commerce
Text relevance or text matching of query and product is an essential technique for the e-commerce search system to ensure that the displayed products can match the intent of the query. Many studies focus on improving the performance of the relevance model in search system. Recently, pre-trained language models like BERT have achieved promising performance on the text relevance task. While these models perform well on the offline test dataset, there are still obstacles to deploy the pre-trained language model to the online system as their high latency. The two-tower model is extensively employed in industrial scenarios, owing to its ability to harmonize performance with computational efficiency. Regrettably, such models present an opaque ''black box'' nature, which prevents developers from making special optimizations. In this paper, we raise deep Bag-o f-Words (DeepBoW) model, an efficient and interpretable relevance architecture for Chinese e-commerce. Our approach proposes to encode the query and the product into the sparse BoW representation, which is a set of word-weight pairs. The weight means the important or the relevant score between the corresponding word and the raw text. The relevance score is measured by the accumulation of the matched word between the sparse BoW representation of the query and the product. Compared to popular dense distributed representation that usually suffers from the drawback of black-box, the most advantage of the proposed representation model is highly explainable and interventionable, which is a superior advantage to the deployment and operation of online search engines. Moreover, the online efficiency of the proposed model is even better than the most efficient inner product form of dense representation. The proposed model is experimented on three different datasets for learning the sparse BoW representations, including the human-annotation set, the search-log set and the click-through set. Then the models are evaluated by experienced human annotators. Both the auto metrics and the online evaluations show our DeepBoW model achieves competitive performance while the online inference is much more efficient than the other models. Our DeepBoW model has already deployed to the biggest Chinese e-commerce search engine Taobao and served the entire search traffic for over 6 months.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5398-5408
Open AccessDeep Bag-of-Words Model: An Efficient and Interpretable Relevance Architecture for Chinese E-Commerce
Text relevance or text matching of query and product is an essential technique for the e-commerce search system to ensure that the displayed products can match the intent of the query. Many studies focus on improving the performance of the relevance model in search system. Recently, pre-trained language models like BERT have achieved promising performance on the text relevance task. While these models perform well on the offline test dataset, there are still obstacles to deploy the pre-trained language model to the online system as their high latency. The two-tower model is extensively employed in industrial scenarios, owing to its ability to harmonize performance with computational efficiency. Regrettably, such models present an opaque ''black box'' nature, which prevents developers from making special optimizations. In this paper, we raise deep Bag-o f-Words (DeepBoW) model, an efficient and interpretable relevance architecture for Chinese e-commerce. Our approach proposes to encode the query and the product into the sparse BoW representation, which is a set of word-weight pairs. The weight means the important or the relevant score between the corresponding word and the raw text. The relevance score is measured by the accumulation of the matched word between the sparse BoW representation of the query and the product. Compared to popular dense distributed representation that usually suffers from the drawback of black-box, the most advantage of the proposed representation model is highly explainable and interventionable, which is a superior advantage to the deployment and operation of online search engines. Moreover, the online efficiency of the proposed model is even better than the most efficient inner product form of dense representation. The proposed model is experimented on three different datasets for learning the sparse BoW representations, including the human-annotation set, the search-log set and the click-through set. Then the models are evaluated by experienced human annotators. Both the auto metrics and the online evaluations show our DeepBoW model achieves competitive performance while the online inference is much more efficient than the other models. Our DeepBoW model has already deployed to the biggest Chinese e-commerce search engine Taobao and served the entire search traffic for over 6 months.
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 3988-3992
MSRA: A Multi-Aspect Semantic Relevance Approach for E-Commerce via Multimodal Pre-Training
To enhance the effectiveness of matching user requests with millions of online products, practitioners invest significant efforts in developing semantic relevance models on large-scale e-commerce platforms. Generally, such semantic relevance models are formulated as text-matching approaches, which measure the relevance between users' search queries and the titles of candidate items (i.e., products). However, we argue that conventional relevance methods may lead to sub-optimal performance due to the limited information provided by the titles of candidate items. To alleviate this issue, we suggest incorporating additional information about candidate items from multiple aspects, including their attributes and images. This could supplement the information that may not be fully provided by titles alone. To this end, we propose a multi-aspect semantic relevance model that takes into account the match between search queries and the title, attribute and image information of items simultaneously. The model is further enhanced through pre-training using several well-designed self-supervised and weakly-supervised tasks. Furthermore, the proposed model is fine-tuned using annotated data and distilled into a representation-based architecture for efficient online deployment. Experimental results show the proposed approach significantly improves relevance and leads to considerable enhancements in business metrics.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 3988-3992
Open AccessMSRA: A Multi-Aspect Semantic Relevance Approach for E-Commerce via Multimodal Pre-Training
To enhance the effectiveness of matching user requests with millions of online products, practitioners invest significant efforts in developing semantic relevance models on large-scale e-commerce platforms. Generally, such semantic relevance models are formulated as text-matching approaches, which measure the relevance between users' search queries and the titles of candidate items (i.e., products). However, we argue that conventional relevance methods may lead to sub-optimal performance due to the limited information provided by the titles of candidate items. To alleviate this issue, we suggest incorporating additional information about candidate items from multiple aspects, including their attributes and images. This could supplement the information that may not be fully provided by titles alone. To this end, we propose a multi-aspect semantic relevance model that takes into account the match between search queries and the title, attribute and image information of items simultaneously. The model is further enhanced through pre-training using several well-designed self-supervised and weakly-supervised tasks. Furthermore, the proposed model is fine-tuned using annotated data and distilled into a representation-based architecture for efficient online deployment. Experimental results show the proposed approach significantly improves relevance and leads to considerable enhancements in business metrics.