pith. sign in

arxiv: 1801.09335 · v1 · pith:6EHFORIPnew · submitted 2018-01-29 · 💻 cs.LG · cs.CV· cs.NE

Stochastic Downsampling for Cost-Adjustable Inference and Improved Regularization in Convolutional Networks

classification 💻 cs.LG cs.CVcs.NE
keywords inferencedownsamplingsdpointduringbudgetcnnscost-adjustabledifferent
0
0 comments X p. Extension
pith:6EHFORIP Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{6EHFORIP}

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

read the original abstract

It is desirable to train convolutional networks (CNNs) to run more efficiently during inference. In many cases however, the computational budget that the system has for inference cannot be known beforehand during training, or the inference budget is dependent on the changing real-time resource availability. Thus, it is inadequate to train just inference-efficient CNNs, whose inference costs are not adjustable and cannot adapt to varied inference budgets. We propose a novel approach for cost-adjustable inference in CNNs - Stochastic Downsampling Point (SDPoint). During training, SDPoint applies feature map downsampling to a random point in the layer hierarchy, with a random downsampling ratio. The different stochastic downsampling configurations known as SDPoint instances (of the same model) have computational costs different from each other, while being trained to minimize the same prediction loss. Sharing network parameters across different instances provides significant regularization boost. During inference, one may handpick a SDPoint instance that best fits the inference budget. The effectiveness of SDPoint, as both a cost-adjustable inference approach and a regularizer, is validated through extensive experiments on image classification.

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.