Research map / Learning theory and algorithms / Matrix and tensor methods

Nonconvex Low-Rank Tensor Completion from Noisy Data

NeurIPS 2019 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank tensor completion

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality (ICML 2020 · similarity 0.94)
• Efficient Nonconvex Regularized Tensor Completion with Structure-aware Proximal Iterations (ICML 2019 · similarity 0.91)
• Low-Rank Tensor Completion With a New Tensor Nuclear Norm Induced by Invertible Linear Transforms (CVPR 2019 · similarity 0.91)
• A Dual Framework for Low-rank Tensor Completion (NeurIPS 2018 · similarity 0.90)
• Fast Tensor Completion via Approximate Richardson Iteration (ICML 2025 · similarity 0.90)
• Non-Convex Tensor Recovery from Local Measurements (AAAI 2025 · similarity 0.90)