Xuanping Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xuanping Li has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Cunyi Zhang
Kuaishou Technology, Beijing, China
2 shared publications - Haitao Yang
Kuaishou Technology Co., Ltd., Beijing, China
2 shared publications - Kaiqiao Zhan
Kuaishou Technology, Beijing, China
2 shared publications - Kun Gai
Kuaishou Technology, Beijing, China
2 shared publications - Shunyu Zhang
Kuaishou Technology, Beijing, China
2 shared publications - Wenwu Ou
Kuaishou Technology, Beijing, China
2 shared publications
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
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7636-7644
HGenPush: A Heterogeneous Generative Recommendation Architecture for Industrial Push Notification Systems
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7636-7644
Open AccessHGenPush: A Heterogeneous Generative Recommendation Architecture for Industrial Push Notification Systems
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1073-1077
PushGen: Push Notifications Generation with LLM
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1073-1077
Open AccessPushGen: Push Notifications Generation with LLM
- Open Access
- 30 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 1120-1124
TIM: Temporal Interaction Model in Notification System
Modern mobile applications heavily rely on the notification system to acquire daily active users and enhance user engagement. Being able to proactively reach users, the system has to decide when to send notifications to users. Although many researchers have studied optimizing the timing of sending notifications, they only utilized users' contextual features, without modeling users' behavior patterns. Additionally, these efforts only focus on individual notifications, and there is a lack of studies on optimizing the holistic timing of multiple notifications within a period. To bridge these gaps, we propose the Temporal Interaction Model (TIM), which models users' behavior patterns by estimating CTR in every time slot over a day in our short video application Kuaishou. TIM leverages long-term user historical interaction sequence features such as notification receipts, clicks, watch time and effective views, and employs a temporal attention unit (TAU) to extract user behavior patterns. Moreover, we provide an elegant strategy of holistic notifications send time control to improve user engagement while minimizing disruption. We evaluate the effectiveness of TIM through offline experiments and online A/B tests. The results indicate that TIM is a reliable tool for forecasting user behavior, leading to a remarkable enhancement in user engagement without causing undue disturbance.
- 30 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 1120-1124
Open AccessTIM: Temporal Interaction Model in Notification System
Modern mobile applications heavily rely on the notification system to acquire daily active users and enhance user engagement. Being able to proactively reach users, the system has to decide when to send notifications to users. Although many researchers have studied optimizing the timing of sending notifications, they only utilized users' contextual features, without modeling users' behavior patterns. Additionally, these efforts only focus on individual notifications, and there is a lack of studies on optimizing the holistic timing of multiple notifications within a period. To bridge these gaps, we propose the Temporal Interaction Model (TIM), which models users' behavior patterns by estimating CTR in every time slot over a day in our short video application Kuaishou. TIM leverages long-term user historical interaction sequence features such as notification receipts, clicks, watch time and effective views, and employs a temporal attention unit (TAU) to extract user behavior patterns. Moreover, we provide an elegant strategy of holistic notifications send time control to improve user engagement while minimizing disruption. We evaluate the effectiveness of TIM through offline experiments and online A/B tests. The results indicate that TIM is a reliable tool for forecasting user behavior, leading to a remarkable enhancement in user engagement without causing undue disturbance.
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 629-638
Query-dominant User Interest Network for Large-Scale Search Ranking
Historical behaviors have shown great effect and potential in various prediction tasks, including recommendation and information retrieval. The overall historical behaviors are various but noisy while search behaviors are always sparse. Most existing approaches in personalized search ranking adopt the sparse search behaviors to learn representation with bottleneck, which do not sufficiently exploit the crucial long-term interest. In fact, there is no doubt that user long-term interest is various but noisy for instant search, and how to exploit it well still remains an open problem. To tackle this problem, in this work, we propose a novel model named Query-dominant user Interest Network (QIN), including two cascade units to filter the raw user behaviors and reweigh the behavior subsequences. Specifically, we propose a relevance search unit (RSU), which aims to search a subsequence relevant to the query first and then search the sub-subsequences relevant to the target item. These items are then fed into an attention unit called Fused Attention Unit (FAU). It should be able to calculate attention scores from the ID field and attribute field separately, and then adaptively fuse the item embedding and content embedding based on the user engagement of past period. Extensive experiments and ablation studies on real-world datasets demonstrate the superiority of our model over state-of-the-art methods. The QIN now has been successfully deployed on Kuaishou search, an online video search platform, and obtained 7.6% improvement on CTR.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 629-638
Open AccessQuery-dominant User Interest Network for Large-Scale Search Ranking
Historical behaviors have shown great effect and potential in various prediction tasks, including recommendation and information retrieval. The overall historical behaviors are various but noisy while search behaviors are always sparse. Most existing approaches in personalized search ranking adopt the sparse search behaviors to learn representation with bottleneck, which do not sufficiently exploit the crucial long-term interest. In fact, there is no doubt that user long-term interest is various but noisy for instant search, and how to exploit it well still remains an open problem. To tackle this problem, in this work, we propose a novel model named Query-dominant user Interest Network (QIN), including two cascade units to filter the raw user behaviors and reweigh the behavior subsequences. Specifically, we propose a relevance search unit (RSU), which aims to search a subsequence relevant to the query first and then search the sub-subsequences relevant to the target item. These items are then fed into an attention unit called Fused Attention Unit (FAU). It should be able to calculate attention scores from the ID field and attribute field separately, and then adaptively fuse the item embedding and content embedding based on the user engagement of past period. Extensive experiments and ablation studies on real-world datasets demonstrate the superiority of our model over state-of-the-art methods. The QIN now has been successfully deployed on Kuaishou search, an online video search platform, and obtained 7.6% improvement on CTR.