Papers › Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applications

Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applications

20 Nov 2015arXiv:1511.06530archive 2025-07-28

Yong-Deok Kim, Eunhyeok Park, Sungjoo Yoo, Taelim Choi, Lu Yang, Dongjun Shin

Although the latest high-end smartphone has powerful CPU and GPU, running deeper convolutional neural networks (CNNs) for complex tasks such as ImageNet classification on mobile devices is challenging. To deploy deep CNNs on mobile devices, we present a simple and effective scheme to compress the entire CNN, which we call one-shot whole network compression. The proposed scheme consists of three steps: (1) rank selection with variational Bayesian matrix factorization, (2) Tucker decomposition on kernel tensor, and (3) fine-tuning to recover accumulated loss of accuracy, and each step can be easily implemented using publicly available tools. We demonstrate the effectiveness of the proposed scheme by testing the performance of various compressed CNNs (AlexNet, VGGS, GoogLeNet, and VGG-16) on the smartphone. Significant reductions in model size, runtime, and energy consumption are obtained, at the cost of small loss in accuracy. In addition, we address the important implementation level issue on 1?1 convolution, which is a key operation of inception module of GoogLeNet as well as CNNs compressed by our proposed scheme.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1511.06530")

Code

Syntology Ran 2 of 9 code samples harvested from 0 repositories linked to this paper; 7 have no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · our draft was wrong.

By repository: 9 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Graphiiz/low-rank-factorization mentioned on GitHubpytorch report
jacobgil/pytorch-tensor-decompositions mentioned on GitHubpytorch report
keithyuck/Object-Tracking mentioned on GitHubpytorch report
larry0123du/Decompose-CNN mentioned on GitHubpytorch report
mostafaelhoushi/tensor-decompositions mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 2 ran; 1 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
1ran · our draft was wrong
7unverified

Licence: 9 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

fine_tune identical code first harvested elsewhere ran · honoured contract licence of this copy not recorded · 3fb5447d5e3c1526 · report
get_per_layer_config identical code first harvested elsewhere ran · our draft was wrong licence of this copy not recorded · ddb40edf84db1df7 · report
accuracy identical code first harvested elsewhere unverified licence of this copy not recorded · 9b8289076669fe4f · report
measure_time identical code first harvested elsewhere unverified licence of this copy not recorded · e043983f0912c3b4 · report
test identical code first harvested elsewhere unverified licence of this copy not recorded · 634c4d5814f593b1 · report
train identical code first harvested elsewhere unverified licence of this copy not recorded · e8d9d8e78c7f0611 · report
train identical code first harvested elsewhere unverified licence of this copy not recorded · 75e61dc3235c8bcc · report
validate identical code first harvested elsewhere unverified licence of this copy not recorded · 242411f7cb8af73b · report
validate identical code first harvested elsewhere unverified licence of this copy not recorded · 6536aad716b69521 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionAuxiliary ClassifierAverage PoolingConvolutionDense ConnectionsDropoutGoogLeNetInception ModuleLocal Response NormalizationMax PoolingReLUSoftmax

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections