Variational Bayesian inference for CP tensor completion with subspace information
From MaRDI portal
Publication:6180798
DOI10.1134/S1995080223080103OpenAlexW4389103007MaRDI QIDQ6180798FDOQ6180798
Authors: Stanislav S. Budzinskiy, N. 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
Recommendations
- Low-rank tensor completion by Riemannian optimization
- Low-CP-rank tensor completion via practical regularization
- Recovering low CP/Tucker ranked tensors, with applications in tensor completion
- Tensor completion using total variation and low-rank matrix factorization
- Matrix factorization for low-rank tensor completion using framelet prior
Cites Work
- Robust principal component analysis?
- Tensor Decompositions and Applications
- Exact matrix completion via convex optimization
- Sparse Bayesian Methods for Low-Rank Matrix Estimation
- Fast Low-Rank Bayesian Matrix Completion With Hierarchical Gaussian Prior Models
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Tensor-train decomposition
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Compressed sensing
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Variational message passing
- Low-rank tensor completion by Riemannian optimization
- Tensor completion in hierarchical tensor representations
- Tensor Decomposition for Signal Processing and Machine Learning
- Stable als approximation in the TT-format for rank-adaptive tensor completion
- Riemannian optimization for high-dimensional tensor completion
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Smooth PARAFAC Decomposition for Tensor Completion
- Tensor factorization using auxiliary information
- Variants of alternating least squares tensor completion in the tensor train format
- Sparse Cholesky Factorization by Kullback--Leibler Minimization
- Rank Regularization and Bayesian Inference for Tensor Completion and Extrapolation
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180798)
