Sep 2026· IEEE Transactions on Pattern Analysis and Machine Intelligence· Vol PP, pp. 1-18· 0 citations
Medicine
TL;DR
This work proposes a novel structure-revealing TN paradigm, termed SVD-inspired TN decomposition (SVDinsTN), which enables the formulation of an energy function that simultaneously considers representation error and TN structure complexity, facilitating the joint optimization of data representation and the identification of a compact TN structure.
Abstract
Tensor network (TN) decomposition is a powerful data representation tool widely used in machine learning and computer vision. However, existing TN decomposition methods are limited by fixed topologies, which constrain their representational capacity. To overcome this limitation, we introduce, for the first time, an energy-based framework that allows us to reveal a data-adaptive TN structure through the optimization of an energy function. Specifically, we propose a novel structure-revealing TN paradigm, termed SVD-inspired TN decomposition (SVDinsTN). This paradigm enables the formulation of an energy function that simultaneously considers representation error and TN structure complexity, facilitating the joint optimization of data representation and the identification of a compact TN structure. Theoretically, we present the principles behind the energy function and derive an upper bound for the TN rank. In contrast to heuristic TN structure search methods, our energy-based method achieves a remarkable acceleration of 100 to 1000 times, making it practical for real-world applications. Experimental results in neural network compression, remote sensing image cloud removal, and tensor robust principal component analysis consistently show that SVDinsTN can identify a TN structure that better aligns with the given data, achieving superior performance over fixed-topology methods.
Tensor networks are powerful formats for compressing large-scale data. However, their application to general data processing has been limited by the difficulty of performing nonlinear operations. Here, we introduce iterative tensor network transformations (ITNTs), a general algorithmic framework for the element-wise ev...
Xiao Wang, Tomohiro Hashizume, Pia Siegl et al.· 2 citations
This paper proposes a novel Tensor Train (TT)-based tensor-on-tensor regression optimization framework for variable selection based on mode-1 hyperslice sparsity, and designs an alternating iterative algorithm equipped with a preconditioned metric to efficiently solve the proposed model.
Tensor-ring (TR) decompositions provide a natural representation of periodic systems but are difficult to optimize because the closed geometry prevents a global canonical form and leads to costly, ill conditioned environments. Existing periodic DMRG methods alleviate this difficulty by compressing long environments to...
Matthieu Jeannin, A. Chessari, J. von Delft· 0 citations
Tensor representations have emerged as a fundamental paradigm for modeling multidimensional data by preserving intrinsic correlations across multiple modes. This paper proposes a novel theoretical framework, termed Tensor Orthogonal Subspace Split (TOSS), which explicitly splits a tensor, along a prescribed mode, into...
Jifei Miao, Juan Han, M. K. Ng et al.· 0 citations
This work develops a framework for learning over Mapper induced structured representations, and studies mathematical properties of these representations, including invariance under relabeling, a distance functional on the space of Mapper representations, structural complexity of multiscale decompositions, and learning...
Tensor completion has attracted significant attention in both applications and theoretical research. Under standard uniform sampling, existing polynomial-time guarantees generally require more observations than the number of degree of freedom, motivating the study of a possible statistical-to-computational gap in highl...
Jing-Yang Li, M. K. Ng· Journal of the American Stat...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.