Pages that link to "Item:Q4962471"

The following pages link to Spectral Algorithms for Tensor Completion (Q4962471):

Displaying 17 items.

• On polynomial time methods for exact low-rank tensor completion (Q2007852) (← links)
• Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
• Sparse random tensors: concentration, regularization and applications (Q2044387) (← links)
• An \({\ell_p}\) theory of PCA and spectral clustering (Q2091846) (← links)
• An optimal statistical and computational framework for generalized tensor estimation (Q2119217) (← links)
• Inference for low-rank tensors -- no need to debias (Q2131273) (← links)
• Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
• Statistically optimal and computationally efficient low rank tensor completion from noisy entries (Q2656588) (← links)
• Quantized Compressed Sensing: A Survey (Q3296175) (← links)
• ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
• Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674) (← links)
• Deterministic Tensor Completion with Hypergraph Expanders (Q5162629) (← links)
• Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces (Q5230191) (← links)
• Tensor completion by multi-rank via unitary transformation (Q6042617) (← links)
• Marchenko–Pastur law with relaxed independence conditions (Q6063726) (← links)
• Inference for heteroskedastic PCA with missing data (Q6550970) (← links)
• Sparse random hypergraphs: non-backtracking spectra and community detection (Q6663351) (← links)