让推荐系统看清物品的多个维度,更懂用户复杂偏好。
Facet-Aware Multi-Head Mixture-of-Experts Model for Sequential Recommendation
- 用多头注意力提取物品多维特征,分头预测下一物品
- 引入门控机制动态融合各头推荐,提升准确率
- 每头内设专家网络,分离用户在不同维度的偏好
序列推荐系统通过用户交互历史捕捉动态偏好。现有方法通常为每个物品分配单一嵌入向量,难以体现物品的多维属性(如电影类型、主演)。用户在不同维度上可能有复杂偏好(如同时喜欢动作片和音乐片),传统模型难以全面建模。为此,我们提出面向序列推荐的分面感知多头专家混合模型(FAME)。利用最后一层多头注意力中各头的子嵌入分别预测下一个物品,无需增加模型复杂度即可捕捉物品的多面性。通过门控机制整合各头推荐结果,并动态确定其重要性。此外,在每个注意力头内引入专家混合(MoE)网络,解耦各分面内的用户偏好,每个专家专注特定偏好,可学习的路由网络计算专家权重并聚合输出。在四个公开数据集上的实验表明,该方法显著优于现有基线模型。
原文摘要 · Abstract (English)
Sequential recommendation (SR) systems excel at capturing users' dynamic preferences by leveraging their interaction histories. Most existing SR systems assign a single embedding vector to each item to represent its features, and various types of models are adopted to combine these item embeddings into a sequence representation vector to capture the user intent. However, we argue that this representation alone is insufficient to capture an item's multi-faceted nature (e.g., movie genres, starring actors). Besides, users often exhibit complex and varied preferences within these facets (e.g., liking both action and musical films in the facet of genre), which are challenging to fully represent. To address the issues above, we propose a novel structure called Facet-Aware Multi-Head Mixture-of-Experts Model for Sequential Recommendation (FAME). We leverage sub-embeddings from each head in the last multi-head attention layer to predict the next item separately. This approach captures the potential multi-faceted nature of items without increasing model complexity. A gating mechanism integrates recommendations from each head and dynamically determines their importance. Furthermore, we introduce a Mixture-of-Experts (MoE) network in each attention head to disentangle various user preferences within each facet. Each expert within the MoE focuses on a specific preference. A learnable router network is adopted to compute the importance weight for each expert and aggregate them. We conduct extensive experiments on four public sequential recommendation datasets and the results demonstrate the effectiveness of our method over existing baseline models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。