Variational Bayesian inference for CP tensor completion with subspace information
From MaRDI portal
Publication:6180798
DOI10.1134/s1995080223080103OpenAlexW4389103007MaRDI QIDQ6180798
Stanislav S. Budzinskiy, Nikolai L. Zamarashkin
Publication date: 22 January 2024
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080223080103
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Low-rank tensor completion by Riemannian optimization
- Tensor factorization using auxiliary information
- Stable als approximation in the TT-format for rank-adaptive tensor completion
- Exact matrix completion via convex optimization
- Riemannian Optimization for High-Dimensional Tensor Completion
- Robust principal component analysis?
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format
- Tensor Completion in Hierarchical Tensor Representations
- Sparse Bayesian Methods for Low-Rank Matrix Estimation
- Rank Regularization and Bayesian Inference for Tensor Completion and Extrapolation
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Smooth PARAFAC Decomposition for Tensor Completion
- Fast Low-Rank Bayesian Matrix Completion With Hierarchical Gaussian Prior Models
- Tensor Decomposition for Signal Processing and Machine Learning
- Sparse Cholesky Factorization by Kullback--Leibler Minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Compressed sensing
- Tensor train completion: Local recovery guarantees via Riemannian optimization
This page was built for publication: Variational Bayesian inference for CP tensor completion with subspace information
