English

Compressing Neural Networks Using Tensor Networks with Exponentially Fewer Variational Parameters

Machine Learning 2025-05-23 v3 Artificial Intelligence

Abstract

Neural network (NN) designed for challenging machine learning tasks is in general a highly nonlinear mapping that contains massive variational parameters. High complexity of NN, if unbounded or unconstrained, might unpredictably cause severe issues including \R{overfitting}, loss of generalization power, and unbearable cost of hardware. In this work, we propose a general compression scheme that significantly reduces the variational parameters of NN's, despite of their specific types (linear, convolutional, \textit{etc}), by encoding them to deep \R{automatically differentiable} tensor network (ADTN) that contains exponentially-fewer free parameters. Superior compression performance of our scheme is demonstrated on several widely-recognized NN's (FC-2, LeNet-5, AlextNet, ZFNet and VGG-16) and datasets (MNIST, CIFAR-10 and CIFAR-100). For instance, we compress two linear layers in VGG-16 with approximately 10710^{7} parameters to two ADTN's with just 424 parameters, improving the testing accuracy on CIFAR-10 from 90.17%90.17\% to 91.74%91.74\%. We argue that the deep structure of ADTN is an essential reason for the remarkable compression performance of ADTN, compared to existing compression schemes that are mainly based on tensor decompositions/factorization and shallow tensor networks. Our work suggests deep TN as an exceptionally efficient mathematical structure for representing the variational parameters of NN's, which exhibits superior compressibility over the commonly-used matrices and multi-way arrays.

Keywords

Cite

@article{arxiv.2305.06058,
  title  = {Compressing Neural Networks Using Tensor Networks with Exponentially Fewer Variational Parameters},
  author = {Yong Qing and Ke Li and Peng-Fei Zhou and Shi-Ju Ran},
  journal= {arXiv preprint arXiv:2305.06058},
  year   = {2025}
}

Comments

9 pages, 5 figures, 2 tables for the main text; 6 pages for the appendices

R2 v1 2026-06-28T10:30:56.322Z