Matrix compression for neural networks.
Project description
Matrix Compression Library
This document describes an experimental API that facilitates matrix compression of a neural network's weight tensors. The API helps inject the necessary tensorflow operations into the training graph so the model can be compressed while it is being trained.
Full documentation can be found here.
Table of contents
- Library Overview
- Model creation
- Hyperparameters for compression
- Adding compression ops to the training graph
- Example
Library overview
- MatrixCompressorInterface - used to implement any matrix compression algorithm in the method
- CompressionOpInterface - used to create a tensorflow operator-like object that injects any matrix compression method dynamically into a tensorflow layer.
- ApplyCompression - convenience wrapper class that can be used directly or extended for novel compression operator types; used to repeatedly invoke the compression operator to different layers in a model.
- CompressionWrapper - wrapper module used to create the proper ApplyCompression implementation for the compression_option (method) of choice.
Model creation
The first step involves creating an ApplyCompression object, with the desired compression parameters. This object then is used to compress the model weights and use these compressed weights during the forward execution of the graph. Matrices are compressed to the rank specified in the compression parameters, provided at the start. To apply the compression, the weight tensor of the layer should be wrapped with the compression object's 'apply_compression' method, provided in compression_op.py.For an example, see the section below.
Hyperparameters for compression
The pruning library allows for specification of the following hyper parameters:
Hyperparameter | Type | Default | Description |
---|---|---|---|
name | string | model_compression | Name of the compression specification. Used for adding summaries and ops under a common tensorflow name_scope. |
alpha_decrement_value | float | 0.01 | Real number by which alpha is decremented at each update. |
begin_compression_step | integer | 0 | Global step at which to begin compression. |
end_compression_step | integer | -1 | Global step at which to terminate compression. Defaults to -1 implying compression continues till the training stops. |
compression_frequency | integer | 10 | Intervals at which compression is applied and compression parameters updated. |
compression_option | integer | 0 | Indicates what type of factorization/compression to use (see the list below for the algorithm options). |
rank | integer | 100 | Factorization rank (r), where if A = BC. See definition below of how rank (r) is used to compute final weights matrix dimensions. |
update_option | integer | 0 | Indicates how update logic is being run: 0 - use tensorflow operations for updates; 1 - use python functions for updates. |
use_tpu | boolean | False | Experimental flag - training using TPUs |
Compression Methods & Algorithms (compression_option param)
- Low Rank Approximation
- Simhash
- Dictionary Learning
- Kmeans Quantization
Decomposed Matrix Dimensions
The hyperparameter rank (r) is used to compute the new ranks as such: (rank of A) * (100 / r) + 1. For simhash compression, the value r provided should be the ratio value you would like divided by 8 (i.e. 300 / 8 -> same as using r = 300 in the equation above). This is because simhash compression represents values as bits (rather than bytes) therefore the true rank is the size of the array divided by 8.
Computing Compression Ratio
If the original weights were m-by-n and the compressed decomposition B*C is (m-by-k)*(k-by-n), then the compression ratio is (m*k + k*n) / (m*n).
Smoothed compression
A gradually increasing alpha value is used to smooth the compression from start_step to end_step. This way the model gradually moves from the full weights matrix to a compressed one. For example, in the low-rank approximation scheme, the weight matrix that is used in the training process is W = (alpha) * A + (1 - alpha) * BC. This alpha value is decremented over time from alpha = 1 to alpha = 0, using the alpha_decrement_value at intervals of compression_frequency.
Adding compression ops to the training graph
# Parse compression hyperparameters
compression_hparams = compression.CompressionOp.get_default_hparams().parse(
hparams)
# Create a compression object using the compression hyperparameters
compression_obj = compression_wrapper.get_apply_compression(
compression_hparams, global_step=global_step)
# somewhere in the model, compute the compressed weights
local = tf.nn.relu(
tf.matmul(reshape, compression_obj.apply_compression(weights, scope)) +
biases,
name=scope.name)
all_update_op = [apply_gradient_op, ...] # all existing model updates
# Run compression update steps with all the other updates. Example below is
# assuming update_option=0.
all_update_op.append(compression_obj.all_update_op())
with tf.control_dependencies(all_update_op):
train_op = tf.no_op(name='train')
Ensure that global_step
is being incremented, otherwise compression will not
work!
Example Usage
As an example, the cifar10 model provided in Tensorflow’s Advanced Convolutional Neural Networks (see page for more details) has been modified to incorporate the compression library:
- cifar10_compression.py creates the deep CNN and adds the weight compression to the fully-connected layers.
- cifar10_train.py creates the compression object and provides it to the training graph (described above) to use.
To train the compression version of cifar10 (make sure you're working in a properly configured virtualenv - as setup using the run.sh script):
$ python cifar10_train.py --compression_hparams=name=cifar10_compression,alpha_decrement_value=0.005,begin_compression_step=40000,end_compression_step=100000,compression_frequency=100,compression_option=1,use_tpu=True,update_option=0,rank=200 --max_steps 120000
Eval:
$ python cifar10_eval.py --compression_hparams=name=cifar10_compression,alpha_decrement_value=0.005,begin_compression_step=40000,end_compression_step=100000,compression_frequency=100,compression_option=1,use_tpu=True,update_option=0,rank=200 --run_once
Eager execution example.
An eager execution example is provided at compression_lib/examples/mnist_eager_mode/mnist_compression.py. To train the model, run:
$python mnist_compression.py
Authors: Rina Panigrahy (corresponding author -- email: rinap@google.com), Lucine Oganesian, Sudeshna Roy, Xin Wang, with support from: Badih Ghazi for helpful contributions, Rasmus Pagh (pagh@google.com, doc) for the simhash code, Zoya Svitkina for code reviews, and Suyog Gupta for consultations.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for graph-compression-google-research-0.0.1.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 887829147bed6cff2ec070137c0047127bb988c26dea6d6dbeeb49c7be962250 |
|
MD5 | 918f96075df8988b7ef608796b62536d |
|
BLAKE2b-256 | 146a2b5a7eb7afef15f263659ca17297a39a82c1123939d8794812d2c7b61412 |
Hashes for graph_compression_google_research-0.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 81b1a438f931e9769735c27bcd8242899584e73c55099c026439f9df4381ce7c |
|
MD5 | f9446bf46a4da199a5e35b16b6c4b2be |
|
BLAKE2b-256 | 715bfadc5078ed2b19fcae0b6bfa58e48cd6893493568a37e20f5fdbaed1a821 |