Randomized Algorithms for Computation of Tucker decomposition and Higher Order SVD (HOSVD)

01/20/2020
by   Salman Ahmadi Asl, et al.
0

Big data analysis has become a crucial part of new emerging technologies such as Internet of thing (IOT), cyber-physical analysis, deep learning, anomaly detection etc. Among many other techniques, dimensionality reduction plays a key role in such analyses and facilitate the procedure of feature selection and feature extraction. Randomized algorithms are efficient tools for handling big data tensors. They accelerate decomposing large-scale data tensors by reducing the computational complexity of deterministic algorithms and also reducing the communication among different levels of memory hierarchy which is a main bottleneck in modern computing environments and architectures. In this paper, we review recent advances in randomization for computation of Tucker decomposition and Higher Order SVD (HOSVD). We discuss both random projection and sampling approaches and also single-pass and multi-pass randomized algorithms and how they can be utilized in computation of Tucker decomposition and HOSVD. Simulations on real data including weight tensors of fully connected layers of pretrained VGG-16 and VGG-19 deep neural networks and also CIFAR-10 and CIFAR-100 datasets are provided to compare performance of some of the presented algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2021

Protecting Big Data Privacy Using Randomized Tensor Network Decomposition and Dispersed Tensor Computation

Data privacy is an important issue for organizations and enterprises to ...
research
05/08/2023

Fast randomized algorithms for computing the generalized tensor SVD based on the tubal product

This work deals with developing two fast randomized algorithms for compu...
research
04/27/2017

Multiscale Analysis for Higher-order Tensors

The widespread use of multisensor technology and the emergence of big da...
research
09/06/2023

A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format

The Nyström method offers an effective way to obtain low-rank approximat...
research
05/03/2017

Fourth-order Tensors with Multidimensional Discrete Transforms

The big data era is swamping areas including data analysis, machine/deep...
research
10/06/2016

Parallel Large-Scale Attribute Reduction on Cloud Systems

The rapid growth of emerging information technologies and application pa...

Please sign up or login with your details

Forgot password? Click here to reset