The Tensor Ring Decomposition Model represents a tensor as an interconnected series of third-order core tensors and generalizes Tensor Train Decomposition by eliminating open boundary rank constraints allowing circular permutation invariance and linear parameter scaling.
Provable and efficient algorithms–including sequential SVDs, ALS variants and block-randomized SGD–enable rapid, memory-efficient TR optimization. Furthermore, these methods offer robust fit even in cases with missing data, heavy tail noise or outliers.
What is TR?
TR is an Nth-order tensor decomposition model that represents it as a sequence of interconnected cores (a ring of 3-way tensors). It is an extension and generalization of TT decomposition that removes open-boundary rank constraints to allow greater rank flexibility. Key properties include circular permutation invariance, linear parameter scaling and high expressiveness for approximating large-dimensional data sets. Furthermore, TR’s computational efficiency makes it suitable for optimization with ALS variants and random algorithms.
TR Model
Tensor Ring Decomposition is an indispensable factorization technique that represents a tensor as a series of interconnected third-order cores. It generalizes and strictly contains Tensor Train Decomposition by eliminating its open boundary rank constraint while simultaneously providing full permutation symmetry under cyclic mode shifts to enable linear parameter scaling with high expressivity.
This model is robust, showing resilience against missing data and heavy-tailed noise/outliers. Furthermore, it supports various computationally efficient algorithms – sequential SVDs and ALS with recursive gradient descent being among them – to allow fast and accurate TR fitting on large-scale tensors even with incomplete or poor conditioning data.
One key property of TR factorizations is their quotient geometry: given moderate genericity conditions on each core’s 2-unfolding and modding out by projective general linear group action, all TR factorizations form a smooth quotient manifold M with dimension Rn R(Rn + 1) (Gao et al., 29 Jan 2026). This geometric structure enables Riemannian optimization for recovery and completion with exact core ranks; finite-step algebraic recovery algorithms can recover generic TR cores up to gauge from limited sampled entries; these methods also permit fast fitting large-scale streaming tensors even with incomplete data input.
TR Algorithms
Tensor Ring Decomposition represents an Nth-order tensor as a series of interconnected third-order cores. This structure allows for an intuitive notion of rank while remaining stable and efficient computationally. Furthermore, this method features circular permutation invariance – any cyclic rearrangement of latent cores yields the same reconstructed tensor allowing general representation for high dimensional data sets with circular permutations invariance properties allowing general and powerful representation for high dimensional data sets as general and powerful representation as opposed to Tensor Train decomposition in terms of open boundary constraints that restrict rank constraint limitations and allows linear parameter scaling capabilities compared to TT decomposition which has open boundary constraints on rank constraints while still offering linear parameter scaling capabilities for high dimension data sets with high dimensions data values for parameter scaling as it removes open boundary ranks constraints while maintaining open boundary rank constraint on scaling parameter scaling parameters for easier parameter scaling processes when dealing with non-dimensional data sets that contain higher dimensions than its representation could potentially.
Thus, TR offers an attractive alternative to existing robust tensor completion algorithms for use across an array of applications, but is currently constrained by its computational complexity due to the curse of dimensionality. As a way around this issue, various approaches have been proposed such as random or blockwise algorithms leveraging data sparsity or structure as ways of mitigating bottlenecks.
Tensor sketching is another effective way of reducing computational complexity, producing a sketch of the latent tensor using only certain slices, which can increase fitting performance while decreasing storage and computation costs. Its basis lies in the knowledge that for an integer-dimensional tensor, an estimate can be made as to the number of slices needed to provide an acceptable approximation based on coherence and norm measures of its coherence and norm values.
Photoacoustic tomography (PAT), another noninvasive imaging modality which can detect cancerous tumors in patients, has become an increasingly popular cancer detection and screening method. Although TR methods have been implemented into PAT reconstruction procedures with some success, only limited research into their implementation and only few numerical and phantom studies have been performed to demonstrate its capability.
In this paper, we propose a novel model for PAT reconstruction based on tensor ring decomposition (TR). We demonstrate that its TR model is both accurate and scalable for a broad array of imaging conditions; its accuracy surpassing state-of-the-art techniques for both real-world data sets as well as simulation data sets while maintaining excellent reconstruction accuracy – something it achieves through exploiting TR’s scalability through fast Gram matrix computation (FGMC) techniques combined with random subtensor sketching strategies FGMC) methods FGMC) techniques (fast Gram matrix computation) techniques (fast Gram matrix computation) techniques.
TR Optimization
The Tensor Ring (TR) Model is an acyclic network factorization of tensors that represents their complexity as an interconnected series of third-order core tensors with circular invariance. This approach generalizes Tensor Train (TT), by eliminating open boundary rank constraints, linear parameter scaling while maintaining high expressivity and stability, permutation symmetry under cyclic shifts of mode changes, as well as supporting all possible dimensions for their representation of tensors.
Effective algorithms utilizing latent-space rank minimization significantly decrease the computational cost of TR fitting by 10-100x by decreasing the sample requirements per iteration. Furthermore, methods employing nuclear norms on core unfoldings and ADMM-based gradients provide for simultaneous learning of ranks and reconstruction as well as performing all SVDs on small matrices which greatly alleviate model selection burden and prevent overfitting.
Deterministic finite-step algorithms employing leverage-score or uniform sampling and randomized subtensor sketching (RStS) provide robust TR decomposition in the presence of missing data or heavy-tailed noise/outliers, streaming extensions that speed reconstruction up by 10-100x, without loss in accuracy, while low cost updates that scale linearly with tensor size via leverage score variants or randomized methods (LS variants/randomized methods).
