Jun Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jun Zhang has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Changping Wang
Tencent Inc., Beijing, China
3 shared publications - Huan Yu
Tencent Inc., Beijing, China
3 shared publications - Jie Jiang
Tencent Inc., Shenzhen, China
3 shared publications - Qian Li
Tencent, Shenzhen, China
2 shared publications - Yangru Huang
Tencent Inc., Beijing, China
2 shared publications - Yi Li
Tencent Inc., Beijing, China
2 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7465-7476
S-GRec: Personalized Semantic-Aware Generative Recommendation with Asymmetric Advantage
Generative recommendation models sequence generation to produce items end-to-end, but training from behavioral logs often provides weak supervision on underlying user intent. Although Large Language Models (LLMs) offer rich semantic priors that could supply such supervision, direct adoption in industrial recommendation is hindered by two obstacles: semantic signals can conflict with platform business objectives, and LLM inference is prohibitively expensive at scale. This paper presents S-GRec, a semantic-aware framework that decouples an online lightweight generator from an offline LLM-based semantic judge for train-time supervision. S-GRec introduces a two-stage Personalized Semantic Judge (PSJ) that produces interpretable aspect evidence and learns user-conditional aggregation from pairwise feedback, yielding stable semantic rewards. To prevent semantic supervision from deviating from business goals, Asymmetric Advantage Policy Optimization (A2PO) anchors optimization on business rewards (e.g., eCPM) and injects semantic advantages only when they are consistent. Extensive experiments on public benchmarks and a large-scale production system validate both effectiveness and scalability, including statistically significant gains in CTR and a 1.19% lift in GMV in online A/B tests, without requiring real-time LLM inference.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7465-7476
Open AccessS-GRec: Personalized Semantic-Aware Generative Recommendation with Asymmetric Advantage
Generative recommendation models sequence generation to produce items end-to-end, but training from behavioral logs often provides weak supervision on underlying user intent. Although Large Language Models (LLMs) offer rich semantic priors that could supply such supervision, direct adoption in industrial recommendation is hindered by two obstacles: semantic signals can conflict with platform business objectives, and LLM inference is prohibitively expensive at scale. This paper presents S-GRec, a semantic-aware framework that decouples an online lightweight generator from an offline LLM-based semantic judge for train-time supervision. S-GRec introduces a two-stage Personalized Semantic Judge (PSJ) that produces interpretable aspect evidence and learns user-conditional aggregation from pairwise feedback, yielding stable semantic rewards. To prevent semantic supervision from deviating from business goals, Asymmetric Advantage Policy Optimization (A2PO) anchors optimization on business rewards (e.g., eCPM) and injects semantic advantages only when they are consistent. Extensive experiments on public benchmarks and a large-scale production system validate both effectiveness and scalability, including statistically significant gains in CTR and a 1.19% lift in GMV in online A/B tests, without requiring real-time LLM inference.
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7477-7488
GPR: Towards a Generative Pre-trained One-Model Paradigm for Large-Scale Advertising Recommendation
Online advertising recommendation is the economic engine of the digital ecosystem, yet traditional multi-stage cascading systems suffer from objective misalignment and error propagation. Conversely, emerging generative models often struggle with the strict latency and revenue alignment requirements of industrial applications. To address these issues, we propose GPR (Generative Pre-trained Recommender). Instead of the complex retrieval and pre-ranking cascade, GPR employs a unified generative framework to directly generate candidate sets, which are then refined by a lightweight fine-ranking stage for precise business alignment. Unlike prior works, GPR introduces three key technical innovations to ensure industrial feasibility: (1) Unified Representation: We utilize RQ-KMeans+ to map heterogeneous user behaviors and ad content into a shared semantic ID space; (2) Decoupled Architecture: We design a Heterogeneous Hierarchical Decoder (HHD) to decouple user intent modeling from ad generation, enabling efficient long-horizon inference; (3) Value-Aligned Generation: We propose a Value-Guided Trie-Constrained Beam Search and a hierarchical training strategy (MTP + HEPO) to strictly enforce business constraints and maximize commercial value. GPR has been fully deployed in Tencent Weixin Channels, serving over 500 million daily active users. Extensive online A/B testing demonstrates that GPR delivers substantial gains in GMV and CTCVR over highly optimized cascading baselines, validating the generative paradigm as a superior solution for large-scale advertising systems.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7477-7488
Open AccessGPR: Towards a Generative Pre-trained One-Model Paradigm for Large-Scale Advertising Recommendation
Online advertising recommendation is the economic engine of the digital ecosystem, yet traditional multi-stage cascading systems suffer from objective misalignment and error propagation. Conversely, emerging generative models often struggle with the strict latency and revenue alignment requirements of industrial applications. To address these issues, we propose GPR (Generative Pre-trained Recommender). Instead of the complex retrieval and pre-ranking cascade, GPR employs a unified generative framework to directly generate candidate sets, which are then refined by a lightweight fine-ranking stage for precise business alignment. Unlike prior works, GPR introduces three key technical innovations to ensure industrial feasibility: (1) Unified Representation: We utilize RQ-KMeans+ to map heterogeneous user behaviors and ad content into a shared semantic ID space; (2) Decoupled Architecture: We design a Heterogeneous Hierarchical Decoder (HHD) to decouple user intent modeling from ad generation, enabling efficient long-horizon inference; (3) Value-Aligned Generation: We propose a Value-Guided Trie-Constrained Beam Search and a hierarchical training strategy (MTP + HEPO) to strictly enforce business constraints and maximize commercial value. GPR has been fully deployed in Tencent Weixin Channels, serving over 500 million daily active users. Extensive online A/B testing demonstrates that GPR delivers substantial gains in GMV and CTCVR over highly optimized cascading baselines, validating the generative paradigm as a superior solution for large-scale advertising systems.
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2098-2109
Spend Search Where It Pays: Value-Guided Structured Sampling and Optimization for Generative Recommendation
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2098-2109
Open AccessSpend Search Where It Pays: Value-Guided Structured Sampling and Optimization for Generative Recommendation
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 6017-6026
Topic Guided Multi-faceted Semantic Disentanglement for CTR prediction
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 6017-6026
Open AccessTopic Guided Multi-faceted Semantic Disentanglement for CTR prediction