arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.08530cs.IR
收藏

推荐系统中大词汇分类特征的多粒度量化嵌入学习

Learning Multi-granular Quantized Embeddings for Large-Vocab Categorical Features in Recommender Systems

Wang-Cheng Kang, Derek Zhiyuan Cheng, Ting Chen, Xinyang Yi, Dong Lin, Lichan Hong, Ed H. Chi

摘要:

推荐系统模型通常通过嵌入表示各种稀疏特征,如用户,项目和分类特征。标准方法是将每个唯一特征值映射到嵌入向量。生成的嵌入表的大小随着词汇表的大小线性增长。因此,一个大的词汇表不可避免地导致一个巨大的嵌入表,产生两个严重的问题:(i)使模型服务在资源受限的环境中难以处理;(ii)导致过拟合问题。在本文中,我们试图学习高度紧凑的嵌入大词汇稀疏功能的推荐系统(recsys)。首先,我们证明了新的微分积量化(DPQ)方法可以推广到recsys问题。此外,为了更好地处理recsys中常见的幂律数据分布,我们提出了一种多粒度量化嵌入(MGQE)技术,该技术可以为不频繁项学习更紧凑的嵌入。我们试图提供一个新的角度来提高推荐性能与紧凑的模型大小。在三个推荐任务和两个数据集上的大量实验表明,我们可以达到同等或更好的性能,而模型大小只有原始模型的20%。

英文摘要:

Recommender system models often represent various sparse features like users, items, and categorical features via embeddings. A standard approach is to map each unique feature value to an embedding vector. The size of the produced embedding table grows linearly with the size of the vocabulary. Therefore, a large vocabulary inevitably leads to a gigantic embedding table, creating two severe problems: (i) making model serving intractable in resource-constrained environments; (ii) causing overfitting problems. In this paper, we seek to learn highly compact embeddings for large-vocab sparse features in recommender systems (recsys). First, we show that the novel Differentiable Product Quantization (DPQ) approach can generalize to recsys problems. In addition, to better handle the power-law data distribution commonly seen in recsys, we propose a Multi-Granular Quantized Embeddings (MGQE) technique which learns more compact embeddings for infrequent items. We seek to provide a new angle to improve recommendation performance with compact model sizes. Extensive experiments on three recommendation tasks and two datasets show that we can achieve on par or better performance, with only ~20% of the original model size.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