Xingzhi Yao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xingzhi Yao has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Huimu Wang
Institute of Automation, Chinese Academy of Sciences, Beijing, China
3 shared publications - Mingming Li
Institute of Information Engineering,Chinese Academy of Sciences, Beijing, China
3 shared publications - Songlin Wang
JD.com, Beijing, China
3 shared publications - Sulong Xu
JD.com, Beijing, China
3 shared publications - Yiming Qiu
JD.com, Beijing, China
3 shared publications - Guangtao Nie
JD.com, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4960-4964
Bridging the Gap: Generative Retrieval via Query-to-Multi-Span Framework for Effective E-commerce Search
Generative retrieval formulates document retrieval as an identifier generation task. While prevailing methods increasingly adopt Semantic IDs (SIDs), their opaque nature and rigid mappings struggle with the dynamic inventory and strict interpretability requirements of E-commerce search. Furthermore, generating accurate targets from brief queries against noisy, loosely structured item titles remains a practical challenge. To address these issues, we propose a Query-to-Multi-Span generative retrieval framework tailored for E-commerce. Instead of relying on opaque SIDs or raw titles, our method simplifies the process by generating interpretable multispan identifiers from queries. We align the autoregressive model with user preferences using click logs, and employ a constraintbased beam search to isolate key spans for final item retrieval. This approach explicitly bridges generative models with robust constraint matching, ensuring both matching accuracy and transparency. Extensive offline evaluations demonstrate competitive retrieval performance, and online A/B tests confirm its effectiveness in delivering measurable conversion gains in a production environment.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4960-4964
Open AccessBridging the Gap: Generative Retrieval via Query-to-Multi-Span Framework for Effective E-commerce Search
Generative retrieval formulates document retrieval as an identifier generation task. While prevailing methods increasingly adopt Semantic IDs (SIDs), their opaque nature and rigid mappings struggle with the dynamic inventory and strict interpretability requirements of E-commerce search. Furthermore, generating accurate targets from brief queries against noisy, loosely structured item titles remains a practical challenge. To address these issues, we propose a Query-to-Multi-Span generative retrieval framework tailored for E-commerce. Instead of relying on opaque SIDs or raw titles, our method simplifies the process by generating interpretable multispan identifiers from queries. We align the autoregressive model with user preferences using click logs, and employ a constraintbased beam search to isolate key spans for final item retrieval. This approach explicitly bridges generative models with robust constraint matching, ensuring both matching accuracy and transparency. Extensive offline evaluations demonstrate competitive retrieval performance, and online A/B tests confirm its effectiveness in delivering measurable conversion gains in a production environment.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4507-4512
RAD-DPO: Robust Adaptive Denoising Direct Preference Optimization for Generative Retrieval in E-commerce
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4507-4512
Open AccessRAD-DPO: Robust Adaptive Denoising Direct Preference Optimization for Generative Retrieval in E-commerce
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4987-4992
Towards Efficient and Generalizable Retrieval: Adaptive Semantic Quantization and Residual Knowledge Transfer
While semantic ID-based generative retrieval enables efficient end-to-end modeling in industrial applications, these methods face a persistent trade-off. On one hand, data-rich head items often suffer from ID collisions, which blur their distinct features and degrade downstream tasks. On the other hand, data-sparse tail items especially cold-start items are prone to semantic fragmentation during quantization; they are often mapped as isolated discrete points, which severely hinders their ability to generalize. To address this issue, we propose the Anchored Curriculum with Sequential Adaptive Quantization (SA2CRQ) framework. The framework introduces Sequential Adaptive Residual Quantization (SARQ) to dynamically allocate code lengths based on item path entropy, assigning longer, discriminative IDs to head items and shorter, generalizable IDs to tail items. To mitigate data sparsity, the Anchored Curriculum Residual Quantization (ACRQ) component utilizes a frozen semantic manifold learned from head items to regularize and accelerate the representation learning of tail items. Experimental results from a large-scale industrial search system and multiple public datasets indicate that SA2CRQ yields consistent improvements over existing baselines, particularly in cold-start retrieval scenarios.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4987-4992
Open AccessTowards Efficient and Generalizable Retrieval: Adaptive Semantic Quantization and Residual Knowledge Transfer
While semantic ID-based generative retrieval enables efficient end-to-end modeling in industrial applications, these methods face a persistent trade-off. On one hand, data-rich head items often suffer from ID collisions, which blur their distinct features and degrade downstream tasks. On the other hand, data-sparse tail items especially cold-start items are prone to semantic fragmentation during quantization; they are often mapped as isolated discrete points, which severely hinders their ability to generalize. To address this issue, we propose the Anchored Curriculum with Sequential Adaptive Quantization (SA2CRQ) framework. The framework introduces Sequential Adaptive Residual Quantization (SARQ) to dynamically allocate code lengths based on item path entropy, assigning longer, discriminative IDs to head items and shorter, generalizable IDs to tail items. To mitigate data sparsity, the Anchored Curriculum Residual Quantization (ACRQ) component utilizes a frozen semantic manifold learned from head items to regularize and accelerate the representation learning of tail items. Experimental results from a large-scale industrial search system and multiple public datasets indicate that SA2CRQ yields consistent improvements over existing baselines, particularly in cold-start retrieval scenarios.