Mingjie Zhong
Research Subjects
Research Interests
Mingjie Zhong has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Hong Liu
Ant Group, Hangzhou, China
3 shared publications - Jia Xu
Ant Group, Hangzhou, China
3 shared publications - Linjian Mo
Ant Group, Hangzhou, China
3 shared publications - Kaixin Wu
Ant Group, Hangzhou, China
2 shared publications - Ang Li
Ant Group, Hangzhou, China
1 shared publication - Guanghu Yuan
Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China
1 shared publication
Latest Publications
- 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
- 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
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 2564-2574
Bridge the Gap between Past and Future: Siamese Model Optimization for Context-Aware Document Ranking
In the realm of information retrieval, users often engage in multi-turn interactions with search engines to acquire information, leading to the formation of sequences of user feedback behaviors. Leveraging the session context has proven to be beneficial for inferring user search intent and document ranking. A multitude of approaches have been proposed to exploit in-session context for improved document ranking. Despite these advances, the limitation of historical session data for capturing evolving user intent remains a challenge. In this work, we explore the integration of future contextual information into the session context to enhance document ranking. We present the siamese model optimization framework, comprising a history-conditioned model and a future-aware model. The former processes only the historical behavior sequence, while the latter integrates both historical and anticipated future behaviors. Both models are trained collaboratively using the supervised labels and pseudo labels predicted by the other. The history-conditioned model, referred to as ForeRanker, progressively learns future-relevant information to enhance ranking, while it singly uses historical session at inference time. To mitigate inconsistencies during training, we introduce the peer knowledge distillation method with a dynamic gating mechanism, allowing models to selectively incorporate contextual information. Experimental results on benchmark datasets demonstrate the effectiveness of our ForeRanker, showcasing its superior performance compared to existing methods.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 2564-2574
Open AccessBridge the Gap between Past and Future: Siamese Model Optimization for Context-Aware Document Ranking
In the realm of information retrieval, users often engage in multi-turn interactions with search engines to acquire information, leading to the formation of sequences of user feedback behaviors. Leveraging the session context has proven to be beneficial for inferring user search intent and document ranking. A multitude of approaches have been proposed to exploit in-session context for improved document ranking. Despite these advances, the limitation of historical session data for capturing evolving user intent remains a challenge. In this work, we explore the integration of future contextual information into the session context to enhance document ranking. We present the siamese model optimization framework, comprising a history-conditioned model and a future-aware model. The former processes only the historical behavior sequence, while the latter integrates both historical and anticipated future behaviors. Both models are trained collaboratively using the supervised labels and pseudo labels predicted by the other. The history-conditioned model, referred to as ForeRanker, progressively learns future-relevant information to enhance ranking, while it singly uses historical session at inference time. To mitigate inconsistencies during training, we introduce the peer knowledge distillation method with a dynamic gating mechanism, allowing models to selectively incorporate contextual information. Experimental results on benchmark datasets demonstrate the effectiveness of our ForeRanker, showcasing its superior performance compared to existing methods.