Bayesian Tensorized Neural Networks with Automatic Rank Selection
read the original abstract
Tensor decomposition is an effective approach to compress over-parameterized neural networks and to enable their deployment on resource-constrained hardware platforms. However, directly applying tensor compression in the training process is a challenging task due to the difficulty of choosing a proper tensor rank. In order to achieve this goal, this paper proposes a Bayesian tensorized neural network. Our Bayesian method performs automatic model compression via an adaptive tensor rank determination. We also present approaches for posterior density calculation and maximum a posteriori (MAP) estimation for the end-to-end training of our tensorized neural network. We provide experimental validation on a fully connected neural network, a CNN and a residual neural network where our work produces $7.4\times$ to $137\times$ more compact neural networks directly from the training.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Tucker Tensor Decomposition on FPGA
FPGA accelerator for Tucker decomposition reports 2.16-30.2x speedup versus CPU/GPU toolboxes on cardiac MRI data via fixed-point design and warm-start SVD.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.