通过分层对齐提升生成式检索的个性化效果,解决意图与内容不匹配问题。
Preference Shapes Relevance: Cross-component Hierarchical Semantic Alignment for Personalized Generative Retrieval

- 分层对齐查询隐空间与物品量化路径,融合多粒度语义
- 结合离散和连续表示建模用户行为,提升推荐精准度
- 单次推理实现高效生成,适合工业级实时推荐场景
生成式检索(GR)通过将查询直接映射到候选项的语义标识符(SIDs),展现出强大的表征能力。然而,现有方法仅依赖物品内容生成静态的SIDs,难以对齐动态查询意图,造成语义鸿沟。同时,当前生成范式通常忽略用户行为序列,且受限于基于束搜索的自回归解码带来的高延迟。为此,本文提出一种面向个性化生成式检索的分层语义对齐框架——CHAP。首先设计分层语义对齐模块,将查询隐空间与物品量化路径对齐,并同步多粒度语义。其次构建个性化框架,通过离散SIDs提供结构引导,连续表示实现细粒度语义优化。特别地,引入残差级联生成机制,将昂贵的多步Transformer解码限制为单次前向传播,显著提升推理吞吐量并减少信息损失。在三个公开数据集、一个私有工业数据集及线上A/B测试中,CHAP均表现更优,验证了方法的有效性与实用性。代码已开源:https://github.com/zzzgm/CHAP。
原文摘要 · Abstract (English)
Generative Retrieval (GR) has emerged as a promising paradigm by mapping queries directly to Semantic IDs (SIDs) with powerful representation capabilities for candidate items. However, existing SIDs derived solely from item content create a semantic gap, failing to align dynamic query intents with static item representations. Furthermore, current generative paradigms rarely model user behavior sequences and are always bottlenecked by the high inference latency of beam-search autoregressive decoding. To address these challenges, we propose $\textbf{C}$ross-component $\textbf{H}$ierarchical semantic $\textbf{A}$lignment for $\textbf{P}$ersonalized generative retrieval ($\textbf{CHAP}$), a novel personalized GR framework from a hierarchical perspective. First, we design a Hierarchical Semantic Alignment module to align query's latent space with item's quantization path and synchronize multi-granular semantics. Second, we construct a personalized GR framework that models user behavior by synergizing discrete SIDs for structural guidance and continuous representations for fine-grained semantic refinement. Notably, we introduce a Residual Cascading Generation mechanism to restrict the costly multi-step Transformer Decoder to a single-pass inference, boosting inference throughput while mitigating information loss. Extensive experiments on three public datasets, one proprietary industrial dataset, and online A/B tests demonstrate CHAP's superiority, validating the effectiveness and practical value of our approach. The code is publicly available at https://github.com/zzzgm/CHAP.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。