The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Tensor-Train Decomposition
Abstract
A simple nonrecursive form of the tensor decomposition in d dimensions is presented. It does not inherently suffer from the curse of dimensionality, it has asymptotically the same number of parameters as the canonical decomposition, but it is stable and its computation is based on low-rank approximation of auxiliary unfolding matrices. The new form gives a clear and convenient way to implement all basic operations efficiently. A fast rounding procedure is presented, as well as basic linear algebra operations. Examples showing the benefits of the decomposition are given, and the efficiency is demonstrated by the computation of the smallest eigenvalue of a 19-dimensional operator.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
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
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
PARAFAC. Tutorial and applications
Bro, R. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(97)00032-4 · Cited by 2,814
Harshman, R. A. (1970) · Cited by 2,255
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
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
Babuska, I. M., Nobile, F., & Tempone, R. F. (2007) · SIAM Journal on Numerical Analysis · doi:10.1137/050645142 · Cited by 1,458
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
Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
Babuska, I. M., Tempone, R. F., & Zouraris, G. E. (2004) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142902418680 · Cited by 877
Cited by
Recent advances in convolutional neural networks
Gu, J., Wang, Z., Kuen, J., Ma, L., Shahroudy, A., Shuai, B., Liu, T., Wang, X., Wang, G., Cai, J., et al. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.10.013 · Cited by 6,576
Deep Convolutional Neural Networks for Image Classification: A Comprehensive Review
Rawat, W., & Wang, Z. (2017) · Neural Computation · doi:10.1162/neco_a_00990 · Cited by 3,503
Machine learning and the physical sciences
Carleo, G., Cirac, I., Cranmer, K., Daudet, L., Schuld, M., Tishby, N., Vogt-Maranto, L., & Zdeborová, L. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045002 · Cited by 2,417
A Survey of Projection-Based Model Reduction Methods for Parametric Dynamical Systems
Benner, P., Gugercin, S., & Willcox, K. (2015) · SIAM Review · doi:10.1137/130932715 · Cited by 1,916
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Deep learning enables rapid identification of potent DDR1 kinase inhibitors
Zhavoronkov, A., Ivanenkov, Y. A., Aliper, A., Veselov, M. S., Aladinskiy, V. A., Aladinskaya, A. V., Terentiev, V. A., Polykovskiy, D. A., Kuznetsov, M. D., Asadulaev, A., et al. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0224-x · Cited by 1,573
Cichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
The 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
“The two most well developed formats are the matrix product state (MPS) tensor network [4, 15, 16], also known as the tensor train [6], and the matrix product operator (MPO) tensor network [17,18].”
BackgroundModel Compression and Hardware Acceleration for Neural Networks: A Comprehensive Survey
Deng, B. L., Li, G., Han, S., Shi, L., & Xie, Y. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.2976475 · Cited by 996
“…et al. [129] showed neural network applications, but they are yet to answer how to obtain an optimal HT form. e) Tensor train (TT): According to [130], the TT format of a d th-order tensor A ∈ R n 1 × n 2 × ... × n d can be represented as A ( j 1 , j 2 , . . . , where G k [ j k ] is a factor…”
BackgroundQuantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Unifying time evolution and optimization with matrix product states
Haegeman, J., Lubich, C., Oseledets, I., Vandereycken, B., & Verstraete, F. (2016) · Physical Review B · doi:10.1103/physrevb.94.165116 · Cited by 804
Self-citationNovel Methods for Multilinear Data Completion and De-noising Based on Tensor-SVD
Zhang, Z., Ely, G., Aeron, S., Hao, N., & Kilmer, M. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.485 · Cited by 798
Matrix product states and projected entangled pair states: Concepts, symmetries, theorems
Cirac, J. I., Pérez-García, D., Schuch, N., & Verstraete, F. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.045003 · Cited by 769
Time-evolution methods for matrix-product states
Paeckel, S., Köhler, T., Swoboda, A., Manmana, S. R., Schollwöck, U., & Hubig, C. (2019) · Annals of Physics · doi:10.1016/j.aop.2019.167998 · Cited by 768
A literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Novikov, A., Podoprikhin, D., Osokin, A., & Vetrov, D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.06569 · Cited by 558
Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
Bengua, J. A., Phien, H. N., Tuan, H. D., & Do, M. N. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2672439 · Cited by 461
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
Model complexity of deep learning: a survey
Hu, X., Chu, L., Pei, J., Liu, W., & Bian, J. (2021) · Knowledge and Information Systems · doi:10.1007/s10115-021-01605-0 · Cited by 402
A review of convolutional neural network architectures and their optimizations
Cong, S., & Zhou, Y. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10213-5 · Cited by 381
Tensors for Data Mining and Data Fusion: Models, Applications, and Scalable Algorithms
Papalexakis, E. E., Faloutsos, C., & Sidiropoulos, N. D. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2915921 · Cited by 354
The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
Holtz, S., Rohwedder, T., & Schneider, R. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/100818893 · Cited by 337
Variational quantum algorithms for nonlinear problems
Lubasch, M., Joo, J., Moinier, P., Kiffner, M., & Jaksch, D. (2020) · Physical Review A · doi:10.1103/physreva.101.010301 · Cited by 332
“[49] I.”
BackgroundTensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
Baiardi, A., & Reiher, M. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5129672 · Cited by 306
The density matrix renormalization group for ab initio quantum chemistry
Wouters, S., & Van Neck, D. (2014) · The European Physical Journal D · doi:10.1140/epjd/e2014-50500-1 · Cited by 285
Zhao, Q., Zhou, G., Xie, S., Zhang, L., & Cichocki, A. S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.05535 · Cited by 284
A New Truncation Strategy for the Higher-Order Singular Value Decomposition
Vannieuwenhoven, N., Vandebril, R., & Meerbergen, K. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/110836067 · Cited by 277
Recent advances and new guidelines on hyperspectral and multispectral image fusion
Dian, R., Li, S., Sun, B., & Guo, A. (2021) · Information Fusion · doi:10.1016/j.inffus.2020.11.001 · Cited by 268
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
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
Time Integration of Tensor Trains
Lubich, C., Oseledets, I. V., & Vandereycken, B. (2015) · SIAM Journal on Numerical Analysis · doi:10.1137/140976546 · Cited by 183
Self-citationTensor Network Contractions: Methods and Applications to Quantum Many-Body Systems
Ran, S.-J., Tirrito, E., Peng, C., Chen, X., Tagliacozzo, L., Su, G., & Lewenstein, M. (2020) · Lecture Notes in Physics · doi:10.1007/978-3-030-34489-4 · Cited by 176
Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
Lubich, C., Rohwedder, T., Schneider, R., & Vandereycken, B. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120885723 · Cited by 163
“Typical choices for such dimension trees are those obtained by a balanced splitting of the index set, as used, e.g., by Grasedyck [7], or a front-to-back splitting which (with minor adaptations; see Remark 1) leads to the TT format due to Oseledets and Tyrtyshnikov [25, 26].”
BackgroundMethodInfluentialA Double Deep Q-Learning Model for Energy-Efficient Edge Scheduling
Zhang, Q., Lin, M., Yang, L. T., Chen, Z., Khan, S. U., & Li, P. (2019) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2018.2867482 · Cited by 158
CacheGen: KV Cache Compression and Streaming for Fast Large Language Model Serving
Liu, Y., Li, H., Cheng, Y., Ray, S., Huang, Y., Zhang, Q., Du, K., Yao, J., Lu, S., Ananthanarayanan, G., et al. (2024) · Proceedings of the ACM SIGCOMM 2024 Conference · doi:10.1145/3651890.3672274 · Cited by 118
“Evaluation results of CacheGen with more baselines is available §B, including using a smaller-sized model to speed up TTFT and Gisting, another context-shrinking technique.”
Method(2019) · neural information processing systems · Cited by 83
Parallel time-dependent variational principle algorithm for matrix product states
Secular, P., Gourianov, N., Lubasch, M., Dolgov, S., Clark, S. R., & Jaksch, D. (2020) · Physical Review B · doi:10.1103/physrevb.101.235123 · Cited by 40
ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models
Yuan, Z., Shang, Y., Song, Y., Yang, D., Wu, Q., Yan, Y., & Sun, G. (2023) · arXiv · doi:10.48550/arxiv.2312.05821 · Cited by 4
“…the most related work is the concurrent TensorGPT [Xu et al., 2023, Zhu et al., 2023], in which the embedding layer of LLMs is compressed through Tensor-Train Decomposition (TTD) [Oseledets, 2011] in order to store large embeddings in a low-rank tensor format, with much fewer parameters.”
BackgroundProspects for NMR spectral prediction on fault-tolerant quantum computers
Elenewski, J. E., Camara, C. M., & Kalev, A. (2026) · Physical Review Research · doi:10.1103/km66-ltpl · Cited by 3
Osborne, J. J., & McCulloch, I. P. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023018 · Cited by 3
Low-Rank+Sparse Tensor Compression for Neural Networks
Hawkins, C., Yang, H., Li, M., Lai, L., & Chandra, V. (2021) · arXiv · doi:10.48550/arxiv.2111.01697 · Cited by 2
KVDirect: Distributed Disaggregated LLM Inference
Chen, S., Jiang, R., Yu, D., Xu, J., Chao, M., Meng, F., Jiang, C., Xu, W., & Liu, H. (2025) · arXiv · doi:10.48550/arxiv.2501.14743 · Cited by 1
“For example, tailored from the tensor compression techniques in DNN [5,32], one can quantize into smaller data types [14,23,39,50] or sparsify the KV cache [18,41,51].”
Metadata
- Authors
- Oseledets, I. V.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2011-01
- Volume
- 33
- Issue
- 5
- Pages
- 2295-2317
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1993482030
- Cited by
- 2,636
- References
- 31
- FWCI
- 12.34
- Type
- journal article
- Language
- en
- Open access
- closed
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.