Exponential family tensor completion with auxiliary information
From MaRDI portal
Publication:6541587
Cites work
- scientific article; zbMATH DE number 6734253 (Why is no real title available?)
- 1-bit matrix completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- Cross: efficient low-rank tensor completion
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exact Tensor Completion Using t-SVD
- Exact matrix completion via convex optimization
- Gaussian processes for machine learning.
- Generalized canonical polyadic tensor decomposition
- Global convergence of ADMM in nonconvex nonsmooth optimization
- On Tensors, Sparsity, and Nonnegative Factorizations
- On tensor completion via nuclear norm minimization
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Poisson Matrix Recovery and Completion
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor factorization using auxiliary information
- Tensor rank is NP-complete
- Tensor-train decomposition
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
This page was built for publication: Exponential family tensor completion with auxiliary information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541587)
