The condition number of many tensor decompositions is invariant under Tucker compression
From MaRDI portal
Publication:6047573
DOI10.1007/s11075-023-01526-9zbMath1523.65040arXiv2106.13034OpenAlexW3174749187MaRDI QIDQ6047573
Paul Breiding, Nick Dewaele, Nick Vannieuwenhoven
Publication date: 12 September 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.13034
Numerical computation of matrix norms, conditioning, scaling (65F35) Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- The geometry of algorithms using hierarchical tensors
- Multilinear algebra. 2nd ed
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- On the identifiability of ternary forms
- A new scheme for the tensor representation
- Condition numbers for the tensor rank decomposition
- Orthogonal Tensor Decompositions
- Condition
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- Introduction to Smooth Manifolds
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Julia: A Fresh Approach to Numerical Computing
- Hierarchical Singular Value Decomposition of Tensors
- A Multilinear Singular Value Decomposition
- The Condition Number of Join Decompositions
- Tensor Decomposition for Signal Processing and Machine Learning
- SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains
- The Structured Condition Number of a Differentiable Map between Matrix Manifolds, with Applications
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- A Theory of Condition
- The Condition Number of Riemannian Approximation Problems
This page was built for publication: The condition number of many tensor decompositions is invariant under Tucker compression