Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Nonconvex Low-Rank Tensor Completion from Noisy Data

scientific article; zbMATH DE number 7534840

Language	Label	Description	Also known as
default for all languages	No label defined
English	Nonconvex Low-Rank Tensor Completion from Noisy Data	scientific article; zbMATH DE number 7534840

Statements

instance of

scholarly article

0 references

title

Nonconvex Low-Rank Tensor Completion from Noisy Data (English)

0 references

0 references

0 references

0 references

0 references

0 references

31 May 2022

0 references

full work available at URL

https://arxiv.org/abs/1911.04436

0 references

zbMATH Keywords

nonconvex optimization

0 references

low-rank tensor completion

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Entrywise eigenvector analysis of random matrices with low expected rank

0 references

Tensor decompositions for learning latent variable models

0 references

Fundamental conditions for low-CP-rank tensor completion

0 references

Convex optimization: algorithms and complexity

0 references

Subspace estimation from unbalanced and incomplete data matrices: ${\ell_{2,\infty}}$ statistical guarantees

0 references

Exact matrix completion via convex optimization

0 references

Phase retrieval via Wirtinger flow: theory and algorithms

0 references

Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems

0 references

Robust Spectral Compressed Sensing via Structured Matrix Completion

0 references

Non-convex projected gradient descent for generalized low-rank tensor regression

0 references

Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval

0 references

Spectral method and regularized MLE are both optimal for top-$K$ ranking

0 references

Inference and uncertainty quantification for noisy matrix completion

0 references

Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators

0 references

Tensor completion and low-$n$-rank tensor recovery via convex optimization

0 references

Robust low-rank tensor recovery: models and algorithms

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Sparse and Low-Rank Tensor Estimation via Cubic Sketchings

0 references

Most tensor problems are NP-hard

0 references

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

0 references

Q2941674

0 references

Tensor completion using total variation and low-rank matrix factorization

0 references

Matrix Completion From a Few Entries

0 references

Matrix completion from noisy entries

0 references

Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging

0 references

Orthogonal tensor decompositions

0 references

Tensor Decompositions and Applications

0 references

The non-convex geometry of low-rank matrix optimization

0 references

High-dimensional covariance matrix estimation with missing observations

0 references

Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution

0 references

Spectral algorithms for tensor completion

0 references

Low rank tensor recovery via iterative hard thresholding

0 references

Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography

0 references

Tensor Decomposition for Signal Processing and Machine Learning

0 references

Riemannian optimization for high-dimensional tensor completion

0 references

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

Provable sparse tensor decomposition

0 references

A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion

0 references

Parallel matrix factorization for low-rank tensor completion

0 references

Hankel Matrix Nuclear Norm Regularized Tensor Completion for $N$-dimensional Exponential Signals

0 references

On tensor completion via nuclear norm minimization

0 references

Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion

0 references

Cross: efficient low-rank tensor completion

0 references

Exact Tensor Completion Using t-SVD

0 references

Tensor SVD: Statistical and Computational Limits

0 references

Near-optimal bounds for phase synchronization

0 references

Robust statistics for signal processing

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1287/OPRE.2021.2106

0 references

Sitelinks

Mathematics(1 entry)

mardi Nonconvex Low-Rank Tensor Completion from Noisy Data