← 返回论文检索
The ACM Web Conference 2026Industry Track

NEZHA: A Zero-sacrifice and Hyperspeed Decoding Architecture for Generative Recommendations

Yejing Wang, Shengyu Zhou, Jinyu Lu, Ziwei Liu 0010, Langming Liu, Maolin Wang 0001, Wenlin Zhang 0001, Feng Li 0067, Wenbo Su, Pengjie Wang 0002, Jian Xu 0015, Xiangyu Zhao 0001

PDF 由论文原始站点提供,PaperCompass 不保存论文文件。DOI 10.1145/3774904.3792797 ↗

摘要

Generative Recommendation (GR), powered by Large Language Models (LLMs), represents a promising new paradigm for industrial recommender systems. However, their practical application is severely hindered by high inference latency, making them infeasible for high-throughput, real-time services and limiting their overall business impact. While Speculative Decoding (SD) has been proposed to accelerate the autoregressive generation process, existing implementations introduce new bottlenecks: they typically require separate draft models and model-based verifiers, which require additional training and increase latency overhead. In this paper, we address these challenges with NEZHA, a novel architecture that achieves hyperspeed decoding for GR systems without sacrificing recommendation quality. Specifically, NEZHA integrates a nimble autoregressive draft head directly into the primary model, enabling efficient self-drafting. This design, combined with a specialized input prompt structure, preserves the integrity of sequence-to-sequence generation. Furthermore, to tackle the critical problem of hallucination—a major source of performance degradation—we introduce an efficient, model-free verifier based on a hash set. We demonstrate the effectiveness of NEZHA through extensive experiments on public datasets and have successfully deployed the system on Taobao since October 2025, achieving 1.2% business improvement, translating to billion-level advertising revenue and serving hundreds of millions of daily active users. The code is available at https://github.com/Applied-Machine-Learning- Lab/WWW2026_NEZHA.