Exponential family tensor completion with auxiliary information
From MaRDI portal
Publication:6541587
DOI10.1002/STA4.296MaRDI QIDQ6541587FDOQ6541587
Authors: Jichen Yang, Nan Zhang 
Publication date: 19 May 2024
Published in: Stat (Search for Journal in Brave)
penalized likelihoodtensor completionexponential family modeltensor factorizationgeneralized linear modelling
Cites Work
- Cross: efficient low-rank tensor completion
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Gaussian processes for machine learning.
- Title not available (Why is that?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- 1-bit matrix completion
- Tensor Decompositions and Applications
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Exact matrix completion via convex optimization
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Tensor-train decomposition
- Poisson Matrix Recovery and Completion
- On Tensors, Sparsity, and Nonnegative Factorizations
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Tensor rank is NP-complete
- On tensor completion via nuclear norm minimization
- Tensor Decomposition for Signal Processing and Machine Learning
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Exact Tensor Completion Using t-SVD
- Tensor factorization using auxiliary information
- Generalized canonical polyadic tensor decomposition
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)
