BinaryRelax: A Relaxation Approach for Training Deep Neural Networks with Quantized Weights
Authors:
- Penghang YinPYPenghang Yin
- Shuai ZhangSZShuai Zhang
- Jiancheng LyuJLJiancheng Lyu
- Stanley OsherSOStanley Osher
- Yingyong QiYQYingyong Qi
- Jack XinJXJack Xin
- 1 January 2018
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 11 (4) , 2205-2223
Abstract
We propose BinaryRelax, a simple two-phase algorithm, for training deep neural networks with quantized weights. The set constraint that characterizes the quantization of weights is not imposed until the late stage of training, and a sequence of pseudo quantized weights is maintained. Specifically, we relax the hard constraint into a continuous regularizer via a Moreau envelope, which turns out to be the squared Euclidean distance to the set of quantized weights. The pseudo quantized weights are obtained by linearly interpolating between the float weights and their quantizations. A continuation strategy is adopted to push the weights toward the quantized state by gradually increasing the regularization parameter. In the second phase, an exact quantization scheme with a small learning rate is invoked to guarantee fully quantized weights. We test BinaryRelax on the benchmark CIFAR and ImageNet color image datasets to demonstrate the superiority of the relaxed quantization approach and the improved accuracy o...Keywords
All Related Versions
Funding Information
- Air Force Office of Scientific Research (FA 9550-15-0073)
- Office of Naval Research (N00014-16-1-2157)
- National Science Foundation (DMS-1522383, IIS-1632935)
- U.S. Department of Energy (DE-SC00183838)
This publication has 18 references indexed in Scilit:
- Deep learningNature, 2015
- Minimization of $\ell_{1-2}$ for Compressed SensingSIAM Journal on Scientific Computing, 2015
- Analysis and Generalizations of the Linearized Bregman MethodSIAM Journal on Imaging Sciences, 2010
- The Split Bregman Method for L1-Regularized ProblemsSIAM Journal on Imaging Sciences, 2009
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed SensingSIAM Journal on Imaging Sciences, 2008
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle PropertiesJournal of the American Statistical Association, 2001
- Atomic Decomposition by Basis PursuitSIAM Review, 2001
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- De-noising by soft-thresholdingIEEE Transactions on Information Theory, 1995
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982