High-dimensional tensors or multi-way data are becoming prevalent in areas such as biomedical imaging, chemometrics, networking and bibliometrics. Traditional approaches to finding lower dimensional representations of tensor data include flattening the data and applying matrix factorizations such as principal components analysis (PCA) or employing tensor decompositions such as the CANDECOMP / P...

Low-rank tensor estimation has been frequently applied in many real-world problems. Despite successful applications, existing Schatten 1-norm minimization (SNM) methods may become very slow or even not applicable for large-scale problems. To address this difficulty, we therefore propose an efficient and scalable core tensor Schatten 1-norm minimization method for simultaneous tensor decompositi...

Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal’s uniqueness theorem to decompose symmetric, nearly orthogonally decomposable tensors. Unlike the classical higher-order singular value decomposition which unfolds a ten...

Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived from a random walk on the graph and thus they cannot take advantage of important higher-order network substructures such as triangles, cycles, and feed-forward loops. Here we propose a Tensor Spectral Clustering (TSC) ...

In this paper, we exploit the advantages of tensor representations and propose a Supervised Multilinear Learning Model for regression. The model is based on the Canonical (CANDECOMP)/Parallel Factors (PARAFAC) decomposition of tensors of multiple modes and allows the simultaneous projection of an input tensor to more than one discriminative directions along each mode. These projection weights a...

Many researches attempt to improve the efficiency of the usual quasi-Newton (QN) methods by accelerating the performance of the algorithm without causing more storage demand. They aim to employ more available information from the function values and gradient to approximate the curvature of the objective function. In this paper we derive a new QN method of this type using a fourth order tensor m...

The use of second-order tensors for the modeling of data from Diffusion Weighted Magnetic Resonance Imaging (DW-MRI) is limited by their inability to represent more than one dominant direction in cases of crossing fiber bundles or partial voluming. Higher-order tensors have been used in High Angular Resolution Diffusion Imaging (HARDI) to overcome these problems, but their larger number of para...

Low rank tensor learning, such as tensor completion and multilinear multitask learning, has received much attention in recent years. In this paper, we propose higher order matching pursuit for low rank tensor learning problems with a convex or a nonconvex cost function, which is a generalization of the matching pursuit type methods. At each iteration, the main cost of the proposed methods is on...

Alexander Hewer1 [email protected] Joachim Weickert1 [email protected] Tobias Scheffer2 [email protected] Henning Seibert2 [email protected] Stefan Diebels2 [email protected] 1 Mathematical Image Analysis Group Saarland University, Campus E1.7 66041 Saarbrücken, Germany 2 Chair of Applied Mechanics Saarland University, Campus A4.2 66041 Saarb...