Nonconvex Low-Rank Tensor Completion from Noisy Data
From MaRDI portal
Recommendations
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- A non-convex tensor rank approximation for tensor completion
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- Noisy tensor completion via the sum-of-squares hierarchy
- Low rank non-negative triple decomposition and non-negative tensor completion
- Tensor completion using total variation and low-rank matrix factorization
- Sparse Nonnegative Tensor Factorization and Completion With Noisy Observations
- Low-rank tensor completion by Riemannian optimization
Cites work
- scientific article; zbMATH DE number 6474942 (Why is no real title available?)
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- Convex optimization: algorithms and complexity
- Cross: efficient low-rank tensor completion
- Entrywise eigenvector analysis of random matrices with low expected rank
- Exact Tensor Completion Using t-SVD
- Exact matrix completion via convex optimization
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- Fundamental conditions for low-CP-rank tensor completion
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Guaranteed Matrix Completion via Non-Convex Factorization
- Hankel Matrix Nuclear Norm Regularized Tensor Completion for N-dimensional Exponential Signals
- High-dimensional covariance matrix estimation with missing observations
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
- Inference and uncertainty quantification for noisy matrix completion
- Low rank tensor recovery via iterative hard thresholding
- Matrix Completion From a Few Entries
- Matrix completion from noisy entries
- Most tensor problems are NP-hard
- Near-optimal bounds for phase synchronization
- Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
- Non-convex projected gradient descent for generalized low-rank tensor regression
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- On tensor completion via nuclear norm minimization
- On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators
- Orthogonal tensor decompositions
- Parallel matrix factorization for low-rank tensor completion
- Phase retrieval via Wirtinger flow: theory and algorithms
- Provable sparse tensor decomposition
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Riemannian optimization for high-dimensional tensor completion
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- Robust low-rank tensor recovery: models and algorithms
- Robust statistics for signal processing
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Sparse and Low-Rank Tensor Estimation via Cubic Sketchings
- Spectral algorithms for tensor completion
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor SVD: Statistical and Computational Limits
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor completion using total variation and low-rank matrix factorization
- Tensor decompositions for learning latent variable models
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- The non-convex geometry of low-rank matrix optimization
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
Cited in
(33)- How to iron out rough landscapes and get optimal performances: averaged gradient descent and its application to tensor PCA
- Tensor methods for nonlinear matrix completion
- Robust tensor completion: equivalent surrogates, error bounds, and algorithms
- Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization
- Change Point Detection in Dynamic Networks via Regularized Tensor Decomposition
- Estimating Higher-Order Mixed Memberships via the l2,∞ Tensor Perturbation Bound
- Iterative algorithm for the symmetric and nonnegative tensor completion problem
- Non-convex projected gradient descent for generalized low-rank tensor regression
- Covariate-Assisted Sparse Tensor Completion
- On polynomial time methods for exact low-rank tensor completion
- scientific article; zbMATH DE number 6474942 (Why is no real title available?)
- The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising
- Noisy tensor completion via the sum-of-squares hierarchy
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Recovering orthogonal tensors under arbitrarily strong, but locally correlated, noise
- Stochastic Low-Rank Tensor Bandits for Multi-Dimensional Online Decision Making
- Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
- An optimal statistical and computational framework for generalized tensor estimation
- Low-rank approximation and completion of positive tensors
- Deflated HeteroPCA: overcoming the curse of ill-conditioning in heteroskedastic PCA
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- Fast and Provable Tensor Robust Principal Component Analysis via Scaled Gradient Descent
- Tensor completion with noisy side information
- Nonconvex optimization for third‐order tensor completion under wavelet transform
- Statistical mechanics of low-rank tensor decomposition
- A non-convex tensor rank approximation for tensor completion
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- Variational, Geometric, and Level Set Methods in Computer Vision
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
- Conformalized Tensor Completion with Riemannian Optimization
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
- Sparse random hypergraphs: non-backtracking spectra and community detection
- Inference for heteroskedastic PCA with missing data
This page was built for publication: Nonconvex Low-Rank Tensor Completion from Noisy Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080674)
