pith. sign in

arxiv: 1811.03060 · v2 · pith:QL5O2VHNnew · submitted 2018-11-07 · 💻 cs.LG · cs.CV· stat.ML

FLOPs as a Direct Optimization Objective for Learning Sparse Neural Networks

classification 💻 cs.LG cs.CVstat.ML
keywords flopsoptimizationobjectivepartduringnetworksneuralnumber
0
0 comments X
read the original abstract

There exists a plethora of techniques for inducing structured sparsity in parametric models during the optimization process, with the final goal of resource-efficient inference. However, few methods target a specific number of floating-point operations (FLOPs) as part of the optimization objective, despite many reporting FLOPs as part of the results. Furthermore, a one-size-fits-all approach ignores realistic system constraints, which differ significantly between, say, a GPU and a mobile phone -- FLOPs on the former incur less latency than on the latter; thus, it is important for practitioners to be able to specify a target number of FLOPs during model compression. In this work, we extend a state-of-the-art technique to directly incorporate FLOPs as part of the optimization objective and show that, given a desired FLOPs requirement, different neural networks can be successfully trained for 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.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Neuron ranking -- an informed way to condense convolutional neural networks architecture

    cs.LG 2019-07 unverdicted novelty 5.0

    Shapley value and variational importance switch methods produce consistent rankings of filter importance in CNNs, enabling compression and interpretability.