Songlin Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Songlin Wang has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Sulong Xu
JD.com, Beijing, China
6 shared publications - Huimu Wang
Institute of Automation, Chinese Academy of Sciences, Beijing, China
5 shared publications - Mingming Li
Institute of Information Engineering,Chinese Academy of Sciences, Beijing, China
5 shared publications - Yiming Qiu
JD.com, Beijing, China
5 shared publications - Guoyu Tang
JD.com, Beijing, China
3 shared publications - Xingzhi Yao
JD.com, Beijing, China
3 shared publications
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. 4955-4959
Query-Attention Dual-Stream Framework with Cross-Category Transfer for Efficient Fine-Grained Interest Pre-Ranking
Large-scale search and recommendation systems typically adopt a cascaded architecture of retrieval, pre-ranking, ranking, and re-ranking to balance efficiency and accuracy. However, pre-ranking still faces challenges of behavioral sparsity, limited interest diversity, and computational latency. We propose the Query-Attention Dual-Stream (QADS) framework to address these issues. QADS partitions user behaviors into strongly and weakly correlated streams and further decomposes them into fine-grained subsequences guided by domain knowledge. A query-centric attention mechanism reduces complexity from O(N) to O(1), enabling efficient inter- and intra-sequence modeling. A contrastive cross-category transfer module propagates dense patterns from weakly correlated to sparse domains, while a latency-aware parallel inference architecture further reduces delay by 36%. Experiments on public and industrial datasets show that QADS delivers significant performance improvements and has been successfully deployed in large-scale e-commerce search systems.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4955-4959
Open AccessQuery-Attention Dual-Stream Framework with Cross-Category Transfer for Efficient Fine-Grained Interest Pre-Ranking
Large-scale search and recommendation systems typically adopt a cascaded architecture of retrieval, pre-ranking, ranking, and re-ranking to balance efficiency and accuracy. However, pre-ranking still faces challenges of behavioral sparsity, limited interest diversity, and computational latency. We propose the Query-Attention Dual-Stream (QADS) framework to address these issues. QADS partitions user behaviors into strongly and weakly correlated streams and further decomposes them into fine-grained subsequences guided by domain knowledge. A query-centric attention mechanism reduces complexity from O(N) to O(1), enabling efficient inter- and intra-sequence modeling. A contrastive cross-category transfer module propagates dense patterns from weakly correlated to sparse domains, while a latency-aware parallel inference architecture further reduces delay by 36%. Experiments on public and industrial datasets show that QADS delivers significant performance improvements and has been successfully deployed in large-scale e-commerce search systems.
- 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.
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 3694-3698
MODRL-TA: A Multi-Objective Deep Reinforcement Learning Framework for Traffic Allocation in E-Commerce Search
Traffic allocation is a process of redistributing natural traffic to products by adjusting their positions in the post-search phase, aimed at effectively fostering merchant growth, precisely meeting customer demands, and ensuring the maximization of interests across various parties within e-commerce platforms. Existing methods based on learning to rank neglect the long-term value of traffic allocation, whereas approaches of reinforcement learning suffer from balancing multiple objectives and the difficulties of cold starts within real-world data environments. To address the aforementioned issues, this paper propose a multi-objective deep reinforcement learning framework consisting of multi-objective Q-learning (MOQ), a decision fusion algorithm (DFM) based on the cross-entropy method(CEM), and a progressive data augmentation system (PDA). Specifically. MOQ constructs ensemble RL models, each dedicated to an objective, such as click-through rate, conversion rate, etc. These models individually determine the position of items as actions, aiming to estimate the long-term value of multiple objectives from an individual perspective. Then we employ DFM to dynamically adjust weights among objectives to maximize long-term value, addressing temporal dynamics in objective preferences in e-commerce scenarios. Initially, PDA trained MOQ with simulated data from offline logs. As experiments progressed, it strategically integrated real user interaction data, ultimately replacing the simulated dataset to alleviate distributional shifts and the cold start problem. Experimental results on real-world online e-commerce systems demonstrate the significant improvements of MODRL-TA, and we have successfully deployed MODRL-TA on an e-commerce search platform.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 3694-3698
Open AccessMODRL-TA: A Multi-Objective Deep Reinforcement Learning Framework for Traffic Allocation in E-Commerce Search
Traffic allocation is a process of redistributing natural traffic to products by adjusting their positions in the post-search phase, aimed at effectively fostering merchant growth, precisely meeting customer demands, and ensuring the maximization of interests across various parties within e-commerce platforms. Existing methods based on learning to rank neglect the long-term value of traffic allocation, whereas approaches of reinforcement learning suffer from balancing multiple objectives and the difficulties of cold starts within real-world data environments. To address the aforementioned issues, this paper propose a multi-objective deep reinforcement learning framework consisting of multi-objective Q-learning (MOQ), a decision fusion algorithm (DFM) based on the cross-entropy method(CEM), and a progressive data augmentation system (PDA). Specifically. MOQ constructs ensemble RL models, each dedicated to an objective, such as click-through rate, conversion rate, etc. These models individually determine the position of items as actions, aiming to estimate the long-term value of multiple objectives from an individual perspective. Then we employ DFM to dynamically adjust weights among objectives to maximize long-term value, addressing temporal dynamics in objective preferences in e-commerce scenarios. Initially, PDA trained MOQ with simulated data from offline logs. As experiments progressed, it strategically integrated real user interaction data, ultimately replacing the simulated dataset to alleviate distributional shifts and the cold start problem. Experimental results on real-world online e-commerce systems demonstrate the significant improvements of MODRL-TA, and we have successfully deployed MODRL-TA on an e-commerce search platform.
- Open Access
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 2895-2899
A Preference-oriented Diversity Model Based on Mutual-information in Re-ranking for E-commerce Search
Re-ranking is a process of rearranging ranking list to more effectively meet user demands by accounting for the interrelationships between items. Existing methods predominantly enhance the precision of search results, often at the expense of diversity, leading to outcomes that may not fulfill the varied needs of users. Conversely, methods designed to promote diversity might compromise the precision of the results, failing to satisfy the users' requirements for accuracy. To alleviate the above problems, this paper proposes a Preference-oriented Diversity Model Based on Mutual-information (PODM-MI), which consider both accuracy and diversity in the re-ranking process. Specifically, PODM-MI adopts Multidimensional Gaussian distributions based on variational inference to capture users' diversity preferences with uncertainty. Then we maximize the mutual information between the diversity preferences of the users and the candidate items using the maximum variational inference lower bound to enhance their correlations. Subsequently, we derive a utility matrix based on the correlations, enabling the adaptive ranking of items in line with user preferences and establishing a balance between the aforementioned objectives. Experimental results on real-world online e-commerce systems demonstrate the significant improvements of PODM-MI, and we have successfully deployed PODM-MI on an e-commerce search platform.
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 2895-2899
Open AccessA Preference-oriented Diversity Model Based on Mutual-information in Re-ranking for E-commerce Search
Re-ranking is a process of rearranging ranking list to more effectively meet user demands by accounting for the interrelationships between items. Existing methods predominantly enhance the precision of search results, often at the expense of diversity, leading to outcomes that may not fulfill the varied needs of users. Conversely, methods designed to promote diversity might compromise the precision of the results, failing to satisfy the users' requirements for accuracy. To alleviate the above problems, this paper proposes a Preference-oriented Diversity Model Based on Mutual-information (PODM-MI), which consider both accuracy and diversity in the re-ranking process. Specifically, PODM-MI adopts Multidimensional Gaussian distributions based on variational inference to capture users' diversity preferences with uncertainty. Then we maximize the mutual information between the diversity preferences of the users and the candidate items using the maximum variational inference lower bound to enhance their correlations. Subsequently, we derive a utility matrix based on the correlations, enabling the adaptive ranking of items in line with user preferences and establishing a balance between the aforementioned objectives. Experimental results on real-world online e-commerce systems demonstrate the significant improvements of PODM-MI, and we have successfully deployed PODM-MI on an e-commerce search platform.
- Open Access
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 411-415
Learning Multi-Stage Multi-Grained Semantic Embeddings for E-Commerce Search
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 411-415
Open AccessLearning Multi-Stage Multi-Grained Semantic Embeddings for E-Commerce Search
- Open Access
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 416-420
A Multi-Granularity Matching Attention Network for Query Intent Classification in E-commerce Retrieval
Query intent classification, which aims at assisting customers to find desired products, has become an essential component of the e-commerce search. Existing query intent classification models either design more exquisite models to enhance the representation learning of queries or explore label-graph and multi-task to facilitate models to learn external information. However, these models cannot capture multi-granularity matching features from queries and categories, which makes them hard to mitigate the gap in the expression between informal queries and categories. This paper proposes a Multi-granularity Matching Attention Network (MMAN), which contains three modules: a self-matching module, a char-level matching module, and a semantic-level matching module to comprehensively extract features from the query and a query-category interaction matrix. In this way, the model can eliminate the difference in expression between queries and categories for query intent classification. We conduct extensive offline and online A/B experiments, and the results show that the MMAN significantly outperforms the strong baselines, which shows the superiority and effectiveness of MMAN. MMAN has been deployed in production and brings great commercial value for our company.
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 416-420
Open AccessA Multi-Granularity Matching Attention Network for Query Intent Classification in E-commerce Retrieval
Query intent classification, which aims at assisting customers to find desired products, has become an essential component of the e-commerce search. Existing query intent classification models either design more exquisite models to enhance the representation learning of queries or explore label-graph and multi-task to facilitate models to learn external information. However, these models cannot capture multi-granularity matching features from queries and categories, which makes them hard to mitigate the gap in the expression between informal queries and categories. This paper proposes a Multi-granularity Matching Attention Network (MMAN), which contains three modules: a self-matching module, a char-level matching module, and a semantic-level matching module to comprehensively extract features from the query and a query-category interaction matrix. In this way, the model can eliminate the difference in expression between queries and categories for query intent classification. We conduct extensive offline and online A/B experiments, and the results show that the MMAN significantly outperforms the strong baselines, which shows the superiority and effectiveness of MMAN. MMAN has been deployed in production and brings great commercial value for our company.