Results 11 to 20 of about 9,784 (260)
Completely Positive Binary Tensors [PDF]
A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it satisfies two linear matrix inequalities.
Jinyan Fan, Jiawang Nie, Anwa Zhou
openaire +2 more sources
Spectral Algorithms for Tensor Completion [PDF]
In the tensor completion problem, one seeks to estimate a low‐rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed a large gap between estimation with unbounded computational resources (using, for instance, tensor nuclear norm minimization) and polynomial‐time algorithms. Among the latter,
Andrea Montanari, Nike Sun
openaire +3 more sources
A parallel multi‐block alternating direction method of multipliers for tensor completion
This paper proposes an algorithm for the tensor completion problem of estimating multi‐linear data under the limitation of observation rate. Many tensor completion methods are based on nuclear norm minimization, they may fail to achieve the global ...
Hu Zhu +5 more
doaj +1 more source
Structural-Missing Tensor Completion for Robust DOA Estimation with Sensor Failure
Array sensor failure poses a serious challenge to robust direction-of-arrival (DOA) estimation in complicated environments. Although existing matrix completion methods can successfully recover the damaged signals of an impaired sensor array, they cannot ...
Bin Li +4 more
doaj +1 more source
Dehomogenization for completely positive tensors
25 ...
Nie, Jiawang +3 more
openaire +2 more sources
Image Completion in Embedded Space Using Multistage Tensor Ring Decomposition
Tensor Completion is an important problem in big data processing. Usually, data acquired from different aspects of a multimodal phenomenon or different sensors are incomplete due to different reasons such as noise, low sampling rate or human mistake.
Farnaz Sedighin +3 more
doaj +1 more source
Tensor Completion in Hierarchical Tensor Representations [PDF]
Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the reconstruction of tensors of low multi-linear rank in recently introduced hierarchical tensor formats from a small number ...
Holger Rauhut +2 more
openaire +3 more sources
A New Model for Tensor Completion: Smooth Convolutional Tensor Factorization
Tensor completion is the problem of filling-in missing parts of multidimensional data using the values of the reference elements. Recently, Multiway Delay-embedding Transform (MDT), which considers a low-dimensional space in a delay-embedded space with ...
Hiromu Takayama, Tatsuya Yokota
doaj +1 more source
Deterministic Tensor Completion with Hypergraph Expanders
We provide a novel analysis of low-rank tensor completion based on hypergraph expanders. As a proxy for rank, we minimize the max-quasinorm of the tensor, which generalizes the max-norm for matrices. Our analysis is deterministic and shows that the number of samples required to approximately recover an order-$t$ tensor with at most $n$ entries per ...
Kameron Decker Harris, Yizhe Zhu
openaire +2 more sources
Tensor Completion Made Practical
NeurIPS ...
Allen Liu, Ankur Moitra
openaire +3 more sources

