## 1 Introduction

An increasing number of applications, such as in chemometrics, signal processing and high order statistics [9, 10, 11, 29, 55]

, involve the manipulation of quantities with elements addressed by more than two indices. In the literature these higher-order equivalents of vectors (first-order) and matrices (second-order) are called higher-order tensors, multidimensional matrices, or multiway arrays.

The symbol represents a -dimensional array of real numbers with entries given by for all and . For notational simplicity, we illustrate our results using third-order tensors whenever generalizations to higher-order cases are straightforward. Subtle differences will be mentioned when they exist.

In this paper, we consider the low multilinear rank approximation of a tensor, which is defined as follows.

###### Problem 1.1.

Suppose that . The goal is to require three column full rank matrices with , such that

where is a projected matrix.

When all the matrices are columnwise orthogonal, Problem 1.1 can be solved using a number of recently developed algorithms, such as higher-order orthogonal iteration [13], the Newton-Grassmann method [18], the Riemannian trust-region method [28], the Quasi-Newton method [46], semi-definite programming (SDP) [36], and Lanczos-type iteration [22, 45]. The readers can refer to two surveys [24, 29] for relevant information. When the columns of each are extracted from the mode- unfolding matrix , then, the solution of Problem 1.1 is called as the CUR-type decomposition of , which can be obtained using different versions of the cross approximation method. We can refer to [5, 16, 23, 34, 38, 39] for more details about a CUR-type decomposition of tensors. On the other hand, for Problem 1.1, when we restrict the entries of the tensor and the matrices to be nonnegative and allow the matrices to be not columnwise orthogonal, the solution of Problem 1.1 is sometimes called a nonnegative Tucker decomposition [19, 58, 59, 61].

Low-rank matrix approximations, such as the truncated singular value decomposition [21, page 291] and the rank-revealing QR decomposition [6], play a central role in data analysis and scientific computing. Halko, Rohwedder, and Tropp [26] present a modular framework to construct randomized algorithms for computing partial matrix decompositions. We can refer to three surveys [17, 33, 56] for more results about the randomized algorithms for the low rank matrix approximations.

Randomized algorithms have recently been applied to tensor decompositions. Drineas and Mahoney [16] presented and analyzed randomized algorithms for computing the CUR-type decomposition of a tensor, which can be viewed as the generalization of the Linear-Time-SVD algorithm [15] and the Fast-Approximate-SVD algorithm [14] for the low rank approximations of matrices to tensors, which were originally for matrices. Battaglino et al. [2] extended randomized least squares methods to tensors and show the workload of CANDECOMP/PARAFAC-ALS can be drastically reduced without sacrifice in quality. Vervliet and De Lathauwer [54] presented the randomized block sampling canonical polyadic decomposition method, which combines increasingly popular ideas from randomization and stochastic optimization to tackle the computational problems.

Zhou et al. [60] proposed a distributed randomized Tucker decomposition for arbitrarily big tensors but with relatively low multilinear rank. Che and Wei [8] designed adaptive randomized algorithms for computing the low multilinear rank approximation of tensors and the approximate tensor train decomposition. More results about this topic can be found in [3, 37, 50] and their references.

As shown in [8, 60], comparison with the deterministic algorithms for low multilinear rank approximations, randomized algorithms are often faster and more robust. On the other hand, the algorithms in [8, 60] still have some deficiencies. Hence, the main work in this paper is to design more effective randomized algorithms for the computation of low multilinear rank approximations of tensors.

Our proposed algorithms can be divided into two stages. Suppose that . In the first stage, for each , the Kronecker product of two standard Gaussian matrices of suitable dimensions are applied to the mode- unfolding of , which is an matrix . In the second stage, we use a basic matrix decomposition, such as singular value decomposition (SVD), the rank-revealing QR decomposition (RRQR) and the rank-revealing LU factorization (RRLU), to obtain a full column rank matrix, satisfying the requirement that the column space of the matrix can be used to approximate . Note that Algorithm 4.1 with “FactType”=“SVD” and “FactType”=“RRLU” can be viewed as the generalization of the core idea of the randomized algorithm in [35] and Algorithm 4.1 in [47] with , respectively. As shown in Section 6, in terms of CPU times, the proposed algorithms are faster than the existed algorithms for low multilinear rank approximations; and in terms of RLNE, the proposed algorithms are sometimes less than the existed algorithms.

