Pith. sign in

REVIEW 1 cited by

Iterative Low-Rank Approximation for CNN Compression

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1803.08995 v2 pith:TRV7NWHI submitted 2018-03-23 cs.CV

classification cs.CV
keywords networksapproachapproximationcompressionconvolutionaldeepdemonstratedevices
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Deep convolutional neural networks contain tens of millions of parameters, making them impossible to work efficiently on embedded devices. We propose iterative approach of applying low-rank approximation to compress deep convolutional neural networks. Since classification and object detection are the most favored tasks for embedded devices, we demonstrate the effectiveness of our approach by compressing AlexNet, VGG-16, YOLOv2 and Tiny YOLO networks. Our results show the superiority of the proposed method compared to non-repetitive ones. We demonstrate higher compression ratio providing less accuracy loss.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 8 citations worldwide. Full citation record

  1. Quantum Higher Order Singular Value Decomposition

    quant-ph 2019-08 reject novelty 5.0 of 10

    Two quantum algorithms for HOSVD are presented, with polylogarithmic time for preparing the decomposed state, plus a hybrid quantum-classical HOSVD recommendation method.

Pith tools