Kun Wang
Kun Wang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Anxiang Zeng
Nanyang technological university, Singapore, Singapore
4 shared publications - Cong Fu
Shopee Pte. Ltd., Singapore, Singapore
4 shared publications - Yabo Ni
Nanyang technological university, Singapore, Singapore
4 shared publications - Jiahua Wu
Shopee Pte. Ltd., Singapore, Singapore
2 shared publications - Jiakai Tang
Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China, Beijing Key Laboratory of Research on Large Models and Intelligent Governance, Beijing, China, and Engineering Research Center of Next-Generation Intelligent Search and Recommendation, MOE, Beijing, China
2 shared publications - Jun Xu
Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7117-7128
OnePiece: Bringing Context Engineering and Reasoning to Industrial Cascade Ranking System
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7117-7128
Open AccessOnePiece: Bringing Context Engineering and Reasoning to Industrial Cascade Ranking System
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 8053-8064
OneRank: Unified Transformer-Native Ranking Architecture for Multi-Task Recommendation
Multi-task learning (MTL) is essential in recommender systems to enable complementary learning among diverse user feedback. While modern industrial practices have shifted from DNNs to Transformer-centric architectures to strengthen sequence modeling and scaling capacity, they still decouple feature encoding from multi-task prediction, treating the Transformer as a task-agnostic encoder. This design fundamentally limits the performance and scalability by (1) creating an information bottleneck under heterogeneous task objectives, (2) inducing gradient interference that leads to the seesaw phenomenon, and (3) forcing a dataflow transition in which attention-based, context-adaptive representation learning is converted to static feed-forward task prediction with incompatible information read–write dynamics. In this paper, we propose OneRank, a Transformer-native multi-task ranking framework that eliminates the encoder–predictor separation and introduces task-private channels for both forward representation learning and backward optimization, enabling task-specialized learning while minimizing inter-task interferences. In the forward pass, OneRank learns task-specific representations in a bottom-up manner through task-conditioned information selection, candidate–aware contextualization, and controlled cross-task interaction. In the backward pass, cross-task gradient detachment isolates task-private parameter updates from shared knowledge extraction modules, preventing negative transfer. Finally, we replace static task-specific MLP scorers with a dynamic matching-based scoring formulation for context-aware personalized ranking. By internalizing multi-task reasoning pathways within the Transformer stack, OneRank establishes a new architectural paradigm with unified modeling and scalable computation design. Extensive offline and online experiments on large-scale industrial datasets demonstrate that OneRank significantly outperforms state-of-the-art baselines across multiple tasks, with substantial improvements in ranking effectiveness while maintaining computational efficiency.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 8053-8064
Open AccessOneRank: Unified Transformer-Native Ranking Architecture for Multi-Task Recommendation
Multi-task learning (MTL) is essential in recommender systems to enable complementary learning among diverse user feedback. While modern industrial practices have shifted from DNNs to Transformer-centric architectures to strengthen sequence modeling and scaling capacity, they still decouple feature encoding from multi-task prediction, treating the Transformer as a task-agnostic encoder. This design fundamentally limits the performance and scalability by (1) creating an information bottleneck under heterogeneous task objectives, (2) inducing gradient interference that leads to the seesaw phenomenon, and (3) forcing a dataflow transition in which attention-based, context-adaptive representation learning is converted to static feed-forward task prediction with incompatible information read–write dynamics. In this paper, we propose OneRank, a Transformer-native multi-task ranking framework that eliminates the encoder–predictor separation and introduces task-private channels for both forward representation learning and backward optimization, enabling task-specialized learning while minimizing inter-task interferences. In the forward pass, OneRank learns task-specific representations in a bottom-up manner through task-conditioned information selection, candidate–aware contextualization, and controlled cross-task interaction. In the backward pass, cross-task gradient detachment isolates task-private parameter updates from shared knowledge extraction modules, preventing negative transfer. Finally, we replace static task-specific MLP scorers with a dynamic matching-based scoring formulation for context-aware personalized ranking. By internalizing multi-task reasoning pathways within the Transformer stack, OneRank establishes a new architectural paradigm with unified modeling and scalable computation design. Extensive offline and online experiments on large-scale industrial datasets demonstrate that OneRank significantly outperforms state-of-the-art baselines across multiple tasks, with substantial improvements in ranking effectiveness while maintaining computational efficiency.
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 3921-3932
Embed Progressive Implicit Preference in Unified Space for Deep Collaborative Filtering
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 3921-3932
Open AccessEmbed Progressive Implicit Preference in Unified Space for Deep Collaborative Filtering
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 4974-4985
Residual Multi-Task Learner for Applied Ranking
Modern e-commerce platforms rely heavily on modeling diverse user feedback to provide personalized services. Consequently, multi-task learning has become an integral part of their ranking systems. However, existing multi-task learning methods encounter two main challenges: some lack explicit modeling of task relationships, resulting in inferior performance, while others have limited applicability due to being computationally intensive, having scalability issues, or relying on strong assumptions. To address these limitations and better fit our real-world scenario, pre-rank in Shopee Search, we introduce in this paper ResFlow, a lightweight multi-task learning framework that enables efficient cross-task information sharing via residual connections between corresponding layers of task networks. Extensive experiments on datasets from various scenarios and modalities demonstrate its superior performance and adaptability over state-of-the-art methods. The online A/B tests in Shopee Search showcase its practical value in large-scale industrial applications, evidenced by a 1.29% increase in OPU (order-per-user) without additional system latency. ResFlow is now fully deployed in the pre-rank module of Shopee Search. To facilitate efficient online deployment, we propose a novel offline metric Weighted Recall@K, which aligns well with our online metric OPU, addressing the longstanding online-offline metric misalignment issue. Besides, we propose to fuse scores from the multiple tasks additively when ranking items, which outperforms traditional multiplicative fusion.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 4974-4985
Open AccessResidual Multi-Task Learner for Applied Ranking
Modern e-commerce platforms rely heavily on modeling diverse user feedback to provide personalized services. Consequently, multi-task learning has become an integral part of their ranking systems. However, existing multi-task learning methods encounter two main challenges: some lack explicit modeling of task relationships, resulting in inferior performance, while others have limited applicability due to being computationally intensive, having scalability issues, or relying on strong assumptions. To address these limitations and better fit our real-world scenario, pre-rank in Shopee Search, we introduce in this paper ResFlow, a lightweight multi-task learning framework that enables efficient cross-task information sharing via residual connections between corresponding layers of task networks. Extensive experiments on datasets from various scenarios and modalities demonstrate its superior performance and adaptability over state-of-the-art methods. The online A/B tests in Shopee Search showcase its practical value in large-scale industrial applications, evidenced by a 1.29% increase in OPU (order-per-user) without additional system latency. ResFlow is now fully deployed in the pre-rank module of Shopee Search. To facilitate efficient online deployment, we propose a novel offline metric Weighted Recall@K, which aligns well with our online metric OPU, addressing the longstanding online-offline metric misalignment issue. Besides, we propose to fuse scores from the multiple tasks additively when ranking items, which outperforms traditional multiplicative fusion.