Convex recovery of tensors using nuclear norm penalization

06/08/2015
by   Stéphane Chrétien, et al.
0

The subdifferential of convex functions of the singular spectrum of real matrices has been widely studied in matrix analysis, optimization and automatic control theory. Convex analysis and optimization over spaces of tensors is now gaining much interest due to its potential applications to signal processing, statistics and engineering. The goal of this paper is to present an applications to the problem of low rank tensor recovery based on linear random measurement by extending the results of Tropp to the tensors setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/28/2021

Approximately low-rank recovery from noisy and local measurements by convex program

Low-rank matrix models have been universally useful for numerous applica...
research
08/05/2020

Robust Tensor Principal Component Analysis: Exact Recovery via Deterministic Model

Tensor, also known as multi-dimensional array, arises from many applicat...
research
06/30/2020

Multi-way Graph Signal Processing on Tensors: Integrative analysis of irregular geometries

Graph signal processing (GSP) is an important methodology for studying a...
research
07/06/2016

Tensor Decomposition for Signal Processing and Machine Learning

Tensors or multi-way arrays are functions of three or more indices (i,j...
research
07/07/2014

Spectral norm of random tensors

We show that the spectral norm of a random n_1× n_2×...× n_K tensor (or ...
research
10/05/2010

Estimation of low-rank tensors via convex optimization

In this paper, we propose three approaches for the estimation of the Tuc...
research
02/15/2023

Enhanced Nonlinear System Identification by Interpolating Low-Rank Tensors

Function approximation from input and output data is one of the most inv...

Please sign up or login with your details

Forgot password? Click here to reset