Pages that link to "Item:Q2007852"
From MaRDI portal
The following pages link to On polynomial time methods for exact low-rank tensor completion (Q2007852):
Displaying 14 items.
- Statistical inference for structured high-dimensional models. Abstracts from the workshop held March 11--17, 2018 (Q1731980) (← links)
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
- Community detection on mixture multilayer networks via regularized tensor decomposition (Q2073701) (← links)
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion (Q2095166) (← links)
- An optimal statistical and computational framework for generalized tensor estimation (Q2119217) (← links)
- Inference for low-rank tensors -- no need to debias (Q2131273) (← links)
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries (Q2656588) (← links)
- Low-Rank Approximation and Completion of Positive Tensors (Q2827064) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- Deterministic Tensor Completion with Hypergraph Expanders (Q5162629) (← links)
- The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising (Q5381114) (← links)
- Factor Models for High-Dimensional Tensor Time Series (Q5881065) (← links)
- Tensor completion by multi-rank via unitary transformation (Q6042617) (← links)
- Robust Low-Rank Tensor Decomposition with the L <sub>2</sub> Criterion (Q6631163) (← links)
