Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme

Authors:
Mariya Ishteva;P.-A. Absil;Sabine Van Huffel;Lieven De Lathauwer
Affiliations:
mariya.ishteva@cc.gatech.edu;absil@inma.ac.be;sabine.vanhuffel@esat.kuleuven.be and lieven.delathauwer@esat.kuleuven.be;lieven.delathauwer@kuleuven-kortrijk.be
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2011

Citing 22
Cited 3

Independent component analysis, a new concept?

Signal Processing - Special issue on higher order statistics
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Bibliography on higher-order statistics

Signal Processing
A Multilinear Singular Value Decomposition

SIAM Journal on Matrix Analysis and Applications
On the Best Rank-1 and Rank-(R1,R2,. . .,RN) Approximation of Higher-Order Tensors

SIAM Journal on Matrix Analysis and Applications
Trust-region methods

Trust-region methods
Algorithms for Numerical Analysis in High Dimensions

SIAM Journal on Scientific Computing
Tensor-based techniques for the blind separation of DS-CDMA signals

Signal Processing
Trust-Region Methods on Riemannian Manifolds

Foundations of Computational Mathematics
Canonical decomposition of ictal scalp EEG and accurate source localisation: principles and simulation study

Computational Intelligence and Neuroscience - EEG/MEG Signal Processing
Multiway analysis of epilepsy tensors

Bioinformatics
Fast Multilinear Singular Value Decomposition for Structured Tensors

SIAM Journal on Matrix Analysis and Applications
Tensor-Product Approximation to Multidimensional Integral Operators and Green's Functions

SIAM Journal on Matrix Analysis and Applications
Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time

SIAM Journal on Matrix Analysis and Applications
A geometric newton method for oja's vector field

Neural Computation
Optimization Algorithms on Matrix Manifolds

Optimization Algorithms on Matrix Manifolds
A Newton-Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor

SIAM Journal on Matrix Analysis and Applications
Tensor Decompositions and Applications

SIAM Review
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors

SIAM Journal on Scientific Computing
Higher-Order SVD-Based Subspace Estimation to Improve the Parameter Estimation Accuracy in Multidimensional Harmonic Retrieval Problems

IEEE Transactions on Signal Processing - Part II
Blind PARAFAC receivers for DS-CDMA systems

IEEE Transactions on Signal Processing
Parallel factor analysis in sensor array processing

IEEE Transactions on Signal Processing

Online learning in the embedded manifold of low-rank matrices

The Journal of Machine Learning Research
A New Truncation Strategy for the Higher-Order Singular Value Decomposition

SIAM Journal on Scientific Computing
Riemannian Optimization on Tensor Products of Grassmann Manifolds: Applications to Generalized Rayleigh-Quotients

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating these multi-way arrays are thus required. In this paper, we focus on the best rank-$(R_1,R_2,R_3)$ approximation of third-order tensors. We propose a new iterative algorithm based on the trust-region scheme. The tensor approximation problem is expressed as a minimization of a cost function on a product of three Grassmann manifolds. We apply the Riemannian trust-region scheme, using the truncated conjugate-gradient method for solving the trust-region subproblem. Making use of second order information of the cost function, superlinear convergence is achieved. If the stopping criterion of the subproblem is chosen adequately, the local convergence rate is quadratic. We compare this new method with the well-known higher-order orthogonal iteration method and discuss the advantages over Newton-type methods.