Tensor Q-rank: new data dependent definition of tensor rank
From MaRDI portal
Publication:2071330
DOI10.1007/s10994-021-05987-8OpenAlexW3173732000MaRDI QIDQ2071330
Canyi Lu, Zhouchen Lin, Hao Kong
Publication date: 28 January 2022
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.12016
Related Items
Nonlinear transform induced tensor nuclear norm for tensor completion ⋮ An efficient algorithm for computing the approximate t-URV and its applications ⋮ A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion ⋮ Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD ⋮ Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
Uses Software
Cites Work
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Tensor Decompositions and Applications
- Parallel matrix factorization for low-rank tensor completion
- On tensor completion via nuclear norm minimization
- Factorization strategies for third-order tensors
- Tensor-tensor products with invertible linear transforms
- Matrix factorization for low-rank tensor completion using framelet prior
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- A framelet-based image inpainting algorithm
- Exact matrix completion via convex optimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Tensor rank is NP-complete
- Robust tensor completion using transformed tensor singular value decomposition
- The Geometry of Algorithms with Orthogonality Constraints
- Nuclear norm of higher-order tensors
- Tensor Factorization for Low-Rank Tensor Completion
- Exact Tensor Completion Using t-SVD
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
- Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Most Tensor Problems Are NP-Hard
This page was built for publication: Tensor Q-rank: new data dependent definition of tensor rank
