Shisong Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shisong Tang has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Bing Han
Kuaishou Inc., Beijing, China
3 shared publications - Chang Meng
Kuaishou Technology, Beijing, China
3 shared publications - Fan Li
Duke University, Durham, USA
3 shared publications - Hechang Chen
School of Artificial Intelligence, Jilin University, China
3 shared publications - Dingmin Wang
University of Oxford, Oxford, United Kingdom
2 shared publications - Huafeng Cao
Kuaishou Inc., Beijing, China
2 shared publications
Latest Publications
- Open Access
- 15 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
Clinical Raman Diagnosis for Healthcare Optimization Using Reinforcement Learning and Diffusion Models
High-dimensional medical data drive clinical decisions, and Raman spectroscopy is a key modality. However, real-world data often show nonstationary distributions, peak overlap, and batch effects. Fixed policies and conservative sampling increase the risk of overfitting. We therefore need a clinical framework that can reconstruct policies and enable safe exploration. Previous methods rely on full-spectrum modeling or static feature subsets, which do not support rapid policy switching during screening or stable detection of weak peaks. The core challenges are poor policy reconstruction across scenarios and limited exploration diversity. To this end, we propose the DecisionEC framework. Our idea uses structured decision making from reinforcement learning to lock onto clinically relevant structures and a diffusion prior to maintain high-quality global search. Specifically, we present Structure-Aware Option-Q (SAOQ), which abstracts stable peak clusters as reusable options and learns budget-aware high-level actions to meet sensitivity and specificity targets. Moreover, we introduce Diffusion-Guided Generational Competition (DGGC), which uses a conditional diffusion prior to reshape the candidate distribution and employs the Diffusion Slime Mould Algorithm (DSMA) to retrieve valuable peak-cluster combinations efficiently. Extensive experiments on a hospital-derived gastric cancer Raman spectroscopy classification task and multiple high-dimensional biomedical datasets validate the effectiveness of the proposed method.
- 15 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
Open AccessClinical Raman Diagnosis for Healthcare Optimization Using Reinforcement Learning and Diffusion Models
High-dimensional medical data drive clinical decisions, and Raman spectroscopy is a key modality. However, real-world data often show nonstationary distributions, peak overlap, and batch effects. Fixed policies and conservative sampling increase the risk of overfitting. We therefore need a clinical framework that can reconstruct policies and enable safe exploration. Previous methods rely on full-spectrum modeling or static feature subsets, which do not support rapid policy switching during screening or stable detection of weak peaks. The core challenges are poor policy reconstruction across scenarios and limited exploration diversity. To this end, we propose the DecisionEC framework. Our idea uses structured decision making from reinforcement learning to lock onto clinically relevant structures and a diffusion prior to maintain high-quality global search. Specifically, we present Structure-Aware Option-Q (SAOQ), which abstracts stable peak clusters as reusable options and learns budget-aware high-level actions to meet sensitivity and specificity targets. Moreover, we introduce Diffusion-Guided Generational Competition (DGGC), which uses a conditional diffusion prior to reshape the candidate distribution and employs the Diffusion Slime Mould Algorithm (DSMA) to retrieve valuable peak-cluster combinations efficiently. Extensive experiments on a hospital-derived gastric cancer Raman spectroscopy classification task and multiple high-dimensional biomedical datasets validate the effectiveness of the proposed method.
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2562-2572
Heterogeneous Multi-treatment Uplift Modeling for Trade-off Optimization in Short-Video Recommendation
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2562-2572
Open AccessHeterogeneous Multi-treatment Uplift Modeling for Trade-off Optimization in Short-Video Recommendation
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 6373-6382
Contrastive Prototype Framework for Calibrating Video Recommendation
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 6373-6382
Open AccessContrastive Prototype Framework for Calibrating Video Recommendation
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 4682-4693
VLM as Policy: Common-Law Content Moderation Framework for Short Video Platform
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 4682-4693
Open AccessVLM as Policy: Common-Law Content Moderation Framework for Short Video Platform
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 5029-5038
Aligning and Balancing ID and Multimodal Representations for Recommendation
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 5029-5038
Open AccessAligning and Balancing ID and Multimodal Representations for Recommendation
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 5129-5138
Leveraging Label Distributions as Anchors to Enhance Video Recommendation
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 5129-5138
Open AccessLeveraging Label Distributions as Anchors to Enhance Video Recommendation
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5307-5316
Contextual Distillation Model for Diversified Recommendation
The diversity of recommendation is equally crucial as accuracy in improving user experience. Existing studies, e.g., Determinantal Point Process (DPP) and Maximal Marginal Relevance (MMR), employ a greedy paradigm to iteratively select items that optimize both accuracy and diversity. However, prior methods typically exhibit quadratic complexity, limiting their applications to the re-ranking stage and are not applicable to other recommendation stages with a larger pool of candidate items, such as the pre-ranking and ranking stages. In this paper, we propose Contextual Distillation Model (CDM), an efficient recommendation model that addresses diversification, suitable for the deployment in all stages of industrial recommendation pipelines. Specifically, CDM utilizes the candidate items in the same user request as context to enhance the diversification of the results. We propose a contrastive context encoder that employs attention mechanisms to model both positive and negative contexts. For the training of CDM, we compare each target item with its context embedding and utilize the knowledge distillation framework to learn the win probability of each target item under the MMR algorithm, where the teacher is derived from MMR outputs. During inference, ranking is performed through a linear combination of the recommendation and student model scores, ensuring both diversity and efficiency. We perform offline evaluations on two industrial datasets and conduct online A/B test of CDM on the short-video platform KuaiShou. The considerable enhancements observed in both recommendation quality and diversity, as shown by metrics, provide strong superiority for the effectiveness of CDM.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5307-5316
Open AccessContextual Distillation Model for Diversified Recommendation
The diversity of recommendation is equally crucial as accuracy in improving user experience. Existing studies, e.g., Determinantal Point Process (DPP) and Maximal Marginal Relevance (MMR), employ a greedy paradigm to iteratively select items that optimize both accuracy and diversity. However, prior methods typically exhibit quadratic complexity, limiting their applications to the re-ranking stage and are not applicable to other recommendation stages with a larger pool of candidate items, such as the pre-ranking and ranking stages. In this paper, we propose Contextual Distillation Model (CDM), an efficient recommendation model that addresses diversification, suitable for the deployment in all stages of industrial recommendation pipelines. Specifically, CDM utilizes the candidate items in the same user request as context to enhance the diversification of the results. We propose a contrastive context encoder that employs attention mechanisms to model both positive and negative contexts. For the training of CDM, we compare each target item with its context embedding and utilize the knowledge distillation framework to learn the win probability of each target item under the MMR algorithm, where the teacher is derived from MMR outputs. During inference, ranking is performed through a linear combination of the recommendation and student model scores, ensuring both diversity and efficiency. We perform offline evaluations on two industrial datasets and conduct online A/B test of CDM on the short-video platform KuaiShou. The considerable enhancements observed in both recommendation quality and diversity, as shown by metrics, provide strong superiority for the effectiveness of CDM.
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 4894-4903
Counterfactual Video Recommendation for Duration Debiasing
Duration bias widely exists in video recommendations, where models tend to recommend short videos for the higher ratio of finish playing and thus possibly fail to capture users' true interests. In this paper, we eliminate the duration bias from both data and model. First, based on the extensive data analysis, we observe that play completion rate of videos with the same duration presents a bimodal distribution. Hence, we propose to perform threshold division to construct binary labels as training labels for alleviating the drawback of finish playing labels overly biased towards short videos. Algorithmically, we resort to causal inference, which enables us to inspect causal relationships of video recommendations with a causal graph. We identify that duration has two kinds of effect on prediction: direct and indirect. Duration bias lies in the direct effect, while the indirect effect benefits prediction. To this end, we design a model-agnostic Counterfactual Video Recommendation for Duration Debiasing (CVRDD) framework, which incorporates multi-task learning to estimate different causal effect during training. In the inference phase, we perform counterfactual inference to remove the direct effect of duration for unbiased prediction. We conduct experiments on two industrial datasets, and in addition to achieving highly promising results on traditional top-k recommendation metrics, CVRDD also improves the user watch time.
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 4894-4903
Open AccessCounterfactual Video Recommendation for Duration Debiasing
Duration bias widely exists in video recommendations, where models tend to recommend short videos for the higher ratio of finish playing and thus possibly fail to capture users' true interests. In this paper, we eliminate the duration bias from both data and model. First, based on the extensive data analysis, we observe that play completion rate of videos with the same duration presents a bimodal distribution. Hence, we propose to perform threshold division to construct binary labels as training labels for alleviating the drawback of finish playing labels overly biased towards short videos. Algorithmically, we resort to causal inference, which enables us to inspect causal relationships of video recommendations with a causal graph. We identify that duration has two kinds of effect on prediction: direct and indirect. Duration bias lies in the direct effect, while the indirect effect benefits prediction. To this end, we design a model-agnostic Counterfactual Video Recommendation for Duration Debiasing (CVRDD) framework, which incorporates multi-task learning to estimate different causal effect during training. In the inference phase, we perform counterfactual inference to remove the direct effect of duration for unbiased prediction. We conduct experiments on two industrial datasets, and in addition to achieving highly promising results on traditional top-k recommendation metrics, CVRDD also improves the user watch time.