paper-with-me

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 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.

📄 PDF Abstract BibTeX arXiv:1905.10478

Code (1)

vicontek/lrbtnn pytorch

Tasks

Model CompressionTensor Decomposition

Similar 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 …

Model CompressionTensor DecompositionVariational Inference

Tensorized Optical Multimodal Fusion Network

2023-02-17 · Yequan Zhao, Xian Xiao, Geza Kurczveil, Raymond G. Beausoleil 외

We propose the first tensorized optical multimodal fusion network architecture with a self-attention mechanism and low-rank tensor fusion. Simulation results show $51.3 \times$ less hardware requirement and $3.7\times 10…

Tensor Methods for Nonlinear Matrix Completion

2018-04-26 · Greg Ongie, Daniel Pimentel-Alarcón, Laura Balzano, Rebecca Willett 외

In the low-rank matrix completion (LRMC) problem, the low-rank assumption means that the columns (or rows) of the matrix to be completed are points on a low-dimensional linear algebraic variety. This paper extends this t…

Low-Rank Matrix CompletionMatrix Completion

Do Tensorized Large-Scale Spatiotemporal Dynamic Atmospheric Data Exhibit Low-Rank Properties?

2025-07-04 · Ryan Solgi, Seyedali Mousavinezhad, Hugo A. Loaiciga arxiv

In this study, we investigate for the first time the low-rank properties of a tensorized large-scale spatio-temporal dynamic atmospheric variable. We focus on the Sentinel-5P tropospheric NO2 product (S5P-TN) over a four…

Bayesian Adaptive Matrix Factorization With Automatic Model Selection

2015-06-01 · CVPR 2015 6 · Peixian Chen, Naiyan Wang, Nevin L. Zhang, Dit-yan Yeung

Low-rank matrix factorization has long been recognized as a fundamental problem in many computer vision applications. Nevertheless, the reliability of existing matrix factorization methods is often hard to guarantee due …

modelModel Selection