On approximation algorithm for orthogonal low-rank tensor approximation
From MaRDI portal
Publication:2159448
Abstract: The goal of this work is to fill a gap in [Yang, SIAM J. Matrix Anal. Appl, 41 (2020), 1797--1825]. In that work, an approximation procedure was proposed for orthogonal low-rank tensor approximation; however, the approximation lower bound was only established when the number of orthonormal factors is one. To this end, by further exploring the multilinearity and orthogonality of the problem, we introduce a modified approximation algorithm. Approximation lower bound is established, either in deterministic or expected sense, no matter how many orthonormal factors there are. In addition, a major feature of the new algorithm is its flexibility to allow either deterministic or randomized procedures to solve a key step of each latent orthonormal factor involved in the algorithm. This feature can reduce the computation of large SVDs, making the algorithm more efficient. Some numerical studies are provided to validate the usefulness of the proposed algorithm.
Recommendations
- Numerical computation for orthogonal low-rank approximation of tensors
- A convergence analysis for an algorithm computing a symmetric low rank orthogonal approximation of a symmetric tensor
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- Orthogonal low-rank approximation to third-order tensors with automatic rank estimation
- Randomized algorithms for the low multilinear rank approximations of tensors
Cites work
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- A Multilinear Singular Value Decomposition
- A new truncation strategy for the higher-order singular value decomposition
- A randomized tensor singular value decomposition based on the t-product.
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Blind Multilinear Identification
- Canonical polyadic decomposition with a columnwise orthonormal factor matrix
- Computing the Polar Decomposition—with Applications
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Hierarchical Singular Value Decomposition of Tensors
- Independent component analysis, a new concept?
- Local convergence of the alternating least squares algorithm for canonical tensor approximation
- Numerical computation for orthogonal low-rank approximation of tensors
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Orthogonal low rank tensor approximation: alternating least squares method and its global convergence
- Orthogonal tensor decompositions
- Probability bounds for polynomial functions in random variables
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Semialgebraic geometry of nonnegative tensor rank
- Semidefinite relaxations for best rank-1 tensor approximations
- Symmetric orthogonal approximation to symmetric tensors with applications to image reconstruction
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor principal component analysis via convex optimization
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- The best rank-one approximation ratio of a tensor space
- The cubic spherical optimization problems
- The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Cited in
(12)- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- A PTAS for ℓp-Low Rank Approximation
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
- News algorithms for tensor decomposition based on a reduced functional
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
- Numerical computation for orthogonal low-rank approximation of tensors
- Low-rank approximation of tensors via sparse optimization.
- A three-way Jordan canonical form as limit of low-rank tensor approximations
- A Review on Adaptive Low-Rank Approximation Techniques in the Hierarchical Tensor Format
- Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
- Orthogonal low-rank approximation to third-order tensors with automatic rank estimation
- Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors
This page was built for publication: On approximation algorithm for orthogonal low-rank tensor approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2159448)
