paper-with-me

Papers

Tensor network compressibility of convolutional models

2024-03-21 · Sukhbinder Singh, Saeed S. Jahromi, Roman Orus

Convolutional neural networks (CNNs) are one of the most widely used neural network architectures, showcasing state-of-the-art performance in computer vision tasks. Although larger CNNs generally exhibit higher accuracy, their size can be effectively reduced by `tensorization'' while maintaining accuracy, namely, replacing the convolution kernels with compact decompositions such as Tucker, Canonical Polyadic decompositions, or quantum-inspired decompositions such as matrix product states, and directly training the factors in the decompositions to bias the learning towards low-rank decompositions. But why doesn't tensorization seem to impact the accuracy adversely? We explore this by assessing how \textit{truncating} the convolution kernels of \textit{dense} (untensorized) CNNs impact their accuracy. Specifically, we truncated the kernels of (i) a vanilla four-layer CNN and (ii) ResNet-50 pre-trained for image classification on CIFAR-10 and CIFAR-100 datasets. We found that kernels (especially those inside deeper layers) could often be truncated along several cuts resulting in significant loss in kernel norm but not in classification accuracy. This suggests that such `correlation compression'' (underlying tensorization) is an intrinsic feature of how information is encoded in dense CNNs. We also found that aggressively truncated models could often recover the pre-truncation accuracy after only a few epochs of re-training, suggesting that compressing the internal correlations of convolution layers does not often transport the model to a worse minimum. Our results can be applied to tensorize and compress CNN models more effectively.

📄 PDF Abstract BibTeX arXiv:2403.14379

Code (0)

등록된 구현이 없습니다.

Tasks

image-classificationImage Classification

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Understanding Generalization in Deep Learning via Tensor Methods

2020-01-14 · Jingling Li, Yanchao Sun, Jiahao Su, Taiji Suzuki 외

Deep neural networks generalize well on unseen data though the number of parameters often far exceeds the number of training examples. Recently proposed complexity measures have provided insights to understanding the gen…

Deep Learning

Large deformation diffeomorphic cardiac strain mapping

2025-04-04 · Beatrice Moscoloni, Patrick Segers, Mathias Peirlinck

Cardiac deformation is a crucial biomarker for the evaluation of cardiac function. Current methods for estimating cardiac strain might underestimate local deformation due to through-plane motion and segmental averaging. …

Back-and-Forth prediction for deep tensor compression

2020-02-14 · Hyomin Choi, Robert A. Cohen, Ivan V. Bajic

Recent AI applications such as Collaborative Intelligence with neural networks involve transferring deep feature tensors between various computing devices. This necessitates tensor compression in order to optimize the us…

Prediction

Rank Minimization on Tensor Ring: A New Paradigm in Scalable Tensor Decomposition and Completion

2018-05-22 · Longhao Yuan, Chao Li, Danilo Mandic, Jianting Cao 외

In low-rank tensor completion tasks, due to the underlying multiple large-scale singular value decomposition (SVD) operations and rank selection problem of the traditional methods, they suffer from high computational cos…

Tensor Decomposition

Compressive Sensing of Sparse Tensors

2013-05-24 · Shmuel Friedland, Qun Li, Dan Schonfeld

Compressive sensing (CS) has triggered enormous research activity since its first appearance. CS exploits the signal's sparsity or compressibility in a particular domain and integrates data compression and acquisition, t…

Compressive SensingData Compression