Name
Abstract | ||
|---|---|---|
BSTRACTNowadays, deep learning models are widely adopted in web-scale applications such as recommender systems, and online advertising. In these applications, embedding learning of categorical features is crucial to the success of deep learning models. In these models, a standard method is that each categorical feature value is assigned a unique embedding vector which can be learned and optimized. Although this method can well capture the characteristics of the categorical features and promise good performance, it can incur a huge memory cost to store the embedding table, especially for those web-scale applications. Such a huge memory cost significantly holds back the effectiveness and usability of EDRMs. In this paper, we propose a binary code based hash embedding method which allows the size of the embedding table to be reduced in arbitrary scale without compromising too much performance. Experimental evaluation results show that one can still achieve 99% performance even if the embedding table size is reduced 1000× smaller than the original one with our proposed method. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3459637.3482065 | Conference on Information and Knowledge Management |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bencheng Yan | 1 | 1 | 1.04 |
| Pengjie Wang | 2 | 0 | 1.01 |
| Jinquan Liu | 3 | 0 | 0.34 |
| Wei Lin | 4 | 41 | 8.55 |
| Kuang-Chih Lee | 5 | 35 | 6.44 |
| Jian Xu | 6 | 301 | 20.18 |
| Bo Zheng | 7 | 12 | 10.73 |