Efficient Construction of Tensor Ring Representations from Sampling

DOI10.1137/17M1154382zbMath1468.65014arXiv1711.00954OpenAlexW3188746896MaRDI QIDQ5006479

Yuehaw Khoo, Lexing Ying, Jian-feng Lu

Publication date: 16 August 2021

Published in: Multiscale Modeling & Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.00954

zbMATH Keywords

randomized algorithmfunction approximationtensor decompositionstensor train

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Multilinear algebra, tensor calculus (15A69)

Related Items (4)

Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion ⋮ Generative modeling via tree tensor network states ⋮ Generative modeling via tensor train sketching ⋮ Provable stochastic algorithm for large-scale fully-connected tensor network decomposition

Cites Work

• Unnamed Item
• Tensor-Train Decomposition
• TT-cross approximation for multidimensional arrays
• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• On tensor completion via nuclear norm minimization
• A note on tensor chain approximation
• Spectral gap and exponential decay of correlations
• Exponential decay of correlations implies area law
• Exact matrix completion via convex optimization
• Area Laws in Quantum Systems: Mutual Information and Correlations
• Fast low rank approximations of matrices and tensors
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Solving parametric PDE problems with artificial neural networks

This page was built for publication: Efficient Construction of Tensor Ring Representations from Sampling