Higher-order singular value decomposition


In multilinear algebra, the higher-order singular value decomposition is a misnomer. There does not exist a single tensor decomposition that retains all the defining properties of the matrix SVD. The matrix SVD simultaneously yields a
These properties are not realized within a single algorithm for higher-order tensors, but are instead realized by two distinct algorithmic developments and represent two distinct research directions. Harshman, as well as, the team of Carol and Chang proposed Canonical polyadic decomposition, which is a variant of the tensor rank decomposition, in which a tensor is approximated as a sum of K rank-1 tensors for a user-specified K. L. R. Tucker proposed a strategy for computing orthonormal subspaces for third order tensors. Aspects of these algorithms can be traced as far back as F. L. Hitchcock in 1928.
De Lathauwer et al. introduced clarity to the Tucker concepts, while Vasilescu and Terzopoulos introduced algorithmic clarity. Vasilescu and Terzopoulos
introduced the M-mode SVD, which is the classic algorithm that is currently referred in the literature as the Tucker or the HOSVD. The Tucker approach and De Lathauwer's implementation are both sequential and rely on iterative procedures such as gradient descent or the power method. By contrast, the M-mode SVD provides a closed-form solution that can be executed sequentially and is well-suited for parallel computation.
The term M-mode SVD accurately reflects the algorithm employed. It captures the actual computation, a set of SVDs on mode-flattenings without making assumptions about the structure of the core tensor or implying a rank decomposition.
Robust and L1-norm-based variants of this decomposition framework have since been proposed.

Definition

For the purpose of this article, the abstract tensor is assumed to be given in coordinates with respect to some basis as a M-way array, also denoted by, where M is the number of modes and the order of the tensor. is the complex numbers and it includes both the real numbers and the pure imaginary numbers.
Let denote the mode-m flattening of, so that the left index of corresponds to the 'th index and the right index of corresponds to all other indices of combined. Let be a unitary matrix containing a basis of the left singular vectors of the such that the jth column of corresponds to the jth largest singular value of. Observe that the mode/factor matrix does not depend on the particular on the specific definition of the mode m flattening. By the properties of the multilinear multiplication, we havewhere denotes the conjugate transpose. The second equality is because the 's are unitary matrices. Define now the core tensorThen, the M-mode SVD of is the decomposition The above construction shows that every tensor has a M-mode SVD.

Compact M-mode SVD (HOSVD)

As in the case of the compact singular value decomposition of a matrix, where the rows and columns corresponding to vanishing singular values are dropped, it is also possible to consider a compact M-mode SVD, which is very useful in applications.
Assume that is a matrix with unitary columns containing a basis of the left singular vectors corresponding to the nonzero singular values of the standard factor-m flattening of. Let the columns of be sorted such that the th column of corresponds to the th largest nonzero singular value of. Since the columns of form a basis for the image of, we havewhere the first equality is due to the properties of orthogonal projections 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, we find as before thatwhere the core tensor is now of size.

Multilinear rank

The multilinear rank of is denoted with rank-. The multilinear rank is a tuple in where. Not all tuples in are multilinear ranks. The multilinear ranks are bounded by and it satisfy the constraint must hold.
The compact M-mode SVD is a rank-revealing decomposition 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 M-mode SVD. Let be the multilinear rank of the tensor. Since is a multidimensional array, we can expand it as followswhere is the th standard basis vector of. By definition of the multilinear multiplication, it holds thatwhere the are the columns of. It is easy to verify that is an orthonormal set of tensors. This means that the M-mode SVD can be interpreted as a way to express the tensor with respect to a specifically chosen orthonormal basis with the coefficients given as the multidimensional array.

Computation

Let be a tensor with a rank-, where contains the reals as a subset.

Classic computation