### 1.1 Notations and organizations

Throughout this paper, we assume that , , and denote the index upper bounds, unless stated otherwise. We use lower case letters for scalars, lower case bold letters for vectors, bold capital letters for matrices, and calligraphic letters for tensors. This notation is consistently used for lower-order parts of a given structure. For example, the entry with row index and column index in a matrix , i.e., , is represented as (also and ).

For a vector we use and to denote its 2-norm and transpose, respectively. denotes the zero vector in . We use to denote the Kronecker product of matrices and . We use to denote the Khatri–Rao product of matrices and . represents the Moore-Penrose pseudoinverse of .

The rest of our paper is organized as follows. In Section 2, we introduce basic tensor algebra, such as, tensor operation, RRQR, RRLU and singular values of general and random matrices. We present the higher-order singular value decomposition and higher-order orthogonal iteration for the low multilinear rank approximation in Section 3. The randomized algorithms for the low multilinear rank approximation are presented in Section 4. In the same section, we also analyze probabilistic error bounds and computational complexity of these three algorithms. The probabilistic error bounds are analyzed in Section 5. We illustrate our algorithms via numerical examples in Section 6. We conclude this paper and discuss future research topics in Section 7.

## 2 Preliminaries

### 2.1 Basic definitions

We review the basic notations and concepts involving tensors which will be used in this paper. The mode- product [10, 29] of a real tensor by a matrix , denoted by :

For any given tensor and three matrices , and , one has [29]

where ‘’ represents the multiplication of two matrices with appropriate sizes.

Scalar products and the Frobenius norm of a tensor are extensions of respective definitions from a matrix to a tensor of an arbitrary order [12, 29]. For two tensors , the Frobenius norm of a tensor is given by and the scalar product is defined as [12],

Generally speaking, the mode- unfolding matrix of a third-order tensor can be understood as the process of the construction of a matrix containing all the mode- vectors of the tensor. The order of the columns is not unique and the unfolding matrix of , denoted by , arranges the mode- fibers into columns of this matrix. More specifically, a tensor element maps on a matrix element , where

### 2.2 Rank revealing QR (RRQR)

For a given with , QR factorization with column pivoting makes use of a column pivoting strategy [20] to determine a permutation matrix such that is the QR factorization of , with being columnwise orthogonal and the upper triangular matrix partitioned as

where and is small in norm.

The QR factorization of , where is a permutation matrix chosen to yield a “small” , is referred to as the rank-revealing QR (RRQR) factorization of [6]. The definition of the RRQR factorization is given below.

###### Definition 2.1.

([4, Definition 2]) For a matrix and an integer such that and , assume that there exists a permutation matrix such that

(2.1) |

holds, where is columnwise orthogonal and is upper triangular. The above factorization is called a RRQR factorization if it satisfies

where and are functions bounded by low degree polynomials in and .

Most researchers improved RRQR factorizations by focusing on improving the functions and in Definition 2.1. We recommend [6, 7, 20, 25, 27, 41, 49] and their references for different expressions of and (see Table 2 in [4]). To be specific, the following theorem is adapted from [7, 25, 27].

###### Theorem 2.1.

For a matrix and an integer such that and , there exists a permutation matrix such that (2.1) holds, where and are bounded by

Based on Theorem 2.1, we have the following definition.

###### Definition 2.2.

###### Lemma 2.1.

(RRQR Approximation Error) The error of the approximation of is

### 2.3 Rank revealing LU (RRLU)

The following theorem is adopted from [40, Theorem 1.2]:

###### Theorem 2.2.

Let with . Given an integer , the following factorization

(2.3) |

holds, where is a unit lower triangular matrix, is upper triangular, and are orthogonal permutation matrices. Let , then

This is called RRLU decomposition. Based on Theorem 2.2, we have the following definition.

###### Definition 2.3.

###### Lemma 2.2.

(RRLU Approximation Error [47, Lemma 3.2]) The error of the approximation of is

### 2.4 Singular values of random matrices

We first introduce the definition of the sub-Gaussian random variable. Sub-Gaussian variables are an important class of random variables that have strong tail decay properties.

###### Definition 2.4.

