DeepAI AI Chat
Log In Sign Up

Finding entries of maximum absolute value in low-rank tensors

by   Lars Grasedyck, et al.
RWTH Aachen University

We present an iterative method for the search of extreme entries in low-rank tensors which is based on a power iteration combined with a binary search. In this work we use the HT-format for low-rank tensors but other low-rank formats can be used verbatim. We present two different approaches to accelerate the basic power iteration: an orthogonal projection of Rayleigh-Ritz type, as well as an acceleration of the power iteration itself which can be achieved due to the diagonal structure of the underlying eigenvalue problem. Finally the maximizing index is determined by a binary search based on the proposed iterative method for the approximation of the maximum norm. The iterative method for the maximum norm estimation inherits the linear complexity of the involved tensor arithmetic in the HT-format w.r.t. the tensor order, which is also verified by numerical tests.


page 1

page 2

page 3

page 4


CP decomposition and low-rank approximation of antisymmetric tensors

For the antisymmetric tensors the paper examines a low-rank approximatio...

Algebraic Methods for Tensor Data

We develop algebraic methods for computations with tensor data. We give ...

Matrix and tensor rigidity and L_p-approximation

In this note we make two observations. First: the low-rank approximation...

An Efficient Tensor Completion Method via New Latent Nuclear Norm

In tensor completion, the latent nuclear norm is commonly used to induce...

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., alg...

Language Modeling with Power Low Rank Ensembles

We present power low rank ensembles (PLRE), a flexible framework for n-g...

Tensor Ranks for the Pedestrian for Dimension Reduction and Disentangling Interactions

A tensor is a multi-way array that can represent, in addition to a data ...