Linjian Mo
Research Subjects
Linjian Mo has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
- Liang Zhang
Ant Group, Hangzhou, China
12 shared publications - Yong He
Ant Group, Hangzhou, China
11 shared publications - Ke Ding
Ant Group, Hangzhou, China
6 shared publications - Jun Zhou
Ant Group, Hangzhou, Zhejiang, China
5 shared publications - Lei Cheng
Ant Group, Hangzhou, China
5 shared publications - Xiaolu Zhang
Ant Group CO Ltd, Hangzhou, China
5 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2979-2990
CTR-Sink: Attention Sink for Language Models in Click-Through Rate Prediction
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2979-2990
Open AccessCTR-Sink: Attention Sink for Language Models in Click-Through Rate Prediction
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 5031-5035
Multi-Task Learning through Hierarchical Information Sharing and Transfer
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 5031-5035
Open AccessMulti-Task Learning through Hierarchical Information Sharing and Transfer
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 4289-4293
MAAQR: An LLM-based Multi-Agent Framework for Adaptive Query Rewriting in Alipay Search
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 4289-4293
Open AccessMAAQR: An LLM-based Multi-Agent Framework for Adaptive Query Rewriting in Alipay Search
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 4294-4298
Alleviating LLM-based Generative Retrieval Hallucination in Alipay Search
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 4294-4298
Open AccessAlleviating LLM-based Generative Retrieval Hallucination in Alipay Search
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2182-2191
A Learnable Fully Interacted Two-Tower Model for Pre-Ranking System
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2182-2191
Open AccessA Learnable Fully Interacted Two-Tower Model for Pre-Ranking System
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1113-1117
EGRec: Leveraging Generative Rich Intents for Enhanced Recommendation with Large Language Models
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1113-1117
Open AccessEGRec: Leveraging Generative Rich Intents for Enhanced Recommendation with Large Language Models
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 898-902
Singleton CTR Prediction: Towards Single-User Modeling Paradigm with Large Language Models
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 898-902
Open AccessSingleton CTR Prediction: Towards Single-User Modeling Paradigm with Large Language Models
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 3063-3072
MMLRec: A Unified Multi-Task and Multi-Scenario Learning Benchmark for Recommendation
In recent years, there has been a trend in the field of recommender systems towards multi-task modeling and multi-scenario modeling. The aim is to enhance the performance of various tasks and scenarios by jointly training on multiple tasks or scenarios to learn common patterns and features. Joint modeling of tasks and scenarios has also received widespread attention recently. However, despite the rich proposals of methods for Multi-Task Learning (MTL), Multi-Scenario Learning (MSL), and Multi-Task-Multi-Scenario Learning (MTMSL) in recent years, there still lacks a comprehensive benchmark to evaluate these methods. Previous studies often employed different datasets, data processing techniques, data partitioning strategies, and hyperparameter settings, making replication of existing research and fair comparison of experimental results challenging. To address this challenge, we introduce MMLRec, the first unified comprehensive benchmark for evaluating MTL, MSL and MTMSL, featuring consistent dataset processing and identical parameter settings. This benchmark implements a range of MTL, MSL, and MTMSL algorithms, and evaluates them on multiple commonly used recommender systems datasets. Through fair comparative experiments, we find that some structurally simplistic recommendation algorithms are underestimated, as they can achieve comparable results to more complex algorithms while maintaining lower complexity. Furthermore, our experimental analysis indicates that more complex methods exhibit better robustness when there are significant differences between tasks or scenarios. By providing a unified framework (MMLRec), our goal is to promote rapid evaluation and inspire innovative research in this continuously evolving field. We hope that our open-source benchmark can facilitate swift, equitable evaluations, while also fostering further breakthrough research in the domains of MTL, MSL, and MTMSL.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 3063-3072
Open AccessMMLRec: A Unified Multi-Task and Multi-Scenario Learning Benchmark for Recommendation
In recent years, there has been a trend in the field of recommender systems towards multi-task modeling and multi-scenario modeling. The aim is to enhance the performance of various tasks and scenarios by jointly training on multiple tasks or scenarios to learn common patterns and features. Joint modeling of tasks and scenarios has also received widespread attention recently. However, despite the rich proposals of methods for Multi-Task Learning (MTL), Multi-Scenario Learning (MSL), and Multi-Task-Multi-Scenario Learning (MTMSL) in recent years, there still lacks a comprehensive benchmark to evaluate these methods. Previous studies often employed different datasets, data processing techniques, data partitioning strategies, and hyperparameter settings, making replication of existing research and fair comparison of experimental results challenging. To address this challenge, we introduce MMLRec, the first unified comprehensive benchmark for evaluating MTL, MSL and MTMSL, featuring consistent dataset processing and identical parameter settings. This benchmark implements a range of MTL, MSL, and MTMSL algorithms, and evaluates them on multiple commonly used recommender systems datasets. Through fair comparative experiments, we find that some structurally simplistic recommendation algorithms are underestimated, as they can achieve comparable results to more complex algorithms while maintaining lower complexity. Furthermore, our experimental analysis indicates that more complex methods exhibit better robustness when there are significant differences between tasks or scenarios. By providing a unified framework (MMLRec), our goal is to promote rapid evaluation and inspire innovative research in this continuously evolving field. We hope that our open-source benchmark can facilitate swift, equitable evaluations, while also fostering further breakthrough research in the domains of MTL, MSL, and MTMSL.
- Open Access
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1232-1241
Exploring Multi-Scenario Multi-Modal CTR Prediction with a Large Scale Dataset
Click-through rate (CTR) prediction plays a crucial role in recommendation systems, with significant impact on user experience and platform revenue generation. Despite the various public CTR datasets available due to increasing interest from both academia and industry, these datasets have limitations. They cover a limited range of scenarios and predominantly focus on ID-based features, neglecting the vital role of multi-modal features for effective multi-scenario CTR prediction. Moreover, their scale is modest compared to real-world industrial datasets, hindering robust and comprehensive evaluation of complex models. To address these challenges, we introduce a large-scale Multi-Scenario Multi-Modal CTR dataset named AntM2 C, built from real industrial data from Alipay. This dataset offers an impressive breadth and depth of information, covering CTR data from four diverse business scenarios, including advertisements, consumer coupons, mini-programs, and videos. Unlike existing datasets, AntM2 C provides not only ID-based features but also five textual features and one image feature for both users and items, supporting more delicate multi-modal CTR prediction. AntM2 C is also substantially larger than existing datasets, comprising 100 million CTR data. This scale allows for robust and comprehensive evaluation and comparison of CTR prediction models. We employ AntM2 C to construct several typical CTR tasks, including multi-scenario modeling, item and user cold-start modeling, and multi-modal modeling. Initial experiments and comparisons with baseline methods have shown that AntM2 C presents both new challenges and opportunities for CTR models, with the potential to significantly advance CTR research. The AntM2 C dataset is available at https://www.atecup.cn/OfficalDataSet.
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1232-1241
Open AccessExploring Multi-Scenario Multi-Modal CTR Prediction with a Large Scale Dataset
Click-through rate (CTR) prediction plays a crucial role in recommendation systems, with significant impact on user experience and platform revenue generation. Despite the various public CTR datasets available due to increasing interest from both academia and industry, these datasets have limitations. They cover a limited range of scenarios and predominantly focus on ID-based features, neglecting the vital role of multi-modal features for effective multi-scenario CTR prediction. Moreover, their scale is modest compared to real-world industrial datasets, hindering robust and comprehensive evaluation of complex models. To address these challenges, we introduce a large-scale Multi-Scenario Multi-Modal CTR dataset named AntM2 C, built from real industrial data from Alipay. This dataset offers an impressive breadth and depth of information, covering CTR data from four diverse business scenarios, including advertisements, consumer coupons, mini-programs, and videos. Unlike existing datasets, AntM2 C provides not only ID-based features but also five textual features and one image feature for both users and items, supporting more delicate multi-modal CTR prediction. AntM2 C is also substantially larger than existing datasets, comprising 100 million CTR data. This scale allows for robust and comprehensive evaluation and comparison of CTR prediction models. We employ AntM2 C to construct several typical CTR tasks, including multi-scenario modeling, item and user cold-start modeling, and multi-modal modeling. Initial experiments and comparisons with baseline methods have shown that AntM2 C presents both new challenges and opportunities for CTR models, with the potential to significantly advance CTR research. The AntM2 C dataset is available at https://www.atecup.cn/OfficalDataSet.
- Open Access
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 2311-2315
Breaking the Length Barrier: LLM-Enhanced CTR Prediction in Long Textual User Behaviors
With the rise of large language models (LLMs), recent works have leveraged LLMs to improve the performance of click-through rate (CTR) prediction. However, we argue that a critical obstacle remains in deploying LLMs for practical use: the efficiency of LLMs when processing long textual user behaviors. As user sequences grow longer, the current efficiency of LLMs is inadequate for training on billions of users and items. To break through the efficiency barrier of LLMs, we propose Behavior Aggregated Hierarchical Encoding (BAHE) to enhance the efficiency of LLM-based CTR modeling. Specifically, BAHE proposes a novel hierarchical architecture that decouples the encoding of user behaviors from inter-behavior interactions. Firstly, to prevent computational redundancy from repeated encoding of identical user behaviors, BAHE employs the LLM's pre-trained shallow layers to extract embeddings of the most granular, atomic user behaviors from extensive user sequences and stores them in the offline database. Subsequently, the deeper, trainable layers of the LLM facilitate intricate inter-behavior interactions, thereby generating comprehensive user embeddings. This separation allows the learning of high-level user representations to be independent of low-level behavior encoding, significantly reducing computational complexity. Finally, these refined user embeddings, in conjunction with correspondingly processed item embeddings, are incorporated into the CTR model to compute the CTR scores. Extensive experimental results show that BAHE reduces training time and memory by five times for CTR models using LLMs, especially with longer user sequences. BAHE has been deployed in a real-world system, allowing for daily updates of 50 million CTR data on 8 A100 GPUs, making LLMs practical for industrial CTR prediction.
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 2311-2315
Open AccessBreaking the Length Barrier: LLM-Enhanced CTR Prediction in Long Textual User Behaviors
With the rise of large language models (LLMs), recent works have leveraged LLMs to improve the performance of click-through rate (CTR) prediction. However, we argue that a critical obstacle remains in deploying LLMs for practical use: the efficiency of LLMs when processing long textual user behaviors. As user sequences grow longer, the current efficiency of LLMs is inadequate for training on billions of users and items. To break through the efficiency barrier of LLMs, we propose Behavior Aggregated Hierarchical Encoding (BAHE) to enhance the efficiency of LLM-based CTR modeling. Specifically, BAHE proposes a novel hierarchical architecture that decouples the encoding of user behaviors from inter-behavior interactions. Firstly, to prevent computational redundancy from repeated encoding of identical user behaviors, BAHE employs the LLM's pre-trained shallow layers to extract embeddings of the most granular, atomic user behaviors from extensive user sequences and stores them in the offline database. Subsequently, the deeper, trainable layers of the LLM facilitate intricate inter-behavior interactions, thereby generating comprehensive user embeddings. This separation allows the learning of high-level user representations to be independent of low-level behavior encoding, significantly reducing computational complexity. Finally, these refined user embeddings, in conjunction with correspondingly processed item embeddings, are incorporated into the CTR model to compute the CTR scores. Extensive experimental results show that BAHE reduces training time and memory by five times for CTR models using LLMs, especially with longer user sequences. BAHE has been deployed in a real-world system, allowing for daily updates of 50 million CTR data on 8 A100 GPUs, making LLMs practical for industrial CTR prediction.