pith. sign in

arxiv: 1708.08687 · v1 · pith:5SC62VD3new · submitted 2017-08-29 · 💻 cs.CV

Performance Guaranteed Network Acceleration via High-Order Residual Quantization

classification 💻 cs.CV
keywords schemeapproximationbinarizationbinaryproposedaccelerationaccuracyhigh-order
0
0 comments X p. Extension
pith:5SC62VD3 Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{5SC62VD3}

Prints a linked pith:5SC62VD3 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Input binarization has shown to be an effective way for network acceleration. However, previous binarization scheme could be regarded as simple pixel-wise thresholding operations (i.e., order-one approximation) and suffers a big accuracy loss. In this paper, we propose a highorder binarization scheme, which achieves more accurate approximation while still possesses the advantage of binary operation. In particular, the proposed scheme recursively performs residual quantization and yields a series of binary input images with decreasing magnitude scales. Accordingly, we propose high-order binary filtering and gradient propagation operations for both forward and backward computations. Theoretical analysis shows approximation error guarantee property of proposed method. Extensive experimental results demonstrate that the proposed scheme yields great recognition accuracy while being accelerated.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.