Tensor rank reduction via coordinate flows
Not on the map. Why?
Abstract (arXiv)
Recently, there has been a growing interest in efficient numerical algorithms based on tensor networks and low-rank techniques to approximate high-dimensional functions and solutions to high-dimensional PDEs. In this paper, we propose a new tensor rank reduction method based on coordinate transformations that can greatly increase the efficiency of high-dimensional tensor approximation algorithms. The idea is simple: given a multivariate function, determine a coordinate transformation so that the function in the new coordinate system has smaller tensor rank. We restrict our analysis to linear coordinate transformations, which gives rise to a new class of functions that we refer to as tensor ridge functions. Leveraging Riemannian gradient descent on matrix manifolds we develop an algorithm that determines a quasi-optimal linear coordinate transformation for tensor rank reduction.The results we present for rank reduction via linear coordinate transformations open the possibility for generalizations to larger classes of nonlinear transformations. Numerical applications are presented and discussed for linear and nonlinear PDEs.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Jul 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2.
2 papers.
- 2025Generative forecasting with joint probability modelscited by 2
- 2025Approximation and learning with compositional tensor trainscited by 1
- 2025Generative forecasting with joint probability models30 Dec 2025
- 2025Approximation and learning with compositional tensor trains19 Dec 2025