Exponential family tensor completion with auxiliary information
From MaRDI portal
Publication:6541587
DOI10.1002/sta4.296MaRDI QIDQ6541587
Publication date: 19 May 2024
Published in: Stat (Search for Journal in Brave)
penalized likelihoodtensor completionexponential family modeltensor factorizationgeneralized linear modelling
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- On tensor completion via nuclear norm minimization
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Cross: efficient low-rank tensor completion
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Tensor factorization using auxiliary information
- Exact matrix completion via convex optimization
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Tensor rank is NP-complete
- Poisson Matrix Recovery and Completion
- Exact Tensor Completion Using t-SVD
- Tensor Decomposition for Signal Processing and Machine Learning
- On Tensors, Sparsity, and Nonnegative Factorizations
- 1-Bit matrix completion
- Generalized Canonical Polyadic Tensor Decomposition
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
This page was built for publication: Exponential family tensor completion with auxiliary information