| { | |
| "paper_id": "2020", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T12:44:37.839922Z" | |
| }, | |
| "title": "Fast Word Predictor for On-Device Application", | |
| "authors": [ | |
| { | |
| "first": "Huy", | |
| "middle": [ | |
| "Tien" | |
| ], | |
| "last": "Nguyen", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Zalo Research Center", | |
| "location": { | |
| "settlement": "Ho Chi Minh", | |
| "country": "Vietnam" | |
| } | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Tuan", | |
| "middle": [], | |
| "last": "Khoi", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "[email protected]" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Nguyen", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Zalo Research Center", | |
| "location": { | |
| "settlement": "Ho Chi Minh", | |
| "country": "Vietnam" | |
| } | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Anh", | |
| "middle": [ | |
| "Tuan" | |
| ], | |
| "last": "Nguyen", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Thanh", | |
| "middle": [], | |
| "last": "Lac", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Zalo Research Center", | |
| "location": { | |
| "settlement": "Ho Chi Minh", | |
| "country": "Vietnam" | |
| } | |
| }, | |
| "email": "[email protected]" | |
| }, | |
| { | |
| "first": "Thi", | |
| "middle": [], | |
| "last": "Tran", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Zalo Research Center", | |
| "location": { | |
| "settlement": "Ho Chi Minh", | |
| "country": "Vietnam" | |
| } | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "Learning on large text corpora, deep neural networks achieve promising results in the next word prediction task. However, deploying these huge models on devices has to deal with constraints of low latency and a small binary size. To address these challenges, we propose a fast word predictor performing efficiently on mobile devices. Compared with a standard neural network which has a similar word prediction rate, the proposed model obtains 60% reduction in memory size and 100X faster inference time on a middle-end mobile device. The method is developed as a feature for a chat application which serves more than 100 million users.", | |
| "pdf_parse": { | |
| "paper_id": "2020", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "Learning on large text corpora, deep neural networks achieve promising results in the next word prediction task. However, deploying these huge models on devices has to deal with constraints of low latency and a small binary size. To address these challenges, we propose a fast word predictor performing efficiently on mobile devices. Compared with a standard neural network which has a similar word prediction rate, the proposed model obtains 60% reduction in memory size and 100X faster inference time on a middle-end mobile device. The method is developed as a feature for a chat application which serves more than 100 million users.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "As a self-supervised learning task, next word prediction based on deep neural networks obtains robust performance by learning on large text corpora. Given a textual context as input, these models shown in Figure 1 (a) encode the text to generate a probability distribution over a vocabulary for the next word. Although various neural networks have been developed for efficient computation and performance, the word embedding layer and softmax layer are still essential parts in these architectures. However, this approach faces a bottleneck for deploying on mobile devices that is the huge number of parameters in the word embedding matrix and softmax layer. For a vocabulary of N words and a word embedding of dimension D, the word embedding matrix takes N \u00d7 D parameters and the softmax layer takes H \u00d7 N where H is the dimension of encoded text. Yu (2018) , for instance, proposed a recurrent neural network with N = 15K, and D = H = 600, so the word embedding matrix and softmax layer have 18M parameters in total. This cost has limited the applicability of deep neural networks on mobile devices for word prediction, word completion, and error correction tasks. Vocabulary's size 1,364,714 897,846 Num of Bigrams 14,507,901 9,868,026 Avg num of accompanied words for one-grams 10.7 11 Avg num of accompanied words for bi-grams 5.1 4.9 Table 1 : Statistics on 150 million tokens.", | |
| "cite_spans": [ | |
| { | |
| "start": 849, | |
| "end": 858, | |
| "text": "Yu (2018)", | |
| "ref_id": "BIBREF9" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 205, | |
| "end": 213, | |
| "text": "Figure 1", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 1167, | |
| "end": 1220, | |
| "text": "Vocabulary's size 1,364,714 897,846 Num of Bigrams", | |
| "ref_id": "TABREF3" | |
| }, | |
| { | |
| "start": 1343, | |
| "end": 1350, | |
| "text": "Table 1", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "Various approaches have been proposed for deep neural compression. Matrix factorization (Nakkiran et al., 2015; Lu et al., 2016; Mehta et al., 2020) is applied to weight matrices to reduce model parameters while weight tying (Pappas et al., 2018; Pappas et al., 2018) shares the parameters of the embedding layer with those of the output classifier. In addition, network pruning and sharing are also efficient for reducing network complexity. For instance, Srinivas (2015) and Han (2015) explored the redundancy among neurons and propose to keep only the most the relevant parameters. Recently, Yu (2018) proposed an on-device word predictor employing shared matrix factorization and distillation to optimize memory and computation. These methods achieve promising results in memory reduction but limited efficiency in time constraint, especially on low-resource devices.", | |
| "cite_spans": [ | |
| { | |
| "start": 88, | |
| "end": 111, | |
| "text": "(Nakkiran et al., 2015;", | |
| "ref_id": "BIBREF4" | |
| }, | |
| { | |
| "start": 112, | |
| "end": 128, | |
| "text": "Lu et al., 2016;", | |
| "ref_id": "BIBREF1" | |
| }, | |
| { | |
| "start": 129, | |
| "end": 148, | |
| "text": "Mehta et al., 2020)", | |
| "ref_id": "BIBREF2" | |
| }, | |
| { | |
| "start": 225, | |
| "end": 246, | |
| "text": "(Pappas et al., 2018;", | |
| "ref_id": "BIBREF5" | |
| }, | |
| { | |
| "start": 247, | |
| "end": 267, | |
| "text": "Pappas et al., 2018)", | |
| "ref_id": "BIBREF5" | |
| }, | |
| { | |
| "start": 457, | |
| "end": 472, | |
| "text": "Srinivas (2015)", | |
| "ref_id": "BIBREF7" | |
| }, | |
| { | |
| "start": 477, | |
| "end": 487, | |
| "text": "Han (2015)", | |
| "ref_id": "BIBREF0" | |
| }, | |
| { | |
| "start": 595, | |
| "end": 604, | |
| "text": "Yu (2018)", | |
| "ref_id": "BIBREF9" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Wikipedia Social text", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "As we analysed the bottleneck, computation complexity primarily depends on vocabulary's size N , word embedding dimension D, and hidden dimension H related to the embedding matrix and softmax layer. Designed as a lookup table, the former have constant complexity, while the latter's operation is fully matrix multiplication. Therefore, our proposed approach is to reduce this softmax layer's computation. According to our analysis on 150 million tokens from Vietnamese Wikipedia text and social text listed in Table 1 , the number of words frequently accompanied with each n-gram is quite small. This fact motivates us to design a model to consider candidate words for a given context instead of looking at all words in vocabulary for predicting the next word.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 510, | |
| "end": 517, | |
| "text": "Table 1", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Figure 1: Approaches for word prediction", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In this work, we propose an approach which takes a contextual text and list of candidate words as input, and output the probability distribution over these words via the attention mechanism (Vaswani et al., 2017) . This architecture shown in Figure 1 (b) decreases significantly the number of softmax layer's parameters and performs faster due to the attention operation's parallelization. In addition, our proposed model keeps the contextual words and potential words in the same embedding space which is recommended for learning language models (Press and Wolf, 2017) . On middle-end devices (e.g., Samsung Galaxy A8 -2016), the proposed model takes a smaller binary memory of 2.1MB (vs. 4.9MB) and faster inference time of 0.4ms (vs 41.2ms) while achieving a similar word prediction rate compared with a conventional neural model.", | |
| "cite_spans": [ | |
| { | |
| "start": 190, | |
| "end": 212, | |
| "text": "(Vaswani et al., 2017)", | |
| "ref_id": "BIBREF8" | |
| }, | |
| { | |
| "start": 547, | |
| "end": 569, | |
| "text": "(Press and Wolf, 2017)", | |
| "ref_id": "BIBREF6" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 242, | |
| "end": 250, | |
| "text": "Figure 1", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Figure 1: Approaches for word prediction", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The next section describes in detail the model's architecture, how to obtain a list of candidate words for a given context, and the mechanism to construct training samples for efficiently learning and diminishing bias.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Figure 1: Approaches for word prediction", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Given a context, the way to obtain candidates for word prediction is a key factor to our model's performance. Through the statistics listed in Table 1 , a tri-gram model is suitable for obtaining potential words. Experimental results shows that for a given bi-gram, next words belong to the top five accompanied words in 98% cases. Obviously, more grams (i.e., 4-grams, 5-grams) are employed, candidates are more fitted. However, storing these grams requires a bigger memory space which could exceed the conventional model's. For that reason, we choose the tri-gram model to query candidates for a given context. To optimize the tri-gram model's size, tri-grams with frequency less than a threshold T = 0.01% are filtered out; and candidates for these cases are randomly selected from the top frequent words in vocabulary. According to our evaluation, the difference in word prediction rate between the tri-gram model and the filtered one is minor.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 143, | |
| "end": 150, | |
| "text": "Table 1", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "N-gram potential words", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "A straightforward approach of taking the n-gram potential words as candidates faces some drawbacks (i) bias in position since candidate lists are sorted by frequency; (ii) sensitive to uncommon words as the model learns local information (i.e., comparison between potential words) but lack of global information (i.e., comparison with other words). To address these challenges, some globally frequent words are added to the list of potential words to diversify comparison instead of only potential words. It also helps to avoid bias in the most frequent words. Then, the candidate lists are randomly permuted to remove position dependence in prediction. To enhance the ability of word comparison, negative samples, where the next word is not in the candidate list, are added.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Training samples", | |
| "sec_num": "2.2" | |
| }, | |
| { | |
| "text": "Given a context W c = {w c 1 , w c 2 , ..., w c n } and candidate words W p = {w p 1 , w p 2 , ..., w p k }, our model embeds each one-hot word w i \u2208 R V into a low dimension vector e i \u2208 R D via the shared matrix factorization (Yu et al., 2018) as follows:", | |
| "cite_spans": [ | |
| { | |
| "start": 228, | |
| "end": 245, | |
| "text": "(Yu et al., 2018)", | |
| "ref_id": "BIBREF9" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Model architecture", | |
| "sec_num": "2.3" | |
| }, | |
| { | |
| "text": "e i = w i \u00d7 W V \u00d7r \u00d7 W r\u00d7D (1)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Model architecture", | |
| "sec_num": "2.3" | |
| }, | |
| { | |
| "text": "Then, the context is encoded into a context embedding vector e C \u2208 R D via a sentence embedding layer; and the attention a \u2208 R k (Vaswani et al., 2017) are computed between the query e c and the keys e p i for generating a probability distribution p(w p i |W c ) over the candidate words as follows: (3) a = Attention(e c , e p ) (4) p = sof tmax(W a + b)", | |
| "cite_spans": [ | |
| { | |
| "start": 129, | |
| "end": 151, | |
| "text": "(Vaswani et al., 2017)", | |
| "ref_id": "BIBREF8" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Model architecture", | |
| "sec_num": "2.3" | |
| }, | |
| { | |
| "text": "e c =", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Model architecture", | |
| "sec_num": "2.3" | |
| }, | |
| { | |
| "text": "where W \u2208 R (k+1)\u00d7k and b \u2208 R k+1 are a weight matrix and bias respectively. Instead of an output p \u2208 R k , one slot is added to the output for negative sample prediction.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Model architecture", | |
| "sec_num": "2.3" | |
| }, | |
| { | |
| "text": "According to the statistic shown in Table 1 and experimental results, we choose k = 10 including five words from the tri-gram model and five frequent words mentioned in Section 2.2. For the model's configuration, we empirically select n = 15, r = 10, D = 100 and a fully connected layer for embedding sentences. We collect 1.3B Vietnamese tokens for training and 130M Vietnamese tokens for evaluation from our social platform. We use top 50K frequent words as a vocabulary and replace out-of-vocabulary words with <UNK>. To improve the performance of models with matrix factorization, we employ the TA knowledge distillation (Mirzadeh et al., 2020) with r = 50 for the TA model. We use a Samsung Galaxy A8 version 2015 for evaluation.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 36, | |
| "end": 43, | |
| "text": "Table 1", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Experiment", | |
| "sec_num": "3" | |
| }, | |
| { | |
| "text": "In Table 2 , we report the comparison between the proposed approach and some baselines (i.e., N-gram, Tying weight (TW), and TW + Matrix factorization) in terms of inference speed per sample, model size and word prediction rate (WPR) which is a percentage of correct words prediction. Although compression methods help reduce model size, they show no improvement in computation time. Our Fast Prediction model achieves significant reduction for speed while remaining a competitive WPR. We observe that parameter reduction via matrix factorization hurts the conventional model's WPR (from 0.43 to 0.31). Our Fast Word Prediction, by contrast, lessens that effect via employing candidate words for narrowing learning space.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 3, | |
| "end": 10, | |
| "text": "Table 2", | |
| "ref_id": "TABREF2" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Model evaluation", | |
| "sec_num": "3.1" | |
| }, | |
| { | |
| "text": "WPR Speed (ms) Model Size N-gram 0.36 0.05 1,5MB Tying weight (Press and Wolf, 2017) 0.43 41.16 4,9MB Tying weight + Matrix Factorization (Yu et al., 2018) ", | |
| "cite_spans": [ | |
| { | |
| "start": 62, | |
| "end": 84, | |
| "text": "(Press and Wolf, 2017)", | |
| "ref_id": "BIBREF6" | |
| }, | |
| { | |
| "start": 138, | |
| "end": 155, | |
| "text": "(Yu et al., 2018)", | |
| "ref_id": "BIBREF9" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Model evaluation", | |
| "sec_num": "3.1" | |
| }, | |
| { | |
| "text": "In this section, we evaluate various ways to construct a list of candidate words for a given context as follows:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Candidate words evaluation", | |
| "sec_num": "3.2" | |
| }, | |
| { | |
| "text": "\u2022 Potential (P): top 5 words from the tri-gram model. For context being out of the tri-gram model, the potential words are selected randomly from the vocabulary.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Candidate words evaluation", | |
| "sec_num": "3.2" | |
| }, | |
| { | |
| "text": "\u2022 Potential + Random (PR): add more 5 words randomly selected from the vocabulary. We evaluate these approaches on two validation sets: (i) samples constructed by P; (ii) samples constructed by PF. The experimental results in Table 3 support the claim mentioned in Section 1 that the approach PF prevents models from being biased towards frequent words compared with P and PR.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 226, | |
| "end": 233, | |
| "text": "Table 3", | |
| "ref_id": "TABREF3" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Candidate words evaluation", | |
| "sec_num": "3.2" | |
| }, | |
| { | |
| "text": "We have proposed an efficient approach for on-device word prediction. By making use of candidate words, TA distillation and matrix factorization, the model requires less parameters and computation while achieving a competitive performance. The model takes 2.1MB in memory and outputs a result in 0.4ms on the middle-end device. To optimize the model and keep it from being bias, we build a list of candidate words including potential words and frequent words. This approach of using candidate words is promising for enhancing user experience via personalizing the candidate list.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion", | |
| "sec_num": "4" | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "Learning both weights and connections for efficient neural network", | |
| "authors": [ | |
| { | |
| "first": "Song", | |
| "middle": [], | |
| "last": "Han", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jeff", | |
| "middle": [], | |
| "last": "Pool", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "John", | |
| "middle": [], | |
| "last": "Tran", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "William", | |
| "middle": [], | |
| "last": "Dally", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2015, | |
| "venue": "Advances in neural information processing systems", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "1135--1143", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Song Han, Jeff Pool, John Tran, and William Dally. 2015. Learning both weights and connections for efficient neural network. In Advances in neural information processing systems, pages 1135-1143.", | |
| "links": null | |
| }, | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "Learning compact recurrent neural networks", | |
| "authors": [ | |
| { | |
| "first": "Zhiyun", | |
| "middle": [], | |
| "last": "Lu", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Vikas", | |
| "middle": [], | |
| "last": "Sindhwani", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Tara", | |
| "middle": [ | |
| "N" | |
| ], | |
| "last": "Sainath", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2016, | |
| "venue": "2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "5960--5964", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Zhiyun Lu, Vikas Sindhwani, and Tara N Sainath. 2016. Learning compact recurrent neural networks. In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 5960-5964. IEEE.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "Define: Deep factorized input token embeddings for neural sequence modeling", | |
| "authors": [ | |
| { | |
| "first": "Sachin", | |
| "middle": [], | |
| "last": "Mehta", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Rik", | |
| "middle": [], | |
| "last": "Koncel-Kedziorski", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Mohammad", | |
| "middle": [], | |
| "last": "Rastegari", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Hannaneh", | |
| "middle": [], | |
| "last": "Hajishirzi", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2020, | |
| "venue": "International Conference on Learning Representations", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Sachin Mehta, Rik Koncel-Kedziorski, Mohammad Rastegari, and Hannaneh Hajishirzi. 2020. Define: Deep factorized input token embeddings for neural sequence modeling. In International Conference on Learning Representations.", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "Improved knowledge distillation via teacher assistant: Bridging the gap between student and teacher", | |
| "authors": [ | |
| { | |
| "first": "Mehrdad", | |
| "middle": [], | |
| "last": "Seyed Iman Mirzadeh", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Ang", | |
| "middle": [], | |
| "last": "Farajtabar", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Nir", | |
| "middle": [], | |
| "last": "Li", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Akihiro", | |
| "middle": [], | |
| "last": "Levine", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Hassan", | |
| "middle": [], | |
| "last": "Matsukawa", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Ghasemzadeh", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2020, | |
| "venue": "Proceedings of The Association for the Advancement of Artificial Intelligence", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Seyed Iman Mirzadeh, Mehrdad Farajtabar, Ang Li, Nir Levine, Akihiro Matsukawa, and Hassan Ghasemzadeh. 2020. Improved knowledge distillation via teacher assistant: Bridging the gap between student and teacher. In Proceedings of The Association for the Advancement of Artificial Intelligence.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "Compressing deep neural networks using a rank-constrained topology", | |
| "authors": [ | |
| { | |
| "first": "Preetum", | |
| "middle": [], | |
| "last": "Nakkiran", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Raziel", | |
| "middle": [], | |
| "last": "Alvarez", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Rohit", | |
| "middle": [], | |
| "last": "Prabhavalkar", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Carolina", | |
| "middle": [], | |
| "last": "Parada", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2015, | |
| "venue": "Proceedings of Annual Conference of the International Speech Communication Association (Interspeech)", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "1473--1477", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Preetum Nakkiran, Raziel Alvarez, Rohit Prabhavalkar, and Carolina Parada. 2015. Compressing deep neural networks using a rank-constrained topology. In Proceedings of Annual Conference of the International Speech Communication Association (Interspeech), pages 1473-1477.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "Beyond weight tying: Learning joint inputoutput embeddings for neural machine translation", | |
| "authors": [ | |
| { | |
| "first": "Nikolaos", | |
| "middle": [], | |
| "last": "Pappas", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Lesly", | |
| "middle": [], | |
| "last": "Miculicich", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "James", | |
| "middle": [], | |
| "last": "Henderson", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2018, | |
| "venue": "Proceedings of the Third Conference on Machine Translation: Research Papers", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "73--83", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Nikolaos Pappas, Lesly Miculicich, and James Henderson. 2018. Beyond weight tying: Learning joint input- output embeddings for neural machine translation. In Proceedings of the Third Conference on Machine Trans- lation: Research Papers, pages 73-83, Belgium, Brussels, October. Association for Computational Linguistics.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "Using the output embedding to improve language models", | |
| "authors": [ | |
| { | |
| "first": "Ofir", | |
| "middle": [], | |
| "last": "Press", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Lior", | |
| "middle": [], | |
| "last": "Wolf", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2017, | |
| "venue": "Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics", | |
| "volume": "2", | |
| "issue": "", | |
| "pages": "157--163", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Ofir Press and Lior Wolf. 2017. Using the output embedding to improve language models. In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 2, Short Papers, pages 157-163, Valencia, Spain, April. Association for Computational Linguistics.", | |
| "links": null | |
| }, | |
| "BIBREF7": { | |
| "ref_id": "b7", | |
| "title": "Data-free parameter pruning for deep neural networks", | |
| "authors": [ | |
| { | |
| "first": "Suraj", | |
| "middle": [], | |
| "last": "Srinivas", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "R", | |
| "middle": [], | |
| "last": "Venkatesh", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Babu", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2015, | |
| "venue": "Proceedings of the British Machine Vision Conference (BMVC)", | |
| "volume": "12", | |
| "issue": "", | |
| "pages": "31--32", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Suraj Srinivas and R. Venkatesh Babu. 2015. Data-free parameter pruning for deep neural networks. In Mark W. Jones Xianghua Xie and Gary K. L. Tam, editors, Proceedings of the British Machine Vision Conference (BMVC), pages 31.1-31.12. BMVA Press, September.", | |
| "links": null | |
| }, | |
| "BIBREF8": { | |
| "ref_id": "b8", | |
| "title": "Attention is all you need", | |
| "authors": [ | |
| { | |
| "first": "Ashish", | |
| "middle": [], | |
| "last": "Vaswani", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Noam", | |
| "middle": [], | |
| "last": "Shazeer", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Niki", | |
| "middle": [], | |
| "last": "Parmar", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jakob", | |
| "middle": [], | |
| "last": "Uszkoreit", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Llion", | |
| "middle": [], | |
| "last": "Jones", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Aidan", | |
| "middle": [ | |
| "N" | |
| ], | |
| "last": "Gomez", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Lukasz", | |
| "middle": [], | |
| "last": "Kaiser", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Illia", | |
| "middle": [], | |
| "last": "Polosukhin", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2017, | |
| "venue": "Advances in Neural Information Processing Systems", | |
| "volume": "30", | |
| "issue": "", | |
| "pages": "5998--6008", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, editors, Advances in Neural Information Processing Systems 30, pages 5998-6008. Curran Associates, Inc.", | |
| "links": null | |
| }, | |
| "BIBREF9": { | |
| "ref_id": "b9", | |
| "title": "On-device neural language model based word prediction", | |
| "authors": [ | |
| { | |
| "first": "Seunghak", | |
| "middle": [], | |
| "last": "Yu", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Nilesh", | |
| "middle": [], | |
| "last": "Kulkarni", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Haejun", | |
| "middle": [], | |
| "last": "Lee", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jihie", | |
| "middle": [], | |
| "last": "Kim", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2018, | |
| "venue": "Proceedings of the 27th International Conference on Computational Linguistics: System Demonstrations", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "128--131", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Seunghak Yu, Nilesh Kulkarni, Haejun Lee, and Jihie Kim. 2018. On-device neural language model based word prediction. In Proceedings of the 27th International Conference on Computational Linguistics: System Demonstrations, pages 128-131, Santa Fe, New Mexico, August. Association for Computational Linguistics.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "uris": null, | |
| "num": null, | |
| "text": "Potential + Frequent (PF): add more 5 words randomly selected from the top frequent words.", | |
| "type_str": "figure" | |
| }, | |
| "TABREF2": { | |
| "content": "<table/>", | |
| "num": null, | |
| "html": null, | |
| "text": "Performance comparison of our models and baselines. ( * ), and ( + ) denote the size of neural networks and N-gram models respectively.", | |
| "type_str": "table" | |
| }, | |
| "TABREF3": { | |
| "content": "<table/>", | |
| "num": null, | |
| "html": null, | |
| "text": "Word Prediction Rate of three ways to obtain candidate words.", | |
| "type_str": "table" | |
| } | |
| } | |
| } | |
| } |