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.
Article navigation
19 December 2016
Research Article|
December 19 2016
Tensor Networks for Dimensionality Reduction and Large-Scale Optimization Part 1 Low-Rank Tensor Decompositions Available to Purchase
Andrzej Cichocki;
Andrzej Cichocki
RIKEN Brain Science Institute (BSI)
, Japan and Skolkovo Institute of Science and Technology (SKOLTECH)
Search for other works by this author on:
Ivan Oseledets;
Ivan Oseledets
Skolkovo Institute of Science
and Technology (SKOLTECH) and Institute of Numerical Mathematics of Russian Academy of Sciences
Search for other works by this author on:
Danilo P. Mandic
Danilo P. Mandic
Department of Electrical and Electronic Engineering Imperial College London
Search for other works by this author on:
Online ISSN: 1935-8245
Print ISSN: 1935-8237
© 2017 A. Cichocki et al.
2017
A. Cichocki et al.
Licensed re-use rights only
Foundations and Trends in Machine Learning (2016) 9 (4-5): 249–429.
Citation
Cichocki A, Lee N, Oseledets I, Phan A, Zhao Q, Mandic DP (2016), "Tensor Networks for Dimensionality Reduction and Large-Scale Optimization Part 1 Low-Rank Tensor Decompositions". Foundations and Trends in Machine Learning, Vol. 9 No. 4-5 pp. 249–429, doi: https://doi.org/10.1561/2200000059
Download citation file:
Suggested Reading
Permeability tensor for discontinuous rock masses
Geotechnique (December,1985)
Image analysis determination of stereology based fabric tensors
Geotechnique (August,1998)
Related Chapters
Appendix A. Octahedral formulation of stresses and strains
Structural concrete: Finite-element analysis for limit-state design
Geometrical characterization of rock joints in the Kamaishi mine, Japan
Rock Characterization: ISRM Symposium, Eurock '92, Chester, UK, 14–17 September 1992
19 The prediction of water flows through discontinuity networks into underground excavations
Design and Performance of Underground Excavations: ISRM Symposium — Cambridge, U.K., 3–6 September 1984
Recommended for you
These recommendations are informed by your reading behaviors and indicated interests.