([47, Definition 3.2]) A real valued random variable is called sub-Gaussian if there exist such that for all we have . A random variable is centered if .

We review several results adapted from [32, 42] about random matrices whose entries are sub-Gaussian. We focus on the case where is an matrix with . Similar results can be found in [31] for the square and almost square matrices.

###### Definition 2.5.

It is shown in [32] that if is sub-Gaussian, then . For a Gaussian matrix with zero mean and unit variance, we have . Theorems 2.3 and 2.4 are taken from Section 2 in [32].

###### Theorem 2.3.

Theorem 2.3 provides an upper bound for the largest singular value that depends on the desired probability. Theorem 2.4 is used to bound from the upper below the smallest singular value of a random sub-Gaussian matrices.

###### Theorem 2.4.

([32]) Let , and . Suppose that with . Then, there exist positive constants and such that

## 3 HOSVD and HOOI

A Tucker decomposition [51] of a tensor is defined as

(3.1) |

where are called the mode- factor matrices and is called the core tensor of the decomposition with the set .

The Tucker decomposition is closely related to the mode- unfolding matrix with . In particular, the relation (3.1) implies

It follows that the rank of is less than or equal to , as the mode- factor at most has rank . This motivates us to define the multilinear rank of as the tuple , where the rank of is equal to .

By applying the singular value decomposition (SVD) to with , we obtain a special form of the Tucker decomposition of a given tensor, which is referred to as the higher-order singular value decomposition (HOSVD) [12].

When for one or more , the decomposition is called the truncated HOSVD. Note that the truncated HOSVD is not optimal in terms of giving the best fitting as measured by the Frobenius norm of the difference, but it is used to initialize iterative algorithms to compute the best approximation of a specified multilinear rank [13, 18, 28, 46]. With respect to the Frobenius norm of tensors, the low multilinear rank approximation of can be rewritten as the optimization problem

If is a solution of the above maximization problem, then we call as a low multilinear rank approximation of , where .

## 4 The proposed algorithm and its analysis

In this section, we present our randomized algorithm for the low multilinear rank approximations of tensors, summarized in Algorithm 4.1. We also give a slight modification of Algorithm 4.1 to reduce the computational complexity of Algorithm 4.1.

### 4.1 Framework for the algorithm

For each , Algorithm 4.1 begins by projecting the mode- unfolding of the input tensor on the Kronecker product of random matrices. The result matrix captures most of the range of the mode- unfolding of the tensor. Then we compute a basis for this matrix by Lemma 5.3, RRQR or RRLU, respectively. Finally, we project the input tensor on it.

###### Remark 4.1.

Note that for the cases of “FactType”=“SVD” and “FactType”=“RRQR”, , where all the matrices are obtained from Algorithm 4.1.

In Algorithm 4.1, we use the computer science interpretation of to refer to the class of functions whose growth is bounded and below up to a constant.

Suppose that all the matrices are derived from Algorithm 4.1, then we have

(4.1) |

According to (4.1), we have

(4.2) |

The result relies on the orthogonality of the projector in the Frobenius norm [52], i.e., for any ,

and the fact that with , where the orthogonal projection satisfies [21]

Hence, when obtaining the error bound of , we present an error bound for Algorithm 4.1, summarized in the following theorem.

###### Theorem 4.1.

Suppose that , and . Let , and be integers such that . Let , and be integers such that . Let , and be integers such that . For each , we define , , , and as in Theorems 2.3 and 2.4 with .

For a given tensor , three full column rank matrices are obtained by Algorithm 4.1. Then

(4.3) |

with probability at least

where for “FactType”=“SVD”, , and are given by

for “FactType”=“RRQR”, , and are given by

and for “FactType”=“RRLU”, , and are given by

###### Remark 4.2.

Suppose that is the mode-1 unfolding of . Let be the singular value decomposition of , where and are orthogonal and is diagonal with positive diagonal elements. If , where are orthogonal with , then we have

where is the mode-1 unfolding of . It implies that the singular values of are the same as that of . Similarly, the singular values of the mode- unfolding of are the same as that of the mode- unfolding of with . Thus, the upper bound in Theorem 4.1 is orthogonal invariant.

For the case of , we set in Algorithm 4.1 and

Comments

There are no comments yet.