Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Tensor Train Decomposition

Grey Ballard, Tamara G. Kolda

Published Jun 10, 2025• 0 citations
Publisher
DOI
10.1017/9781009471664.011

Related papers

Adaptive Tensor Networks Decomposition

Chang Nie, Huan Wang, Le Tian

British Machine Vision Conference (BMVC)•Jan 1, 2021•6 citations

Relational Tensor Decomposition via Tensor Train Sparsification

Jincheng Zhang

Relational tensor decomposition aims to uncover the underlying relationships between entities represented in a multi-dimensional tensor. Traditional methods often struggle with scalability and interpretability, particularly when dealing with complex relational structures. This paper presents a novel approach to relational tensor decomposition that leverages the efficiency of Tensor Trains (TTs) combined with a sparsity-inducing constraint based on relational dependencies. We decompose relational tensors using TT decomposition, and then introduce a sparsity pattern that prioritizes connections between related entities. This process effectively builds a sparse TT representation that explicitly encodes the relational structure of the data. The resulting method demonstrates improved efficiency and enhanced interpretability compared to standard TT decomposition, offering a promising solution for analyzing complex relational data. The core claim is improved efficiency and interpretability of relational tensor decomposition by sparsifying the Tensor Train representation based on relational dependencies. The core mechanism is the application of Tensor Train decomposition to relational tensors, coupled with a sparsity constraint prioritizing connections between related entities.

•Sep 6, 2026•0 citations

An Incremental Tensor-Train Decomposition for Cyber-Physical-Social Big Data

Huazhong Liu, Laurence Tianruo Yang, Yimu Guo +2 more

Cyber-physical-social big data generated from ubiquitous devices and diverse spaces generally are multi-source, heterogeneous, and deeply intertwined. To efficiently analyze and handle the ubiquitous cyber-physical-social big data, tensor is considered as an effective tool, but the curse of dimensionality is still the main bottleneck of tensor-based big data analysis. Tensor networks can considerably alleviate or overcome it through the tensor approximate theory. Therefore, this paper focuses on developing an efficient big data processing framework based on tensor networks and providing an incremental tensor train decomposition approach for the streaming big data. Concretely, this paper first presents a hierarchical cyber-physical-social big data processing framework composed of three planes, namely, data representation and decomposition, data storage and processing, and data analysis and service, in which tensor train (TT) and quantized TT decompositions are particularly introduced to remarkably overcome the curse of dimensionality. Besides, to efficiently handle the continuous streaming big data and avoid the repeated decomposition for the history data, an incremental tensor train decomposition (ITTD) approach is proposed and the complexities are further analyzed in detail. Experimental results demonstrate that ITTD demonstrably outperforms the nonincremental TT decomposition in execution time on the precise of guaranteeing the nearly equal approximation error.

IEEE Transactions on Big Data•Aug 29, 2018•58 citations

Tensor Network Methods

Timo Felser, Simone Montangero

Graduate texts in physics•Jan 1, 2026•0 citations

A TT-Based Hierarchical Framework for Decomposing High-Order Tensors

Yassine Zniyed, Rémy Boyer, André L. F. de Almeida +1 more

In the context of big data, high-order tensor decompositions have to face a new challenge in terms of storage and computational costs. The tensor train (TT) decomposition provides a very useful graph-based model reduction, whose storage cost grows linearly with the tensor order $D$. The computation of the TT-core tensors and TT-ranks can be done in a stable sequential (i.e., noniterative) way thanks to the popular TT-SVD algorithm. In this paper, we exploit the ideas developed for the hierarchical/tree Tucker decomposition in the context of the TT decomposition. Specifically, a new efficient estimation scheme, called TT-HSVD (Tensor-Train Hierarchical SVD), is proposed as a solution to compute the TT decomposition of a high-order tensor. The new algorithm simultaneously delivers the TT-core tensors and their TT-ranks in a hierarchical way. It is a stable (i.e., noniterative) and computationally more efficient algorithm than TT-SVD, which is very important when dealing with large-scale data. The TT-HSVD algorithm uses a new reshaping strategy and a tailored partial SVD, which allows us to deal with smaller matrices compared to those of the TT-SVD. In addition, TT-HSVD is well suited for a parallel processing architecture. An algebraic analysis of the two algorithms is carried out, showing that TT-SVD and TT-HSVD compute the same TT-ranks and TT-core tensors up to specific bases. Simulation results for different tensor orders and dimensions corroborate the effectiveness of the proposed algorithm.

