atlas

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

Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality

ICML 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank tensor completion · 9 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use data-driven plug-in variance estimates from residuals and the estimated tensor factorsNonconvex tensor completion · Synthetic tensor completion, tensor-factor entries95% confidence-interval coverage: 0.9481; 0.9477; 0.9478; 0.9450; 0.9472; 0.9462No clear effect
Use data-driven plug-in variance estimates from residuals and the estimated tensor factorsNonconvex tensor completion · Synthetic tensor completion, tensor entries95% confidence-interval coverage: 0.9494; 0.9513; 0.9475; 0.9434; 0.9494; 0.9494No clear effect
Use nonconvex completion with the proposed estimatorTensor factors and completed tensor · Noisy tensor completion under i.i.d. Gaussian noiseℓ2 estimation risk: 2+o(1); 6+o(1)Helped
Adapt confidence intervals to local noise levels using residual-based variance estimatesNonconvex tensor completion · Heteroscedastic tensor completionconfidence-interval validityHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy