Screen LibraryTensor networks for dimensionality reduction and large-scale optimization. Part 1, Low-rank tensor decompositions /
Modern applications in engineering and data science are increasingly based on multidimensional data of exceedingly high volume, variety, and structural richness. However, standard machine learning algorithms typically scale exponentially with data volume and complexity of cross-modal couplings - the...
Saved in:
| Main Authors: | |
|---|---|
| Published: |
Now Publishers,
|
| Publisher Address: | Hanover, Massachusetts : |
| Publication Dates: | [2017] |
| Literature type: | Book |
| Language: | English |
| Series: |
Foundations and trends in machine learning,
volume 9, issue 4-5 |
| Subjects: | |
| Summary: |
Modern applications in engineering and data science are increasingly based on multidimensional data of exceedingly high volume, variety, and structural richness. However, standard machine learning algorithms typically scale exponentially with data volume and complexity of cross-modal couplings - the so called curse of dimensionality - which is prohibitive to the analysis of large-scale, multi-modal and multi-relational datasets. Given that such data are often efficiently represented as multiway arrays or tensors, it is therefore timely and valuable for the multidisciplinary machine learning and data analytic communities to review low-rank tensor decompositions and tensor networks as emerging tools for dimensionality reduction and large scale optimization problems. Our particular emphasis is on elucidating that, by virtue of the underlying low-rank approximations, tensor networks have the ability to alleviate the curse of dimensionality in a number of applied areas. In Part 1 of this monograph we provide innovative solutions to low-rank tensor network decompositions and easy to interpret graphical representations of the mathematical operations on tensor networks. Such a conceptual insight allows for seamless migration of ideas from the flat-view matrices to tensor network operations and vice versa, and provides a platform for further developments, practical applications, and non-Euclidean extensions. It also permits the introduction of various tensor network operations without an explicit notion of mathematical expressions, which may be beneficial for many research communities that do not directly rely on multilinear algebra. Our focus is on the Tucker and tensor train (TT) decompositions and their extensions, and on demonstrating the ability of tensor networks to provide linearly or even super-linearly (e.g., logarithmically) scalable solutions, as illustrated in detail in Part 2 of this monograph. |
| Carrier Form: | x, 184 pages : illustrations (chiefly color) ; 23 cm. |
| Bibliography: | Includes bibliographical references (pages 165-184). |
| ISBN: |
9781680832228 1680832220 |
| Index Number: | QA322 |
| CLC: | O183.2 |
| Call Number: | O183.2/C568/pt.1 |