Tensor completion with noisy side information
From MaRDI portal
Matrix completion problems (15A83) Linear regression; mixed models (62J05) Applications of statistics to biology and medical sciences; meta analysis (62P10) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Learning and adaptive systems in artificial intelligence (68T05)
Recommendations
- Cross: efficient low-rank tensor completion
- Tensor completion via bilevel minimization with fixed-point constraint to estimate missing elements in noisy data
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- Tucker factorization with missing data with application to low-n-rank tensor completion
Cites work
- A Singular Value Thresholding Algorithm for Matrix Completion
- Convex coupled matrix and tensor completion
- Exact matrix completion via convex optimization
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Low-rank matrix completion using alternating minimization
- Non-convex projected gradient descent for generalized low-rank tensor regression
- Spectral regularization algorithms for learning large incomplete matrices
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor Decompositions and Applications
- Tensor factorization using auxiliary information
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
This page was built for publication: Tensor completion with noisy side information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053809)
