Higher-order singular value decomposition

In multilinear algebra, the higher-order singular value decomposition (HOSVD) of a tensor is a specific orthogonal Tucker decomposition. It may be regarded as one generalization of the matrix singular value decomposition. The HOSVD has applications in computer graphics, machine learning, scientific computing, and signal processing. Some key ingredients of the HOSVD can be traced as far back as F. L. Hitchcock in 1928,^[1] but it was L. R. Tucker who developed for third-order tensors the general Tucker decomposition in the 1960s,^[2][3][4] including the HOSVD. The HOSVD as decomposition in its own right was further advocated by L. De Lathauwer et al.^[5] in 2000. Robust and L1-norm-based variants of HOSVD have also been proposed.^[6][7][8][9]

As the HOSVD was studied in many scientific fields, it is sometimes historically referred to as multilinear singular value decomposition, m-mode SVD, or cube SVD, and sometimes it is incorrectly identified with a Tucker decomposition.

Definition[]

For the purpose of this article, the abstract tensor ${\displaystyle {\mathcal {A}}}$ is assumed to be given in coordinates with respect to some basis as a multidimensional array, also denoted by ${\displaystyle {\mathcal {A}}}$, in ${\displaystyle F^{n_{1}\times n_{2}\times \cdots \times n_{d}}}$, where d is the order of the tensor and ${\displaystyle F}$ is either ${\displaystyle \mathbb {R} }$ or ${\displaystyle \mathbb {C} }$.

Let ${\displaystyle U_{k}\in F^{n_{k}\times n_{k}}}$be a unitary matrix containing a basis of the left singular vectors of the standard factor-k flattening ${\displaystyle {\mathcal {A}}_{(k)}}$ of ${\displaystyle {\mathcal {A}}}$ such that the jth column ${\displaystyle \mathbf {u} _{j}^{k}}$ of ${\displaystyle U_{k}}$ corresponds to the jth largest singular value of ${\displaystyle {\mathcal {A}}_{(k)}}$. Observe that the factor matrix ${\displaystyle U_{k}}$ does not depend on the particular freedom of choice in the definition of the standard factor-k flattening. By the properties of the multilinear multiplication, we have

where ${\displaystyle \cdot ^{H}}$ denotes the conjugate transpose. The second equality is because the ${\displaystyle U_{k}}$'s are unitary matrices. Define now the core tensorThen, the HOSVD^[5] of ${\displaystyle {\mathcal {A}}}$ is the decompositionThe above construction shows that every tensor has a HOSVD.

Compact HOSVD[]

As in the case of the compact singular value decomposition of a matrix, it is also possible to consider a compact HOSVD, which is very useful in applications.

Assume that ${\displaystyle U_{k}\in F^{n_{k}\times r_{k}}}$ is a matrix with unitary columns containing a basis of the left singular vectors corresponding to the nonzero singular values of the standard factor-k flattening ${\displaystyle {\mathcal {A}}_{(k)}}$ of ${\displaystyle {\mathcal {A}}}$. Let the columns of ${\displaystyle U_{k}}$ be sorted such that the jth column ${\displaystyle \mathbf {u} _{j}^{k}}$ of ${\displaystyle U_{k}}$ corresponds to the jth largest nonzero singular value of ${\displaystyle {\mathcal {A}}_{(k)}}$. Since the columns of ${\displaystyle U_{k}}$ form a basis for the image of ${\displaystyle {\mathcal {A}}_{(k)}}$, we have

where the first equality is due to the properties of orthogonal projections (in the Hermitian inner product) and the last equality is due to the properties of multilinear multiplication. As flattenings are bijective maps and the above formula is valid for all ${\displaystyle k=1,2,\ldots ,d}$, we find as before thatwhere the core tensor ${\displaystyle {\mathcal {S}}}$ is now of size ${\displaystyle r_{1}\times r_{2}\times \cdots \times r_{d}}$.

Multilinear rank[]

The tuple ${\displaystyle (r_{1},r_{2},\ldots ,r_{d})\in \mathbb {N} ^{d}}$ where ${\displaystyle r_{k}:=\mathrm {rank} ({\mathcal {A}}_{(k)})}$ is called the multilinear rank^[1] of ${\displaystyle {\mathcal {A}}}$. By definition, every tensor has a unique multilinear rank, and its components are bounded by ${\displaystyle 0\leq r_{k}\leq n_{k}}$. Not all tuples in ${\displaystyle \mathbb {N} ^{d}}$ are multilinear ranks.^[10] In particular, it is known that ${\textstyle r_{k}\leq \prod _{j\neq k}r_{j}}$ must hold.^[10]

