Efficient Tensor Decompositions

DOI10.1017/9781108637435.025MaRDI QIDQ5027285zbMATH OpenOpenAlexFDO

Authors Aravindan Vijayaraghavan

Publication date 4 February 2022

Full work available at URL https://arxiv.org/abs/2007.15589, https://www.cambridge.org/core/books/beyond-the-worstcase-analysis-of-algorithms/efficient-tensor-decompositions/01408BCD69082E4BA20AD55BFDF70CB4

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Spectral learning on matrices and tensors
• Smoothed analysis of tensor decompositions
• Decomposing overcomplete 3rd order tensors using sum-of-squares algorithms
• Smoothed analysis for tensor methods in unsupervised learning
• scientific article; zbMATH DE number 1820149

Cited in

(14)

• An algorithm to simplify tensor expressions
• Faster tensor train decomposition for sparse data
• On the optimization landscape of tensor decompositions
• Efficient Computation of Higher-Order Cumulant Tensors
• Recursive fast algorithm and the role of the tensor product
• scientific article; zbMATH DE number 1225903 (Why is no real title available?)
• Efficient vector and parallel manipulation of tensor products
• High-Performance Tensor Contraction without Transposition
• Exploiting Efficient Representations in Large-Scale Tensor Decompositions
• A Practical Randomized CP Tensor Decomposition
• scientific article; zbMATH DE number 7368657 (Why is no real title available?)
• Parallel Algorithms for Computing the Tensor-Train Decomposition
• xPerm: fast index canonicalization for tensor computer algebra
• Tensor Decompositions and Applications

This page was built for publication: Efficient Tensor Decompositions

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