Zehua Zhang 0005

dblp:76/2625-5 · DBLP profile ↗
← Back
5ranked-venue papers in the field
0as first author
5since 2021 · last 2026
0000-0003-4784-8095ORCID · verified

Domains — venue-derived; a paper can count in several

Information Retrieval & Web Search · 5
YearPublicationVenuePosition
2026 A Generative Contextual Comprehension Paradigm for Takeout Ranking Model
abstract
The ranking stage serves as the central optimization and allocation hub in advertising systems, governing economic value distribution through eCPM and orchestrating the user-centric blending of organic and advertising content. Prevailing ranking models often rely on fragmented modules and hand-crafted features, limiting their ability to interpret complex user intent. This challenge is further amplified in location-based services such as food delivery, where user decisions are shaped by dynamic spatial, temporal, and individual contexts. To address these limitations, we propose a novel generative framework that reframes ranking as a context comprehension task, modeling heterogeneous signals in a unified architecture. Our architecture consists of two core components: the Generative Contextual Encoder (GCE) and the Generative Contextual Fusion (GCF). The GCE comprises three specialized modules: a Personalized Context Enhancer (PCE) for user-specific modeling, a Collective Context Enhancer (CCE) for group-level patterns, and a Dynamic Context Enhancer (DCE) for real-time situational adaptation. The GCF module then seamlessly integrates these contextual representations through low-rank adaptation. Extensive experiments confirm that our method achieves significant gains in critical business metrics, including click-through rate and platform revenue. We have successfully deployed our method on a large-scale food delivery advertising platform, demonstrating its substantial practical impact. This work pioneers a new perspective on generative recommendation and highlights its practical potential in industrial advertising systems.
Ziheng Ni, Cai Shang, Zhiwei Fang, Guangpeng Chen, Li Jian, Zehua Zhang 0005, Changping Peng, Zhangang Lin, Ching Law, Jingping Shao
WWW9
2026 Think Then Recommend: An LLM-Powered Multi-Agent Framework for Personalized Conversational Recommender System in E-Commerce
Yuankun Zu, Chuchu Yu, Jia Duan, Long Chen 0029, Kunyao Wang, Zehua Zhang 0005, Changping Peng, Zhangang Lin, Ching Law
WWW8
2025 SMTIR: Scenario-Aware Multi-Trigger Induction Network for CTR Prediction
abstract
Trigger-Induced Recommendation (TIR), which aims to predict user interest based on a trigger item, has gained considerable traction on e-commerce platforms. Current TIR methods typically analyze user intent by integrating explicit interest in the trigger item and implicit interest derived from user historical behaviors. However, these methods often overlook the contextual information and occurring scenarios related to the trigger, resulting in an undue emphasis on isolated trigger items and a consequently restrictive understanding of users' short-term intentions. To address these challenges, we propose a novel scenario-aware multi-trigger induction method featuring three key enhancements: (1) The Context Modeling Network learns contextual information associated with the trigger during the request, improving the understanding of users' real intentions regarding the trigger item; (2) The Multi-Trigger Learning Network introduces user latent triggers from various scenarios to uncover users' potential external preferences; (3) The Scenario Induction Network captures the characteristics of the scenarios in which triggers occur and performs induction to yield scenario-aware user intentions prediction. We validate our approach through experiments on multiple industrial datasets, demonstrating the model's effectiveness. Furthermore, we have integrated the model into an online advertising system, achieving a 5.46% improvement in Click-Through Rate (CTR).
Jia Duan, Zhanhao Ye, Kunyao Wang, Long Chen 0029, Zehua Zhang 0005, Changping Peng, Zhangang Lin, Ching Law
CIKM9
2025 Graph Isomorphism Network-Based Cohort Modeling In Click-Through Rate Prediction
abstract
Accurate Click-Through Rate (CTR) prediction is vital for search engines and recommendation systems, yet it is often hindered by the ''cold start problem'', which arises from insufficient historical data for new users. Recent approaches have sought to tackle this by training encoder-decoder networks on data from warm users to generate virtual behavior embeddings for cold users. However, these methods have shortcomings in terms of simplistic encoding techniques for warm user behaviors and direct utilization of virtual behavior embeddings, leading to limitations in user interest expression and generalization. To address these challenges, we propose a novel method that leverages Graph Isomorphism Networks (GIN) for cohort modeling within CTR prediction. GIN effectively captures high-order user-item interactions, providing a more nuanced understanding of users' diverse interests. Additionally, the cohort modeling strategy minimizes deviations in constructed embeddings, enhancing the model's generalization abilities. We validate our approach through experiments on public and industrial datasets, demonstrating significant improvements for both warm and cold users compared to existing methodologies. Furthermore, we implemented the GIN Cohort Modeling (GINCM) in a large-scale online advertising system, optimizing for both pre-computation and real-time processing to reduce latency. The implementation yields notable enhancements of 2.13% in CTR and Revenue Per Mille(RPM), showcasing the practical effectiveness and real-world applicability of our model.
Jia Duan, Zhanhao Ye, Langlang Ye, Zehua Zhang 0005, Jie He 0005, Changping Peng, Zhangang Lin
SIGIR6
2023 Dynamic Group Parameter Modeling for Click-Through-Rate Prediction
abstract
It is noted that Click-Through-Rate(CTR) prediction plays an important part in recommendation systems and online advertising. Over the past few years, numerous studies have been conducted to improve the accuracy of CTR prediction by exploring data inherent patterns. These studies indicate that training CTR models with group-specific parameters on divided data groups can lead to significant improvements. However, most works generally divide groups manually with some prior knowledge, and such a fixed group division method may hinder the expression of user common interests. To address this limitation, we propose a novel group parameter modeling method, where the user group division and group parameter learning processes are completed in an automatic and dynamic way. Our method employs a three-stage approach, consisting of group information selection, group representation learning, and group parameter generation, which allows the efficient expression of user common interests. We conduct experiments on both public datasets and industrial datasets, and the experimental results demonstrate the effectiveness of our method. We have also deployed the model in an online advertising system and observed significant improvements in both CTR and Revenue Per Mille (RPM).
Zehua Zhang 0005, Jie He 0005, Changping Peng, Zhangang Lin, Jingping Shao
CIKM4