Cross: efficient low-rank tensor completion
From MaRDI portal
Applications of statistics to biology and medical sciences; meta analysis (62P10) Estimation in multivariate analysis (62H12) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Minimax procedures in statistical decision theory (62C20) Image analysis in multivariate analysis (62H35) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Abstract: The completion of tensors, or high-order arrays, attracts significant attention in recent research. Current literature on tensor completion primarily focuses on recovery from a set of uniformly randomly measured entries, and the required number of measurements to achieve recovery is not guaranteed to be optimal. In addition, the implementation of some previous methods is NP-hard. In this article, we propose a framework for low-rank tensor completion via a novel tensor measurement scheme we name Cross. The proposed procedure is efficient and easy to implement. In particular, we show that a third order tensor of Tucker rank- in -by--by- dimensional space can be recovered from as few as noiseless measurements, which matches the sample complexity lower-bound. In the case of noisy measurements, we also develop a theoretical upper bound and the matching minimax lower bound for recovery error over certain classes of low-rank tensors for the proposed procedure. The results can be further extended to fourth or higher-order tensors. Simulation studies show that the method performs well under a variety of settings. Finally, the procedure is illustrated through a real dataset in neuroimaging.
Recommendations
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- On polynomial time methods for exact low-rank tensor completion
- Low-rank tensor completion by Riemannian optimization
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tucker factorization with missing data with application to low-n-rank tensor completion
Cites work
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- A simpler approach to matrix completion
- A statistical multiscale framework for Poisson inverse problems
- Bayesian tensor regression
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Cross: efficient low-rank tensor completion
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Estimation of high-dimensional low-rank matrices
- Generalizing the column-row matrix decomposition to multi-way arrays
- Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
- Learning Theory
- Low rank tensor recovery via iterative hard thresholding
- Low-rank tensor completion by Riemannian optimization
- Matrix Completion From a Few Entries
- Matrix completion via max-norm constrained optimization
- Minimax Optimal Rates for Poisson Inverse Problems With Physical Constraints
- Most tensor problems are NP-hard
- Noisy low-rank matrix completion with general sampling distribution
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- Noisy tensor completion via the sum-of-squares hierarchy
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- On tensor completion via nuclear norm minimization
- Poisson Matrix Recovery and Completion
- Provable sparse tensor decomposition
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Sampling from large matrices
- Stable, Robust, and Super Fast Reconstruction of Tensors Using Multi-Way Projections
- Tensor Decompositions and Applications
- Tensor Regression with Applications in Neuroimaging Data Analysis
- Tensor SVD: Statistical and Computational Limits
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor decompositions and sparse log-linear models
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Tensor-CUR Decompositions for Tensor-Based Data
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Tighter low-rank approximation via sampling the leveraged element
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
Cited in
(31)- Deterministic tensor completion with hypergraph expanders
- Model-Based Tensor Low-Rank Clustering
- Parsimonious Tensor Discriminant Analysis
- Covariate-Assisted Sparse Tensor Completion
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Rank determination in tensor factor model
- On polynomial time methods for exact low-rank tensor completion
- Tensor completion by multi-rank via unitary transformation
- scientific article; zbMATH DE number 7370581 (Why is no real title available?)
- An optimal statistical and computational framework for generalized tensor estimation
- Inference for low-rank tensors -- no need to debias
- Smoothed tensor quantile regression estimation for longitudinal data
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- High-Dimensional Vector Autoregressive Time Series Modeling via Tensor Decomposition
- Matrix completion from a computational statistics perspective
- Tensor completion with noisy side information
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- Tensor envelope mixture model for simultaneous clustering and multiway dimension reduction
- Dynamic tensor clustering
- Cross
- An approximation method of CP rank for third-order tensor completion
- scientific article; zbMATH DE number 7415122 (Why is no real title available?)
- Robust Low-Rank Tensor Decomposition with the L 2 Criterion
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Statistical inference on the significance of rows and columns for matrix-valued data in an additive model
- Constructing low-rank Tucker tensor approximations using generalized completion
- Factor Models for High-Dimensional Tensor Time Series
- Community detection on mixture multilayer networks via regularized tensor decomposition
- Partially Observed Dynamic Tensor Response Regression
- Cross: efficient low-rank tensor completion
- Exponential family tensor completion with auxiliary information
This page was built for publication: Cross: efficient low-rank tensor completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1731066)
