paper-with-me

Papers

Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination

2020-10-17 · Cole Hawkins, Xing Liu, Zheng Zhang

While post-training model compression can greatly reduce the inference cost of a deep neural network, uncompressed training still consumes a huge amount of hardware resources, run-time and energy. It is highly desirable to directly train a compact neural network from scratch with low memory and low computational cost. Low-rank tensor decomposition is one of the most effective approaches to reduce the memory and computing requirements of large-size neural networks. However, directly training a low-rank tensorized neural network is a very challenging task because it is hard to determine a proper tensor rank {\it a priori}, which controls the model complexity and compression ratio in the training process. This paper presents a novel end-to-end framework for low-rank tensorized training of neural networks. We first develop a flexible Bayesian model that can handle various low-rank tensor formats (e.g., CP, Tucker, tensor train and tensor-train matrix) that compress neural network parameters in training. This model can automatically determine the tensor ranks inside a nonlinear forward model, which is beyond the capability of existing Bayesian tensor methods. We further develop a scalable stochastic variational inference solver to estimate the posterior density of large-scale problems in training. Our work provides the first general-purpose rank-adaptive framework for end-to-end tensorized training. Our numerical results on various neural network architectures show orders-of-magnitude parameter reduction and little accuracy loss (or even better accuracy) in the training process. Specifically, on a very large deep learning recommendation system with over $4.2\times 10^9$ model parameters, our method can reduce the variables to only $1.6\times 10^5$ automatically in the training process (i.e., by $2.6\times 10^4$ times) while achieving almost the same accuracy.

📄 PDF Abstract BibTeX arXiv:2010.08689

Code (1)

colehawkins/bayesian-tensor-rank-determination 공식 구현 pytorch

Tasks

Model CompressionTensor DecompositionVariational Inference

Similar Papers 제목 키워드 기반

Bayesian Tensorized Neural Networks with Automatic Rank Selection

2019-05-24 · Cole Hawkins, Zheng Zhang

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…

Model CompressionTensor Decomposition

Bayesian Robust Tensor Ring Model for Incomplete Multiway Data

2022-02-27 · Zhenhao Huang, Yuning Qiu, Xinqi Chen, Weijun Sun 외

Robust tensor completion (RTC) aims to recover a low-rank tensor from its incomplete observation with outlier corruption. The recently proposed tensor ring (TR) model has demonstrated superiority in solving the RTC probl…

MARS: Masked Automatic Ranks Selection in Tensor Decompositions

2020-06-18 · Maxim Kodryan, Dmitry Kropotov, Dmitry Vetrov

Tensor decomposition methods have proven effective in various applications, including compression and acceleration of neural networks. At the same time, the problem of determining optimal decomposition ranks, which prese…

Tensor Decomposition

Variational Bayesian Inference for Robust Streaming Tensor Factorization and Completion

2018-09-06 · Cole Hawkins, Zheng Zhang

Streaming tensor factorization is a powerful tool for processing high-volume and multi-way temporal data in Internet networks, recommender systems and image/video data analysis. Existing streaming tensor factorization al…

Bayesian InferenceRecommendation Systems

Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection

2025-07-15 · Afra Kilic, Kim Batselier

Tensor Network (TN) Kernel Machines speed up model learning by representing parameters as low-rank TNs, reducing computation and memory use. However, most TN-based Kernel methods are deterministic and ignore parameter un…

feature selectionUncertainty QuantificationVariational Inference