The compact HOSVD is a rank-revealing factorization in the sense that the dimensions of its core tensor correspond with the components of the multilinear rank of the tensor.

Interpretation[]

The following geometric interpretation is valid for both the full and compact HOSVD. Let ${\displaystyle (r_{1},r_{2},\ldots ,r_{d})}$ be the multilinear rank of the tensor ${\displaystyle {\mathcal {A}}}$. Since ${\displaystyle {\mathcal {S}}\in F^{r_{1}\times r_{2}\times \cdots \times r_{d}}}$ is a multidimensional array, we can expand it as follows

where ${\displaystyle \mathbf {e} _{j}^{k}}$ is the jth standard basis vector of ${\displaystyle F^{n_{k}}}$. By definition of the multilinear multiplication, it holds thatwhere the ${\displaystyle \mathbf {u} _{j}^{k}}$ are the columns of ${\displaystyle U_{k}\in F^{n_{k}\times r_{k}}}$. It is easy to verify that ${\displaystyle B=\{\mathbf {u} _{j_{1}}^{1}\otimes \mathbf {u} _{j_{2}}^{2}\otimes \cdots \otimes \mathbf {u} _{j_{d}}^{d}\}_{j_{1},j_{2},\ldots ,j_{d}}}$ is an orthonormal set of tensors. This means that the HOSVD can be interpreted as a way to express the tensor ${\displaystyle {\mathcal {A}}}$ with respect to a specifically chosen orthonormal basis ${\displaystyle B}$ with the coefficients given as the multidimensional array ${\displaystyle {\mathcal {S}}}$.

Computation[]

Let ${\displaystyle {\mathcal {A}}\in F^{n_{1}\times n_{2}\times \cdots \times n_{d}}}$, where ${\displaystyle F}$ is either ${\displaystyle \mathbb {R} }$ or ${\displaystyle \mathbb {C} }$, be a tensor of multilinear rank ${\displaystyle (r_{1},r_{2},\ldots ,r_{d})}$.

Classic computation[]

The classic strategy for computing a compact HOSVD was introduced in 1966 by L. R. Tucker^[2] and further advocated by L. De Lathauwer et al.;^[5] it is based on the definition of the decomposition. The next three steps are to be performed:

• For ${\displaystyle k=1,2,\ldots ,d}$, do the following:

1. Construct the standard factor-k flattening ${\displaystyle {\mathcal {A}}_{(k)}}$;
2. Compute the (compact) singular value decomposition ${\displaystyle {\mathcal {A}}_{(k)}=U_{k}\Sigma _{k}V_{k}^{T}}$, and store the left singular vectors ${\displaystyle U_{k}\in F^{n_{k}\times r_{k}}}$;
3. Compute the core tensor ${\displaystyle {\mathcal {S}}}$ via the multilinear multiplication ${\displaystyle {\mathcal {S}}=(U_{1}^{H},U_{2}^{H},\ldots ,U_{d}^{H})\cdot {\mathcal {A}}.}$

Interlaced computation[]

A strategy that is significantly faster when some or all ${\displaystyle r_{k}\ll n_{k}}$ consists of interlacing the computation of the core tensor and the factor matrices, as follows:^[11][12]

• Set ${\displaystyle {\mathcal {A}}^{0}={\mathcal {A}}}$;
• For ${\displaystyle k=1,2,\ldots ,d}$ perform the following:
  1. Construct the standard factor-k flattening ${\displaystyle {\mathcal {A}}_{(k)}^{k-1}}$;
  2. Compute the (compact) singular value decomposition ${\displaystyle {\mathcal {A}}_{(k)}^{k-1}=U_{k}\Sigma _{k}V_{k}^{T}}$, and store the left singular vectors ${\displaystyle U_{k}\in F^{n_{k}\times r_{k}}}$;
  3. Set ${\displaystyle {\mathcal {A}}^{k}=U_{k}^{H}\cdot _{k}{\mathcal {A}}^{k-1}}$, or, equivalently, ${\displaystyle {\mathcal {A}}_{(k)}^{k}=\Sigma _{k}V_{k}^{T}}$.

