VLDB 2026 Research / reviewers in the wild / expert
Qiwei Chen
dblp:121/8751
· DBLP profile ↗
5ranked-venue papers in the field
0as first author
4since 2021 · last 2026
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Make It Long, Keep It Fast: End-to-End 10k-Sequence Modeling at Billion Scale on Douyin
Jia-Qi Yang 0001, Zhishan Zhao, Beichuan Zhang 0002, Xuanyuan Luo, Jinan Ni, Yuhang Qi, Zhifang Fan, Hangyu Wang, Qiwei Chen, Feng Zhang 0047 |
WWW | 12 |
| 2025 | PMTA: Perception-Aware Multi-Task Transformer Network for Personalized Multi-Domain AdaptationabstractThe escalating complexity of industrial recommendation systems, characterized by diverse user behaviors and cross-domain application scenarios, necessitates advanced multi-task and multi-domain learning paradigms. Existing methods often struggle with efficient knowledge transfer across tasks and domains due to semantic gaps and distribution shifts. To address these challenges, we propose the Perception-Aware Multi-Task Transformer Network for Personalized Multi-Domain Adaptation (PMTA), a unified framework that integrates three key innovations: First, the Task Prompt Encoding (TPE) module dynamically generates prompts by synthesizing personalized user data with task-specific information. Second, the Transformer-based Multi-Task Perception (TMPN) network enables adaptive cross-task knowledge transfer through attention mechanisms. Third, the Multi-Domain Adaptation (MDAN) component captures domain-specific behavior patterns via learnable prior information. Experimental results demonstrate PMTA's effectiveness, achieving 0.168% increase in watch time and significant improvements in engagement metrics (AAD: +0.0113%, AAH: +0.0608%). Deployed on Douyin and Douyin Lite, it significantly improves recommendation quality and drives commercial success. Chenbin Zhang, Xiaoxie Zhu, Xingchao Cao, Qiwei Chen, Feng Zhang 0047, Zuotao Liu |
CIKM | 4 |
| 2025 | RankMixer: Scaling Up Ranking Models in Industrial RecommendersabstractRecent progress on large language models (LLMs) has spurred interest in scaling up recommendation systems, yet two practical obstacles remain. First, training and serving cost on industrial Recommenders must respect strict latency bounds and high QPS demands. Second, most human-designed feature-crossing modules in ranking models were inherited from the CPU era and fail to exploit modern GPUs, resulting in low Model Flops Utilization (MFU) and poor scalability. We introduce RankMixer, a hardware-aware model design tailored towards a unified and scalable feature-interaction architecture. RankMixer retains the transformer's high parallelism while replacing quadratic self-attention with multi-head token mixing module for higher efficiency. Besides, RankMixer maintains both the modeling for distinct feature subspaces and cross-feature-space interactions with Per-token FFNs. We further extend it to one billion parameters with a Sparse-MoE variant for higher ROI. A dynamic routing strategy is adapted to address the inadequacy and imbalance of experts training. Experiments show RankMixer's superior scaling abilities on a trillion-scale production dataset. By replacing previously diverse handcrafted low-MFU modules with RankMixer, we boost the model MFU from 4.5% to 45%, and scale our online ranking model parameters by two orders of magnitude while maintaining roughly the same inference latency. We verify RankMixer's universality with online A/B tests across two core application scenarios (Recommendation and Advertisement). Finally, we launch 1B Dense-Parameters RankMixer for full traffic serving without increasing the serving cost, which improves user active days by 0.3% and total in-app usage duration by 1.08%. Zhifang Fan, Xiaoxie Zhu, Hangyu Wang, Xintian Han, Xinmin Wang, Wenlin Zhao, Huizhi Yang, Zhe Chen 0015, Yuchao Zheng 0002, Qiwei Chen, Feng Zhang 0047, Peng Xu 0017, Zuotao Liu |
CIKM | 15 |
| 2025 | Pyramid Mixer: Multi-dimensional Multi-period Interest Modeling for Sequential RecommendationabstractSequential recommendation, a critical task in recommendation systems, predicts the next user action based on the understanding of the user's historical behaviors. Conventional studies mainly focus on cross-behavior modeling with self-attention based methods while neglecting comprehensive user interest modeling for more dimensions. In this study, we propose a novel sequential recommendation model, Pyramid Mixer, which leverages the MLP-Mixer architecture to achieve efficient and complete modeling of user interests. Our method learns comprehensive user interests via cross-behavior and cross-feature user sequence modeling. The mixer layers are stacked in a pyramid way for cross-period user temporal interest learning. Through extensive offline and online experiments, we demonstrate the effectiveness and efficiency of our method, and we obtain a +0.106% improvement in user stay duration and a +0.0113% increase in user active days in the online A/B test. The Pyramid Mixer has been successfully deployed on the industrial platform, demonstrating its scalability and impact in real-world applications. Zhifang Fan, Qiwei Chen, Chenbin Zhang, Yuchao Zheng 0002, Feng Zhang 0047, Zuotao Liu |
SIGIR | 4 |
| 2019 | Multi-Interest Network with Dynamic Routing for Recommendation at TmallabstractIndustrial recommender systems have embraced deep learning algorithms for building intelligent systems to make accurate recommendations. At its core, deep learning offers powerful ability for learning representations from data, especially for user and item representations. Existing deep learning-based models usually represent a user by one representation vector, which is usually insufficient to capture diverse interests for large-scale users in practice. In this paper, we approach the learning of user representations from a different view, by representing a user with multiple representation vectors encoding the different aspects of the user's interests. To this end, we propose the Multi-Interest Network with Dynamic routing (MIND) for learning user representations in recommender systems. Specifically, we design a multi-interest extractor layer based on the recently proposed dynamic routing mechanism, which is applicable for modeling and extracting diverse interests from user's behaviors. Furthermore, a technique named label-aware attention is proposed to help the learning process of user representations. Through extensive experiments on several public benchmarks and one large-scale industrial dataset from Tmall, we demonstrate that MIND can achieve superior performance than state-of-the-art methods in terms of recommendation accuracy. Currently, MIND has been deployed for handling major online traffic at the homepage on Mobile Tmall App. Zhiyuan Liu 0001, Mengmeng Wu, Yuchi Xu, Huan Zhao 0002, Pipei Huang, Guoliang Kang, Qiwei Chen, Dik Lun Lee |
CIKM | 8 |