While De Lathauwer et al. clarified Tucker's concepts through two influential papers, Vasilescu and Terzopoulos provided algorithmic clarity. The Tucker algorithm and De Lathauwer et al. companion algorithm are sequential, relying on iterative methods such as gradient descent or the power method. In contrast, the M-mode SVD is computes the othonormal subspaces in closed-form that can be executed sequentially, but it is also well-suited for parallel computation.

M-mode SVD (also referred to as HOSVD or Tucker)

What is commonly referred to as the HOSVD or Tucker was developed by Vasilescu and Terzopoulos under
the name M-mode SVD.
  • For, do the following:
  1. Construct the mode-m flattening ;
  2. Compute the singular value decomposition
    , and store the left singular vectors ;
  • Compute the core tensor via the mode-m product

    Interlacing computation

A strategy that is significantly faster when some or all consists of interlacing the computation of the core tensor and the factor matrices, as follows:
  • Set ;
  • For perform the following:
  • # Construct the standard mode-m flattening ;
  • # Compute the singular value decomposition, and store the left singular vectors ;
  • # Set, or, equivalently,.

    In-place computation

The M-mode SVD can be computed in-place via the Fused In-place Sequentially Truncated Higher Order Singular Value Decomposition algorithm by overwriting the original tensor by the M-mode SVD core tensor, significantly reducing the memory consumption of computing HOSVD.

Approximation

In applications, such as those mentioned below, a common problem consists of approximating a given tensor by one with a reduced multilinear rank. Formally, if the multilinear rank of is denoted by, then computing the optimal that approximates for a given reduced is a nonlinear non-convex -optimization problem
where is the reduced multilinear rank with, and the norm is the Frobenius norm.
A simple idea for trying to solve this optimization problem is to truncate the SVD in step 2 of either the classic or the interlaced computation. A classically 'truncated M-mode SVD/HOSVD is obtained by replacing step 2 in the classic computation by
  • Compute a rank- truncated SVD, and store the top left singular vectors ;
while a sequentially truncated M-mode SVD is obtained by replacing step 2 in the interlaced computation by
  • Compute a rank- truncated SVD, and store the top left singular vectors. Unfortunately, truncation does not result in an optimal solution for the best low multilinear rank optimization problem,. However, both the classically and interleaved truncated M-mode SVD/HOSVD result in a quasi-optimal' solution: if denotes the classically or sequentially truncated M-mode SVD and denotes the optimal solution to the best low multilinear rank approximation problem, thenin practice this means that if there exists an optimal solution with a small error, then a truncated M-mode SVD/HOSVD will for many intended purposes also yield a sufficiently good solution.

    Applications

The M-mode SVD is most commonly applied to the extraction of relevant information from multi-way arrays.
Starting in the early 2000s, Vasilescu addressed causal questions by reframing the data analysis, recognition and synthesis problems as multilinear tensor problems. The power of the tensor framework was showcased by decomposing and representing an image in terms of its causal factors of data formation, in the context of Human Motion Signatures for gait recognition, face recognition—TensorFaces and computer graphics—TensorTextures.
The M-mode SVD has been successfully applied to signal processing and big data, e.g., in genomic signal processing. These applications also inspired a higher-order GSVD and a tensor GSVD.
A combination of M-mode SVD and SVD also has been applied for real-time event detection from complex data streams in disease surveillance.
It is also used in tensor product model transformation-based controller design.
The concept of M-mode SVD was carried over to functions by Baranyi and Yam via the TP model transformation. This extension led to the definition of the M-mode SVD/HOSVD canonical form of tensor product functions and Linear Parameter Varying system models and to convex hull manipulation based control optimization theory, see TP model transformation in control theories.
M-mode SVD was proposed to be applied to multi-way data analysis in an unsupervised manner and was successfully applied to in silico drug discovery from gene expression.

Robust L1-norm variant

L1-Tucker is the L1-norm-based, robust variant of Tucker decomposition. L1-HOSVD is the analogous of M-mode SVD for the solution to L1-Tucker.