The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
Open accessAbstract
Machine learning and data mining algorithms are becoming increasingly important in analyzing large volume, multi-relational and multi--modal datasets, which are often conveniently represented as multiway arrays or tensors. It is therefore timely and valuable for the multidisciplinary research community to review tensor decompositions and tensor networks as emerging tools for large-scale data analysis and data mining. We provide the mathematical and graphical representations and interpretation of tensor networks, with the main focus on the Tucker and Tensor Train (TT) decompositions and their extensions or generalizations. Keywords: Tensor networks, Function-related tensors, CP decomposition, Tucker models, tensor train (TT) decompositions, matrix product states (MPS), matrix product operators (MPO), basic tensor operations, multiway component analysis, multilinear blind source separation, tensor completion, linear/multilinear dimensionality reduction, large-scale optimization problems, symmetric eigenvalue decomposition (EVD), PCA/SVD, huge systems of linear equations, pseudo-inverse of very large matrices, Lasso and Canonical Correlation Analysis (CCA) (This is Part 1)
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
Independent component analysis, A new concept?
Comon, P. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90029-9 · Cited by 8,205
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
A Multilinear Singular Value Decomposition
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896305696 · Cited by 4,106
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898346995 · Cited by 1,567
Cichocki, A., Zdunek, R., Phan, A. H., & Amari, S. (2009) · doi:10.1002/9780470747278 · Cited by 1,540
Self-citationAndersson, C. A., & Bro, R. (2000) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(00)00071-x · Cited by 1,229
Bellman, R. (1964) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1964.1082221 · Cited by 991
Rigorous Results on Valence-Bond Ground States in Antiferromagnets
Affleck, I., Kennedy, T., Lieb, E. H., & Tasaki, H. (2004) · Condensed Matter Physics and Exactly Soluble Models · doi:10.1007/978-3-662-06390-3_18 · Cited by 989
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
Dimensionality Reduction for Supervised Learning With Reproducing Kernel Hilbert Spaces
Fukumizu, K., Bach, F. R., & Jordan, M. I. (2003) · doi:10.21236/ada446572 · Cited by 723
Fast Local Algorithms for Large Scale Nonnegative Matrix and Tensor Factorizations
CICHOCKI, A., & PHAN, A.-H. (2009) · IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences · doi:10.1587/transfun.e92.a.708 · Cited by 575
Self-citationSymmetric Tensors and Symmetric Tensor Rank
Comon, P., Golub, G., Lim, L.-H., & Mourrain, B. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060661569 · Cited by 544
Unsupervised Multiway Data Analysis: A Literature Survey
Acar, E., & Yener, B. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.112 · Cited by 434
A Probabilistic Interpretation of Canonical Correlation Analysis
Bach, F., & Jordan, M. I. (2005) · Cited by 421
De Lathauwer, L. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040608830 · Cited by 419
Independent component analysis of fMRI group studies by self-organizing clustering
Esposito, F., Scarabino, T., Hyvarinen, A., Himberg, J., Formisano, E., Comani, S., Tedeschi, G., Goebel, R., Seifritz, E., & Di Salle, F. (2005) · NeuroImage · doi:10.1016/j.neuroimage.2004.10.042 · Cited by 364
Linear Dimensionality Reduction: Survey, Insights, and Generalizations
Cunningham, J. P., & Ghahramani, Z. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.0873 · Cited by 357
Algorithms for entanglement renormalization
Evenbly, G., & Vidal, G. (2009) · Physical Review B · doi:10.1103/physrevb.79.144108 · Cited by 337
Cevher, V., Becker, S., & Schmidt, M. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2329397 · Cited by 300
A scalable optimization approach for fitting canonical tensor decompositions
Acar, E., Dunlavy, D. M., & Kolda, T. G. (2011) · Journal of Chemometrics · doi:10.1002/cem.1335 · Cited by 290
Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
Dolgov, S. V., & Savostyanov, D. V. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/140953289 · Cited by 253
Era of Big Data Processing: A New Approach via Tensor Networks and Tensor Decompositions
Cichocki, A. S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.2048 · Cited by 201
Self-citationSolution of Linear Systems and Matrix Inversion in the TT-Format
Oseledets, I. V., & Dolgov, S. V. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/110833142 · Cited by 187
Self-citationComputing Sparse Representations of Multidimensional Signals Using Kronecker Bases
Caiafa, C. F., & Cichocki, A. (2013) · Neural Computation · doi:10.1162/neco_a_00385 · Cited by 184
Self-citationA Least-Squares Framework for Component Analysis
De la Torre, F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.184 · Cited by 176
Tensor-based anomaly detection: An interdisciplinary survey
Fanaee‐T, H., & da Gama, J. M. P. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.01.027 · Cited by 152
RTRMC: A Riemannian trust-region method for low-rank matrix completion
Boumal, N., & Absil, P.-A. (2011) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · Cited by 143
DFacTo: Distributed Factorization of TensorsPreprint
Choi, J. H., & Vishwanathan, S. V. N. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4519 · Cited by 131
Tensor Networks for Big Data Analytics and Large-Scale Optimization ProblemsPreprint
Cichocki, A. S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.3124 · Cited by 118
Self-citationTensor Spectral Clustering for Partitioning Higher-order Network Structures
Benson, A. R., Gleich, D. F., & Leskovec, J. (2015) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.14 · Cited by 114
Sparse Canonical Correlation Analysis: New Formulation and Algorithm
Chu, D., Liao, L., Ng, M. K., & Zhang, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.104 · Cited by 111
Computation of extreme eigenvalues in higher dimensions using block tensor train format
Dolgov, S., Khoromskij, B. N., Oseledets, I. V., & Savostyanov, D. (2014) · Computer Physics Communications · doi:10.1016/j.cpc.2013.12.017 · Cited by 106
Self-citationQuantum Multiscale Entanglement Renormalization Ansatz Channels
Giovannetti, V., Montangero, S., & Fazio, R. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.180503 · Cited by 96
TT-GMRES: solution to a linear system in the structured tensor format
Dolgov, S. (2013) · Russian Journal of Numerical Analysis and Mathematical Modelling · doi:10.1515/rnam-2013-0009 · Cited by 91
Latent Variable Analysis and Signal Separation
Vigneron, V., Zarzoso, V., Moreau, É., et al. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15995-4 · Cited by 88
Simultaneous state‐time approximation of the chemical master equation using tensor product formats
Dolgov, S., & Khoromskij, B. N. (2014) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1942 · Cited by 73
Robust Low-Rank Matrix Completion by Riemannian Optimization
Cambier, L., & Absil, P.-A. (2016) · SIAM Journal on Scientific Computing · doi:10.1137/15m1025153 · Cited by 70
Numerical methods for high-dimensional probability density function equations
Cho, H., Venturi, D., & Karniadakis, G. E. (2015) · Journal of Computational Physics · doi:10.1016/j.jcp.2015.10.030 · Cited by 63
Population Value Decomposition, a Framework for the Analysis of Image Populations
Crainiceanu, C. M., Caffo, B. S., Luo, S., Zipunnikov, V. M., & Punjabi, N. M. (2011) · Journal of the American Statistical Association · doi:10.1198/jasa.2011.ap10089 · Cited by 62
Sparse non-negative generalized PCA with applications to metabolomics
Allen, G. I., & Maletić‐Savatić, M. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr522 · Cited by 58
Two-Level QTT-Tucker Format for Optimized Tensor Calculus
Dolgov, S., & Khoromskij, B. N. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120882597 · Cited by 54
Low-rank retractions: a survey and new results
Absil, P.-A., & Oseledets, I. V. (2014) · Computational Optimization and Applications · doi:10.1007/s10589-014-9714-4 · Cited by 52
Self-citationDolgov, S., Pearson, J. W., Savostyanov, D., & Stoll, M. (2015) · Applied Mathematics and Computation · doi:10.1016/j.amc.2015.09.042 · Cited by 41
Overview of Tensor Decompositions with Applications to Communications
de Almeida, A. L. F., Favier, G., Mota, J., & da Costa, J. (2015) · CRC Press eBooks · doi:10.1201/b19385-17 · Cited by 37
Chen, C., Huang, J., He, L., et al. (2014) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2014.353 · Cited by 36
Constrained Optimization with Low-Rank Tensors and Applications to Parametric Problems with PDEs
Garreis, S., & Ulbrich, M. (2017) · SIAM Journal on Scientific Computing · doi:10.1137/16m1057607 · Cited by 35
Algebraic Geometry of Matrix Product States
Critch, A. (2014) · Symmetry Integrability and Geometry Methods and Applications · doi:10.3842/sigma.2014.095 · Cited by 21
A Review on Adaptive Low-Rank Approximation Techniques in the Hierarchical Tensor Format
Ballani, J., Grasedyck, L., & Kluge, M. (2014) · Lecture notes in computational science and engineering · doi:10.1007/978-3-319-08159-5_10 · Cited by 7
Kreßner, D., Macedo, F., Kahl, K., Bolten, M., & Sokolović, S. (2018) · Oesterreichisches Musiklexikon online (Institut für kunst- und musikhistorische Forschungen der Österreichischen Akademie der Wissenschaften) · doi:10.1553/etna_vol48s348 · Cited by 4
Cited by
A review of classification algorithms for EEG-based brain–computer interfaces: A 10 year update
Lotte, F., Bougrain, L., Cichocki, A., Clerc, M., Congedo, M., Rakotomamonjy, A., & Yger, F. (2018) · Journal of Neural Engineering · doi:10.1088/1741-2552/aab2f2 · Cited by 2,239
Self-citationThe ITensor Software Library for Tensor Network Calculations
Fishman, M., White, S., & Stoudenmire, E. M. (2022) · SciPost Physics Codebases · doi:10.21468/scipostphyscodeb.4 · Cited by 1,084
Learning a Low Tensor-Train Rank Representation for Hyperspectral Image Super-Resolution
Dian, R., Li, S., & Fang, L. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2885616 · Cited by 410
Twelve Scientific Challenges for 6G: Rethinking the Foundations of Communications Theory
Chafii, M., Bariah, L., Muhaidat, S., & Debbah, M. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3243918 · Cited by 289
Unsupervised Generative Modeling Using Matrix Product States
Han, Z.-Y., Wang, J., Fan, H., Wang, L., & Zhang, P. (2018) · Physical Review X · doi:10.1103/physrevx.8.031012 · Cited by 256
Metadata
- Authors
- Cichocki, A., Lee, N., Oseledets, I., Phan, A.-H., Zhao, Q., & Mandic, D. P.
- Venue
- Foundations and Trends® in Machine Learning
- Publisher
- Emerald
- Published
- 2016
- Volume
- 9
- Issue
- 4-5
- Pages
- 249-429
- ISSN
- 1935-8237 (ISSN-L)
- 1935-8245
- OpenAlex
- W2516041031
- Cited by
- 456
- References
- 56
- FWCI
- 10.79
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.