Tensor Shape Search for Optimum Data Compression
- URL: http://arxiv.org/abs/2205.10651v1
- Date: Sat, 21 May 2022 17:58:33 GMT
- Title: Tensor Shape Search for Optimum Data Compression
- Authors: Ryan Solgi, Zichang He, William Jiahua Liang, Zheng Zhang
- Abstract summary: We study the effect of the tensor shape on the tensor decomposition.
We propose an optimization model to find an optimum shape for the tensor train (TT) decomposition.
- Score: 6.610488230919323
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Various tensor decomposition methods have been proposed for data compression.
In real world applications of the tensor decomposition, selecting the tensor
shape for the given data poses a challenge and the shape of the tensor may
affect the error and the compression ratio. In this work, we study the effect
of the tensor shape on the tensor decomposition and propose an optimization
model to find an optimum shape for the tensor train (TT) decomposition. The
proposed optimization model maximizes the compression ratio of the TT
decomposition given an error bound. We implement a genetic algorithm (GA)
linked with the TT-SVD algorithm to solve the optimization model. We apply the
proposed method for the compression of RGB images. The results demonstrate the
effectiveness of the proposed evolutionary tensor shape search for the TT
decomposition.
Related papers
- Convolutional Neural Network Compression Based on Low-Rank Decomposition [3.3295360710329738]
This paper proposes a model compression method that integrates Variational Bayesian Matrix Factorization.
VBMF is employed to estimate the rank of the weight tensor at each layer.
Experimental results show that for both high and low compression ratios, our compression model exhibits advanced performance.
arXiv Detail & Related papers (2024-08-29T06:40:34Z) - A Supervised Tensor Dimension Reduction-Based Prognostics Model for
Applications with Incomplete Imaging Data [2.538209532048867]
This paper proposes a supervised dimension reduction methodology for tensor data which has two advantages over most image-based prognostic models.
It utilizes time-to-failure (TTF) to supervise the extraction of low-dimensional features which makes the extracted features more effective for the subsequent prognostic.
arXiv Detail & Related papers (2022-07-22T22:06:17Z) - Error Analysis of Tensor-Train Cross Approximation [88.83467216606778]
We provide accuracy guarantees in terms of the entire tensor for both exact and noisy measurements.
Results are verified by numerical experiments, and may have important implications for the usefulness of cross approximations for high-order tensors.
arXiv Detail & Related papers (2022-07-09T19:33:59Z) - Estimating the Resize Parameter in End-to-end Learned Image Compression [50.20567320015102]
We describe a search-free resizing framework that can further improve the rate-distortion tradeoff of recent learned image compression models.
Our results show that our new resizing parameter estimation framework can provide Bjontegaard-Delta rate (BD-rate) improvement of about 10% against leading perceptual quality engines.
arXiv Detail & Related papers (2022-04-26T01:35:02Z) - 2D+3D facial expression recognition via embedded tensor manifold
regularization [16.98176664818354]
A novel approach via embedded tensor manifold regularization for 2D+3D facial expression recognition (FERETMR) is proposed.
We establish the first-order optimality condition in terms of stationary points, and then design a block coordinate descent (BCD) algorithm with convergence analysis.
Numerical results on BU-3DFE database and Bosphorus databases demonstrate the effectiveness of our proposed approach.
arXiv Detail & Related papers (2022-01-29T06:11:00Z) - Uncovering the Over-smoothing Challenge in Image Super-Resolution: Entropy-based Quantification and Contrastive Optimization [67.99082021804145]
We propose an explicit solution to the COO problem, called Detail Enhanced Contrastive Loss (DECLoss)
DECLoss utilizes the clustering property of contrastive learning to directly reduce the variance of the potential high-resolution distribution.
We evaluate DECLoss on multiple super-resolution benchmarks and demonstrate that it improves the perceptual quality of PSNR-oriented models.
arXiv Detail & Related papers (2022-01-04T08:30:09Z) - Optimizing Information-theoretical Generalization Bounds via Anisotropic
Noise in SGLD [73.55632827932101]
We optimize the information-theoretical generalization bound by manipulating the noise structure in SGLD.
We prove that with constraint to guarantee low empirical risk, the optimal noise covariance is the square root of the expected gradient covariance.
arXiv Detail & Related papers (2021-10-26T15:02:27Z) - Spectral Tensor Train Parameterization of Deep Learning Layers [136.4761580842396]
We study low-rank parameterizations of weight matrices with embedded spectral properties in the Deep Learning context.
We show the effects of neural network compression in the classification setting and both compression and improved stability training in the generative adversarial training setting.
arXiv Detail & Related papers (2021-03-07T00:15:44Z) - Tensorized Random Projections [8.279639493543401]
We propose two tensorized random projection maps relying on the tensor train(TT) and CP decomposition format, respectively.
The two maps offer very low memory requirements and can be applied efficiently when the inputs are low rank tensors given in the CP or TT format.
Our results reveal that the TT format is substantially superior to CP in terms of the size of the random projection needed to achieve the same distortion ratio.
arXiv Detail & Related papers (2020-03-11T03:56:44Z) - A Unified Framework for Coupled Tensor Completion [42.19293115131073]
Coupled tensor decomposition reveals the joint data structure by incorporating priori knowledge that come from the latent coupled factors.
The TR has powerful expression ability and achieves success in some multi-dimensional data processing applications.
The proposed method is validated on numerical experiments on synthetic data, and experimental results on real-world data demonstrate its superiority over the state-of-the-art methods in terms of recovery accuracy.
arXiv Detail & Related papers (2020-01-09T02:15:46Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.