SIAM Journal on Scientific Computing•Jan 1, 2020•36 citations

Tensor Network Methods

Simone Montangero

Springer eBooks•Jan 1, 2018•0 citations
Relational tensor decomposition aims to uncover the underlying relationships between entities represented in a multi-dimensional tensor. Traditional methods often struggle with scalability and interpretability, particularly when dealing with complex relational structures. This paper presents a novel approach to relational tensor decomposition that leverages the efficiency of Tensor Trains (TTs) combined with a sparsity-inducing constraint based on relational dependencies. We decompose relational tensors using TT decomposition, and then introduce a sparsity pattern that prioritizes connections between related entities. This process effectively builds a sparse TT representation that explicitly encodes the relational structure of the data. The resulting method demonstrates improved efficiency and enhanced interpretability compared to standard TT decomposition, offering a promising solution for analyzing complex relational data. The core claim is improved efficiency and interpretability of relational tensor decomposition by sparsifying the Tensor Train representation based on relational dependencies. The core mechanism is the application of Tensor Train decomposition to relational tensors, coupled with a sparsity constraint prioritizing connections between related entities.
Cyber-physical-social big data generated from ubiquitous devices and diverse spaces generally are multi-source, heterogeneous, and deeply intertwined. To efficiently analyze and handle the ubiquitous cyber-physical-social big data, tensor is considered as an effective tool, but the curse of dimensionality is still the main bottleneck of tensor-based big data analysis. Tensor networks can considerably alleviate or overcome it through the tensor approximate theory. Therefore, this paper focuses on developing an efficient big data processing framework based on tensor networks and providing an incremental tensor train decomposition approach for the streaming big data. Concretely, this paper first presents a hierarchical cyber-physical-social big data processing framework composed of three planes, namely, data representation and decomposition, data storage and processing, and data analysis and service, in which tensor train (TT) and quantized TT decompositions are particularly introduced to remarkably overcome the curse of dimensionality. Besides, to efficiently handle the continuous streaming big data and avoid the repeated decomposition for the history data, an incremental tensor train decomposition (ITTD) approach is proposed and the complexities are further analyzed in detail. Experimental results demonstrate that ITTD demonstrably outperforms the nonincremental TT decomposition in execution time on the precise of guaranteeing the nearly equal approximation error.
In the context of big data, high-order tensor decompositions have to face a new challenge in terms of storage and computational costs. The tensor train (TT) decomposition provides a very useful graph-based model reduction, whose storage cost grows linearly with the tensor order DDD. The computation of the TT-core tensors and TT-ranks can be done in a stable sequential (i.e., noniterative) way thanks to the popular TT-SVD algorithm. In this paper, we exploit the ideas developed for the hierarchical/tree Tucker decomposition in the context of the TT decomposition. Specifically, a new efficient estimation scheme, called TT-HSVD (Tensor-Train Hierarchical SVD), is proposed as a solution to compute the TT decomposition of a high-order tensor. The new algorithm simultaneously delivers the TT-core tensors and their TT-ranks in a hierarchical way. It is a stable (i.e., noniterative) and computationally more efficient algorithm than TT-SVD, which is very important when dealing with large-scale data. The TT-HSVD algorithm uses a new reshaping strategy and a tailored partial SVD, which allows us to deal with smaller matrices compared to those of the TT-SVD. In addition, TT-HSVD is well suited for a parallel processing architecture. An algebraic analysis of the two algorithms is carried out, showing that TT-SVD and TT-HSVD compute the same TT-ranks and TT-core tensors up to specific bases. Simulation results for different tensor orders and dimensions corroborate the effectiveness of the proposed algorithm.