Approximation[]

In applications, such as those mentioned below, a common problem consists of approximating a given tensor ${\displaystyle {\mathcal {A}}\in F^{n_{1}\times n_{2}\times \cdots \times n_{d}}}$ by one of low multilinear rank. Formally, if ${\displaystyle \mathrm {mlrank} ({\mathcal {A}})}$ denotes the multilinear rank of ${\displaystyle {\mathcal {A}}}$, then the nonlinear non-convex ${\displaystyle \ell _{2}}$-optimization problem is

where ${\displaystyle (s_{1},s_{2},\ldots ,s_{d})\in \mathbb {N} ^{d}}$ with ${\displaystyle 0\leq s_{k}\leq n_{k}}$, is a target multilinear rank that is assumed to be given, and where the norm is the Frobenius norm.

Based on the foregoing algorithms for computing a compact HOSVD, a natural idea for trying to solve this optimization problem is to truncate the (compact) SVD in step 2 of either the classic or the interlaced computation. A classically truncated HOSVD is obtained by replacing step 2 in the classic computation by

• Compute a rank-${\displaystyle s_{k}}$ truncated SVD ${\displaystyle {\mathcal {A}}_{(k)}\approx U_{k}\Sigma _{k}V_{k}^{T}}$, and store the top ${\displaystyle s_{k}}$ left singular vectors ${\displaystyle U_{k}\in F^{n_{k}\times s_{k}}}$;

while a sequentially truncated HOSVD (or successively truncated HOSVD) is obtained by replacing step 2 in the interlaced computation by

• Compute a rank-${\displaystyle s_{k}}$ truncated SVD ${\displaystyle {\mathcal {A}}_{(k)}^{k-1}\approx U_{k}\Sigma _{k}V_{k}^{T}}$, and store the top ${\displaystyle s_{k}}$ left singular vectors ${\displaystyle U_{k}\in F^{n_{k}\times s_{k}}}$;

Unfortunately, neither of these strategies results in an optimal solution of the best low multilinear rank optimization problem,^[5][11] contrary to the matrix case where the Eckart-Young theorem holds. However, both the classically and sequentially truncated HOSVD result in a quasi-optimal solution:^[11][12][13] if ${\displaystyle {\mathcal {B}}_{t}}$ denotes the classically or sequentially truncated HOSVD and ${\displaystyle {\mathcal {B}}^{*}}$ denotes the optimal solution to the best low multilinear rank approximation problem, then

in practice this means that if there exists an optimal solution with a small error, then a truncated HOSVD will for many intended purposes also yield a sufficiently good solution.^[11]

Applications[]

The HOSVD is most commonly applied to the extraction of relevant information from multi-way arrays.

Circa 2001, Vasilescu reframed the data analysis, recognition and synthesis problems as multilinear tensor problems based on the insight that most observed data are the result of several causal factors of data formation, and are well suited for multi-modal data tensor analysis. The power of the tensor framework was showcased in a visually and mathematically compelling manner by decomposing and representing an image in terms of its causal factors of data formation, in the context of Human Motion Signatures,^[14] face recognition—^[15][16] and computer graphics—TensorTextures.^[17]

The HOSVD has been successfully applied to signal processing and big data, e.g., in genomic signal processing.^[18][19][20] These applications also inspired a higher-order GSVD (HO GSVD)^[21] and a tensor GSVD.^[22]

A combination of HOSVD and SVD also has been applied for real-time event detection from complex data streams (multivariate data with space and time dimensions) in disease surveillance.^[23]

It is also used in tensor product model transformation-based controller design.^[24][25] In multilinear subspace learning,^[26] it was applied to modeling tensor objects^[27] for gait recognition.

The concept of HOSVD was carried over to functions by Baranyi and Yam via the TP model transformation.^[24][25] This extension led to the definition of the HOSVD-based canonical form of tensor product functions and Linear Parameter Varying system models^[28] and to convex hull manipulation based control optimization theory, see TP model transformation in control theories.

HOSVD was proposed to be applied to multi-view data analysis^[29] and was successfully applied to in silico drug discovery from gene expression.^[30]

Robust L1-norm variant[]

L1-Tucker is the L1-norm-based, robust variant of Tucker decomposition.^[7][8] L1-HOSVD is the analogous of HOSVD for the solution to L1-Tucker.^[7][9]

References[]