Chaosheng Dong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Chaosheng Dong has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Michinari Momma
Amazon, Seattle, WA, USA
4 shared publications - Debabrata Mahapatra
Adobe Research, Bangalore, India
2 shared publications - Yan Gao
Amazon, Seattle, USA
2 shared publications - Yi Sun
Amazon, Seattle, USA
2 shared publications - Chao Zhang
Georgia Institute of Technology, Atlanta, GA, USA
1 shared publication - Jin Li
Amazon, Seattle, WA, USA
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4561-4565
Behavioral Feature Boosting via Substitute Relationships for E-commerce Search
On E-commerce platforms, new products often suffer from the cold-start problem: limited interaction data reduces their search visibility and hurts relevance ranking. To address this, we propose a simple yet effective behavior feature boosting method that leverages substitute relationships among products (BFS). BFS identifies substitutes—products that satisfy similar user needs—and aggregates their behavioral signals (e.g., clicks, add-to-carts, purchases, and ratings) to provide a warm start for new items. Incorporating these enriched signals into ranking models mitigates cold-start effects and improves relevance and competitiveness. Experiments on a large E-commerce platform, both offline and online, show that BFS significantly improves search relevance and product discovery for cold-start products. BFS is scalable and practical, improving user experience while increasing exposure for newly launched items in E-commerce search. The BFS-enhanced ranking model has been launched in production and has served customers since 2025.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4561-4565
Open AccessBehavioral Feature Boosting via Substitute Relationships for E-commerce Search
On E-commerce platforms, new products often suffer from the cold-start problem: limited interaction data reduces their search visibility and hurts relevance ranking. To address this, we propose a simple yet effective behavior feature boosting method that leverages substitute relationships among products (BFS). BFS identifies substitutes—products that satisfy similar user needs—and aggregates their behavioral signals (e.g., clicks, add-to-carts, purchases, and ratings) to provide a warm start for new items. Incorporating these enriched signals into ranking models mitigates cold-start effects and improves relevance and competitiveness. Experiments on a large E-commerce platform, both offline and online, show that BFS significantly improves search relevance and product discovery for cold-start products. BFS is scalable and practical, improving user experience while increasing exposure for newly launched items in E-commerce search. The BFS-enhanced ranking model has been launched in production and has served customers since 2025.
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 4224-4228
MO-LightGBM: A Library for Multi-objective Learning to Rank with LightGBM
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 4224-4228
Open AccessMO-LightGBM: A Library for Multi-objective Learning to Rank with LightGBM
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1412-1416
Generative Prompting for Complex Product Retrieval
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1412-1416
Open AccessGenerative Prompting for Complex Product Retrieval
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 3677-3687
G-STO: Sequential Main Shopping Intention Detection via Graph-Regularized Stochastic Transformer
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 3677-3687
Open AccessG-STO: Sequential Main Shopping Intention Detection via Graph-Regularized Stochastic Transformer
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 1653-1664
Querywise Fair Learning to Rank through Multi-Objective Optimization
In Learning-to-Rank (LTR) problems, the task of delivering relevant search results and allocating fair exposure to items of a protected group can conflict. Previous works in Fair LTR have attempted to resolve this by combining the objectives of relevant ranking and fair ranking into a single linear combination, but this approach is limited by the nonconvexity of the objective functions and can result in suboptimal relevance in ranking outputs. To address this, we propose a solution using Multi-Objective Optimization (MOO) algorithms. We extend these algorithms to querywise MOO to reduce the exposure disparity, not only on average but also at the query level. Interestingly, for moderate fairness requirements, it improves the relevance of ranking instead of deteriorating. We attribute this improvement to the benefits of multi-task learning and study the effect of fair ranking on the relevant ranking task. Moreover, we significantly improve the computational efficiency compared to previous methods by using the Gumbel max trick to sample the Plackett-Luce distribution. We evaluate our proposed methods on three real-world datasets and show their improvement in relevance ranking over state-of-the-art solutions.
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 1653-1664
Open AccessQuerywise Fair Learning to Rank through Multi-Objective Optimization
In Learning-to-Rank (LTR) problems, the task of delivering relevant search results and allocating fair exposure to items of a protected group can conflict. Previous works in Fair LTR have attempted to resolve this by combining the objectives of relevant ranking and fair ranking into a single linear combination, but this approach is limited by the nonconvexity of the objective functions and can result in suboptimal relevance in ranking outputs. To address this, we propose a solution using Multi-Objective Optimization (MOO) algorithms. We extend these algorithms to querywise MOO to reduce the exposure disparity, not only on average but also at the query level. Interestingly, for moderate fairness requirements, it improves the relevance of ranking instead of deteriorating. We attribute this improvement to the benefits of multi-task learning and study the effect of fair ranking on the relevant ranking task. Moreover, we significantly improve the computational efficiency compared to previous methods by using the Gumbel max trick to sample the Plackett-Luce distribution. We evaluate our proposed methods on three real-world datasets and show their improvement in relevance ranking over state-of-the-art solutions.
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 4605-4616
Multi-Label Learning to Rank through Multi-Objective Optimization
Learning to Rank (LTR) technique is ubiquitous in Information Retrieval systems, especially in search ranking applications. The relevance labels used to train ranking models are often noisy measurements of human behavior, such as product ratings in product searches. This results in non-unique ground truth rankings and ambiguity. To address this, Multi-Label LTR (MLLTR) is used to train models using multiple relevance criteria, capturing conflicting but important goals, such as product quality and purchase likelihood for improved revenue in product searches. This research leverages Multi-Objective Optimization (MOO) in MLLTR and employs modern MOO algorithms to solve the problem. A general framework is proposed to combine label information to characterize trade-offs among goals, and allows for the use of gradient-based MOO algorithms. We test the proposed framework on four publicly available LTR datasets and one E-commerce dataset to show its efficacy.
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 4605-4616
Open AccessMulti-Label Learning to Rank through Multi-Objective Optimization
Learning to Rank (LTR) technique is ubiquitous in Information Retrieval systems, especially in search ranking applications. The relevance labels used to train ranking models are often noisy measurements of human behavior, such as product ratings in product searches. This results in non-unique ground truth rankings and ambiguity. To address this, Multi-Label LTR (MLLTR) is used to train models using multiple relevance criteria, capturing conflicting but important goals, such as product quality and purchase likelihood for improved revenue in product searches. This research leverages Multi-Objective Optimization (MOO) in MLLTR and employs modern MOO algorithms to solve the problem. A general framework is proposed to combine label information to characterize trade-offs among goals, and allows for the use of gradient-based MOO algorithms. We test the proposed framework on four publicly available LTR datasets and one E-commerce dataset to show its efficacy.