{"title":"基于多维量化编码的序列推荐模型嵌入表压缩","authors":"Feng Wang, Miaomiao Dai, Xudong Li, Liquan Pan","doi":"10.1145/3507971.3508010","DOIUrl":null,"url":null,"abstract":"Sequential recommender models have become a research hotspot in the field of current recommender systems due to its excellent ability to describe users’ dynamic preferences. Sequential recommender models based on deep learning have achieved state-of-the-art results. However, with the increasing number of users and items, the traditional item embedding table may consume a huge amount of memory so that the model may be more difficult to deploy to resource-limited devices. In this paper, we propose a multi-dimensional quantization encoding(MDQE) method to resolve this issue. MDQE mainly consists of two compression techniques. We first divide items into several groups according to the interaction frequency of items and assign different dimensions to each group to construct multi-dimensional group-wise embedding tables. Then, we use mapping matrices to transform the multi-dimensional group-wise embedding tables into quantized codebooks for further compressing. The experiments on three real-world datasets demonstrate that the proposed MDQE can achieve up to 13.86x compression ratio with negligible accuracy loss during inference.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Compressing Embedding Table via Multi-dimensional Quantization Encoding for Sequential Recommender Model\",\"authors\":\"Feng Wang, Miaomiao Dai, Xudong Li, Liquan Pan\",\"doi\":\"10.1145/3507971.3508010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sequential recommender models have become a research hotspot in the field of current recommender systems due to its excellent ability to describe users’ dynamic preferences. Sequential recommender models based on deep learning have achieved state-of-the-art results. However, with the increasing number of users and items, the traditional item embedding table may consume a huge amount of memory so that the model may be more difficult to deploy to resource-limited devices. In this paper, we propose a multi-dimensional quantization encoding(MDQE) method to resolve this issue. MDQE mainly consists of two compression techniques. We first divide items into several groups according to the interaction frequency of items and assign different dimensions to each group to construct multi-dimensional group-wise embedding tables. Then, we use mapping matrices to transform the multi-dimensional group-wise embedding tables into quantized codebooks for further compressing. The experiments on three real-world datasets demonstrate that the proposed MDQE can achieve up to 13.86x compression ratio with negligible accuracy loss during inference.\",\"PeriodicalId\":439757,\"journal\":{\"name\":\"Proceedings of the 7th International Conference on Communication and Information Processing\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 7th International Conference on Communication and Information Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3507971.3508010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Communication and Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3507971.3508010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Compressing Embedding Table via Multi-dimensional Quantization Encoding for Sequential Recommender Model
Sequential recommender models have become a research hotspot in the field of current recommender systems due to its excellent ability to describe users’ dynamic preferences. Sequential recommender models based on deep learning have achieved state-of-the-art results. However, with the increasing number of users and items, the traditional item embedding table may consume a huge amount of memory so that the model may be more difficult to deploy to resource-limited devices. In this paper, we propose a multi-dimensional quantization encoding(MDQE) method to resolve this issue. MDQE mainly consists of two compression techniques. We first divide items into several groups according to the interaction frequency of items and assign different dimensions to each group to construct multi-dimensional group-wise embedding tables. Then, we use mapping matrices to transform the multi-dimensional group-wise embedding tables into quantized codebooks for further compressing. The experiments on three real-world datasets demonstrate that the proposed MDQE can achieve up to 13.86x compression ratio with negligible accuracy loss during inference.