Sensing Tensors With Gaussian Filters
From MaRDI portal
Abstract: Sparse recovery from linear Gaussian measurements has been the subject of much investigation since the breaktrough papers cite{CRT:IEEEIT06} and cite{donoho2006compressed} on Compressed Sensing. Application to sparse vectors and sparse matrices via least squares penalized with sparsity promoting norms is now well understood using tools such as Gaussian mean width, statistical dimension and the notion of descent cones cite{tropp2014convex} cite{Vershynin:ArXivEstimation14}. Extention of these ideas to low rank tensor recovery is starting to enjoy considerable interest due to its many potential applications to Independent Component Analysis, Hidden Markov Models and Gaussian Mixture Models cite{AnandkumarEtAl:JMLR14}, hyperspectral image analysis cite{zhang2008tensor}, to name a few. In this paper, we demonstrate that the recent approach of cite{Vershynin:ArXivEstimation14} provides very useful error bounds in the tensor setting using the nuclear norm or the Romera-Paredes--Pontil cite{RomeraParedesPontil:NIPS13} penalization.
Cited in
(5)- Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography
- Tensor completion based on triple tubal nuclear norm
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- Nested Vector-Sensor Array Processing via Tensor Modeling
- Decomposition of dynamical signals into jumps, oscillatory patterns, and possible outliers
This page was built for publication: Sensing Tensors With Gaussian Filters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989629)
