DeepAI AI Chat
Log In Sign Up

STARK: Structured Dictionary Learning Through Rank-one Tensor Recovery

11/13/2017
by   Mohsen Ghassemi, et al.
Rutgers University
0

In recent years, a class of dictionaries have been proposed for multidimensional (tensor) data representation that exploit the structure of tensor data by imposing a Kronecker structure on the dictionary underlying the data. In this work, a novel algorithm called "STARK" is provided to learn Kronecker structured dictionaries that can represent tensors of any order. By establishing that the Kronecker product of any number of matrices can be rearranged to form a rank-1 tensor, we show that Kronecker structure can be enforced on the dictionary by solving a rank-1 tensor recovery problem. Because rank-1 tensor recovery is a challenging nonconvex problem, we resort to solving a convex relaxation of this problem. Empirical experiments on synthetic and real data show promising results for our proposed algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/10/2017

Identifiability of Kronecker-structured Dictionaries for Tensor Data

This paper derives sufficient conditions for reliable recovery of coordi...
03/22/2019

Learning Mixtures of Separable Dictionaries for Tensor Data: Analysis and Algorithms

This work addresses the problem of learning sparse representations of te...
09/25/2019

Non-negative Tensor Patch Dictionary Approaches for Image Compression and Deblurring Applications

In recent work (Soltani, Kilmer, Hansen, BIT 2016), an algorithm for non...
09/23/2019

Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery

Low-rank tensor recovery problems have been widely studied in many appli...
03/07/2017

Online Multilinear Dictionary Learning for Sequential Compressive Sensing

A method for online tensor dictionary learning is proposed. With the ass...
05/29/2018

Automating Personnel Rostering by Learning Constraints Using Tensors

Many problems in operations research require that constraints be specifi...
05/17/2016

Minimax Lower Bounds for Kronecker-Structured Dictionary Learning

Dictionary learning is the problem of estimating the collection of atomi...