提出细粒度轻量级元嵌入,兼顾记忆效率与推荐精度。
Coarse-to-Fine Lightweight Meta-Embedding for ID-Based Recommendation
- 构建粗细粒度双层虚拟节点图网络,分层学习语义
- 稀疏元嵌入自适应平衡唯一性与内存开销
- 适合资源受限场景下的个性化推荐系统
当前推荐系统趋向高效化,尤其在设备端内存受限场景下。现有方法多聚焦于用户与物品的轻量级嵌入,或依赖紧凑嵌入提升复用性与降低空间复杂度,但仅关注粗粒度嵌入,忽视细粒度语义差异,导致元嵌入难以捕捉用户与物品间复杂关系,影响推荐效果。本文提出一种基于图神经网络的新型推荐模型,将用户与物品作为节点,直接连接粗粒度虚拟节点,间接关联细粒度虚拟节点,实现多粒度语义学习。结果表明:相比粗粒度语义,细粒度语义可通过稀疏元嵌入有效捕捉;该嵌入通过SparsePCA初始化与软阈值激活函数实现稀疏性,同时采用权重桥接更新策略,使每个粗粒度元嵌入匹配多个细粒度元嵌入以反映语义特征。大量实验验证本方法优于现有基线。代码已开源。
原文摘要 · Abstract (English)
The state-of-the-art recommendation systems have shifted the attention to efficient recommendation, e.g., on-device recommendation, under memory constraints. To this end, the existing methods either focused on the lightweight embeddings for both users and items, or involved on-device systems enjoying the compact embeddings to enhance reusability and reduces space complexity. However, they focus solely on the coarse granularity of embedding, while overlook the fine-grained semantic nuances, to adversarially downgrade the efficacy of meta-embeddings in capturing the intricate relationship over both user and item, consequently resulting into the suboptimal recommendations. In this paper, we aim to study how the meta-embedding can efficiently learn varied grained semantics, together with how the fine-grained meta-embedding can strengthen the representation of coarse-grained meta-embedding. To answer these questions, we develop a novel graph neural networks (GNNs) based recommender where each user and item serves as the node, linked directly to coarse-grained virtual nodes and indirectly to fine-grained virtual nodes, ensuring different grained semantic learning, while disclosing: 1) In contrast to coarse-grained semantics, fine-grained semantics are well captured through sparse meta-embeddings, which adaptively 2) balance the embedding uniqueness and memory constraint. Additionally, the initialization method come up upon SparsePCA, along with a soft thresholding activation function to render the sparseness of the meta-embeddings. We propose a weight bridging update strategy that focuses on matching each coarse-grained meta-embedding with several fine-grained meta-embeddings based on the users/items' semantics. Extensive experiments substantiate our method's superiority over existing baselines. Our code is available at https://github.com/htyjers/C2F-MetaEmbed.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。