One-dimensional tensor network recovery

DOI10.1137/23M159888XMaRDI QIDQ6577446zbMATH OpenFDO

Authors Ziang Chen, Jianfeng Lu, Anru Zhang

Publication date 23 July 2024

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/23M159888X

zbMATH Keywords

almost-sure correctnesspermutation recoveryrobustness against noisetensor ringtensor train

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Computer aspects of numerical algorithms (65Y99)

Recommendations

• Recovery algorithms for high-dimensional rank one tensors
• RIP-based performance guarantee for low-tubal-rank tensor recovery
• Recovering orthogonal tensors under arbitrarily strong, but locally correlated, noise
• Low rank tensor recovery via iterative hard thresholding
• Iterative singular tube hard thresholding algorithms for tensor recovery

Cites work

• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• Dynamical approximation by hierarchical Tucker and tensor-train tensors
• Efficient construction of tensor ring representations from sampling
• Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• High-dimensional density estimation with tensorizing flow
• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• Inversion symmetry of singular values and a new orbital ordering method in tensor train approximations for quantum chemistry
• Learning polynomial transformations via generalized tensor decompositions
• Local operator theory, random matrices and Banach spaces.
• Non-asymptotic theory of random matrices: extreme singular values
• Optimal High-Order Tensor SVD via Tensor-Train Orthogonal Iteration
• Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
• Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
• Tensor ring decomposition: optimization landscape and one-loop convergence of alternating least squares
• Tensor-train decomposition
• The alternating linear scheme for tensor optimization in the tensor train format
• The density-matrix renormalization group in the age of matrix product states
• Tree adaptive approximation in the hierarchical tensor format

Cited in

(1)

• Matrix recovery from permutations

This page was built for publication: One-dimensional tensor network recovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577446)