paper-with-me

홈 › Papers

Compressing Neural Networks with the Hashing Trick

2015-04-19 · Wenlin Chen, James T. Wilson, Stephen Tyree, Kilian Q. Weinberger, Yixin Chen

As deep nets are increasingly used in applications suited for mobile devices, a fundamental dilemma becomes apparent: the trend in deep learning is to grow models to absorb ever-increasing data set sizes; however mobile devices are designed with very little memory and cannot store such large models. We present a novel network architecture, HashedNets, that exploits inherent redundancy in neural networks to achieve drastic reductions in model sizes. HashedNets uses a low-cost hash function to randomly group connection weights into hash buckets, and all connections within the same hash bucket share a single parameter value. These parameters are tuned to adjust to the HashedNets weight sharing architecture with standard backprop during training. Our hashing procedure introduces no additional memory overhead, and we demonstrate on several benchmark data sets that HashedNets shrink the storage requirements of neural networks substantially while mostly preserving generalization performance.

📄 PDF Abstract BibTeX arXiv:1504.04788

Code (1)

https://gitlab.com/anon-dynamic-reparam/iclr2019-dynamic-reparam pytorch

Similar Papers 제목 키워드 기반

Additive Feature Hashing

2021-02-07 · M. Andrecut

The hashing trick is a machine learning technique used to encode categorical features into a numerical vector representation of pre-defined fixed length. It works by using the categorical hash values as vector indices, a…

Spam detection

The Bitwise Hashing Trick for Personalized Search

2019-10-18 · Braddock Gaskill

Many real world problems require fast and efficient lexical comparison of large numbers of short text strings. Search personalization is one such domain. We introduce the use of feature bit vectors using the hashing tric…

Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs

2022-07-03 · Edith Cohen, Jelani Nelson, Tamás Sarlós, Uri Stemmer

CountSketch and Feature Hashing (the "hashing trick") are popular randomized dimensionality reduction methods that support recovery of $\ell_2$-heavy hitters (keys $i$ where $v_i^2 > \epsilon \|\boldsymbol{v}\|_2^2$) and…

Dimensionality Reduction

Hash Embeddings for Efficient Word Representations

2017-09-12 · NeurIPS 2017 12 · Dan Svenstrup, Jonas Meinertz Hansen, Ole Winther

We present hash embeddings, an efficient method for representing words in a continuous vector form. A hash embedding may be seen as an interpolation between a standard word embedding and a word embedding created using a …

Fully Understanding the Hashing Trick

2018-05-22 · NeurIPS 2018 12 · Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen

Feature hashing, also known as {\em the hashing trick}, introduced by Weinberger et al. (2009), is one of the key techniques used in scaling-up machine learning algorithms. Loosely speaking, feature hashing uses a random…

Open-Ended Question Answering