Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
From MaRDI portal
(Redirected from Publication:4593746)
Abstract: Part 2 of this monograph builds on the introduction to tensor networks and their operations presented in Part 1. It focuses on tensor network models for super-compressed higher-order representation of data/parameters and related cost functions, while providing an outline of their applications in machine learning and data analytics. A particular emphasis is on the tensor train (TT) and Hierarchical Tucker (HT) decompositions, and their physically meaningful interpretations which reflect the scalability of the tensor network approach. Through a graphical approach, we also elucidate how, by virtue of the underlying low-rank tensor approximations and sophisticated contractions of core tensors, tensor networks have the ability to perform distributed computations on otherwise prohibitively large volumes of data/parameters, thereby alleviating or even eliminating the curse of dimensionality. The usefulness of this concept is illustrated over a number of applied areas, including generalized regression and classification (support tensor machines, canonical correlation analysis, higher order partial least squares), generalized eigenvalue decomposition, Riemannian optimization, and in the optimization of deep neural networks. Part 1 and Part 2 of this work can be used either as stand-alone separate texts, or indeed as a conjoint comprehensive review of the exciting field of low-rank tensor networks and tensor decompositions.
Recommendations
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Tensor networks in machine learning
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- Tensor neural network models for tensor singular value decompositions
- scientific article; zbMATH DE number 5302704
- On the optimization landscape of tensor decompositions
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Tensor Methods for Large, Sparse Unconstrained Optimization
- Tensor principal component analysis via convex optimization
Cited in
(33)- Optimization problems in contracted tensor networks
- Hybrid tensor decomposition in neural network compression
- Correlation length in random MPS and PEPS
- Learning with tree tensor networks: complexity estimates and model selection
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- An efficient algorithm for computing the approximate t-URV and its applications
- MERACLE: constructive layer-wise conversion of a tensor train into a MERA
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds
- scientific article; zbMATH DE number 5302704 (Why is no real title available?)
- Computing low-rank approximations of large-scale matrices with the tensor network randomized SVD
- Towards compact neural networks via end-to-end training: a Bayesian tensor approach with automatic rank determination
- Alternating Linear Scheme in a Bayesian Framework for Low-Rank Tensor Approximation
- A Low-Rank Matrix Equation Method for Solving PDE-Constrained Optimization Problems
- A TT-based hierarchical framework for decomposing high-order tensors
- Time-homogeneous top-\(K\) ranking using tensor decompositions
- Frobenius norm inequalities of commutators based on different products
- Approximation theory of tree tensor networks: tensorized univariate functions
- An efficient randomized fixed-precision algorithm for tensor singular value decomposition
- Geometry of tree-based tensor formats in tensor Banach spaces
- Black Box Approximation in the Tensor Train Format Initialized by ANOVA Decomposition
- A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes
- Tensor networks in machine learning
- Gauging tensor networks with belief propagation
- Representation theorems for matrix product states
- Frequency-aware tensor network decomposition for multi-dimensional image recovery
- Efficient algorithms for Tucker decomposition via approximate matrix multiplication
- Generative learning of continuous data by tensor networks
- Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition
- Group sparse-based tensor CP decomposition: model, algorithm, and applications in chemometrics
- Symplectic QTT-FEM solution of the one-dimensional acoustic wave equation in the time domain
- Fundamental tensor operations for large-scale data analysis using tensor network formats
This page was built for publication: Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593746)
