The Reverse Telescoping Coordinate System for Positive Definite Matrices: Geometry, Computation, and Generative Modeling

• URL: http://arxiv.org/abs/2606.15442v1
• Date: Sat, 13 Jun 2026 19:18:45 GMT
• Title: The Reverse Telescoping Coordinate System for Positive Definite Matrices: Geometry, Computation, and Generative Modeling
• Abstract summary: We design a new unconstrained coordinate system where a $ptimes p$ symmetric positive definite (SPD) matrix $$ is represented by a map $(x)=rmRT(x)$, with $x=(v,d,r)inmathbbRtimesmathbbR(p-1)timesmathbbRp(p-1)/2$.<n>This construction results in important properties not available in other charts, e.g., matrix logarithm, such as Jacobian depending on only the log-determin
• Score: 3.451964963586459
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We design a new unconstrained coordinate system where a $p\times p$ symmetric positive definite (SPD) matrix $Θ$ is represented by a reverse telescoping map $Θ(x)=\rm{RT}(x)$, with $x=(v,d,r)\in\mathbb{R}\times\mathbb{R}^{(p-1)}\times\mathbb{R}^{p(p-1)/2}$, representing respectively the log volume or log determinant; and the shape, as encoded by log relative diagonal scales and partial covariances among the nodes. This construction results in important properties not available in other charts, e.g., matrix logarithm, such as Jacobian depending on only the log-determinant. A useful feature of our construction is $x$ contains a lossless symbolic representation of both the matrix and its inverse. Many important computations involving a matrix and its inverse can be performed in $O(p^2)$ in the transformed domain, while it is the rendering of results in matrix forms (on demand) that must incur an $O(p^3)$ cost. Moreover, two unit-determinant matrices in the transformed domain can be joined by a straight line with pathwise unit determinant. For generative modeling, this allows designing a split volume-shape flow model trained by conditional flow matching for transporting the shape over the unit-determinant path, with a separate one-dimensional flow for transporting the volume or the determinant. The forbidding SPD constraint, tamed thus into a powerful guiding force, leads to the surprising insight that it is in some sense easier to design a volume-normalized shape flow for SPD compared to the unconstrained $\mathbb{R}^{p\times p}$, with no intrinsic notion of volume to aid normalization, unlike the determinant of SPD matrices. We apply our construction for up to $p=200$ in generative modeling of SPD matrices on a difficult synthetic bimodal target, and in generating brain connectivity networks by models trained on fMRI data; as well as in intrinsic diffusion on the SPD manifold.

Related papers

• Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth [73.08853228981701]
  Matrix chain multiplication is a problem in scientific computing, machine learning, and graph analysis.<n>We present emphTwo-Tower Matrix, a quantum subroutine that encodes the product $mathcalW$ of the $K$ matrices into a quantum state in circuit depth.
  arXiv  Detail & Related papers  (2026-07-14T18:42:40Z)
• Efficient Mean Curvature Computation on High-Dimensional Data Manifolds [52.452902154360565]
  Estimating local mean curvature at each point of a high-dimensional dataset is a key ingredient of machine learning algorithms.<n>This paper introduces two complementary contributions that together reduce this cost by several orders of magnitude.<n> Experiments on real-world datasets confirm speedups of 50 to 300 times relative to the original implementation.
  arXiv  Detail & Related papers  (2026-06-04T16:04:31Z)
• Sign Embedding Quantum Algorithms for Matrix Equations and Matrix Functions [4.591453488105558]
  We develop a framework of operator-output quantum algorithms for matrix equations and matrix functions.<n>For ordinary Sylvester equations, we offer an explicit block-encoding of the target matrix solution.<n>These algorithms propagate the same overlap-based normalization bookkeeping to ordinary and generalized equations.
  arXiv  Detail & Related papers  (2026-04-28T07:50:42Z)
• Time evolution of quantum gates and the necessity of complex numbers [0.0]
  We describe a simple scheme in which the effect of a quantum gate is described by the action of an effective Hamiltonian acting for some characteristic time.<n>The role of the complex phase in bringing about the entanglement of two qubits is also highlighted.<n>We investigate the endomorphism of real vector spaces of dimension $N = 2n$, where $n in mathbbZ+$, suitable for the modelling of $n-1$ qubits.
  arXiv  Detail & Related papers  (2026-04-18T17:47:56Z)
• Robust Automatic Differentiation of Square-Root Kalman Filters via Gramian Differentials [3.542663650865005]
  Square-root Kalman filters propagate state covariances in Cholesky-factor form for numerical stability.<n>Their core operation, triangularization of a matrix $M in mathbbRn times m$, is computed via a QR decomposition in practice.<n>We extend it to rank-deficient inputs via a two-component decomposition: a column-space term based on the Moore--Penrose pseudoinverse, and a null-space correction for perturbations outside the column space of $M$.
  arXiv  Detail & Related papers  (2026-03-13T19:55:08Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• CDFlow: Building Invertible Layers with Circulant and Diagonal Matrices [2.6154833242452864]
  We introduce a novel invertible linear layer based on the product of circulant and diagonal matrices.<n>This decomposition reduces parameter complexity from $mathcalO(n2)$ to $mathcalO(mn)$.<n>We build upon this layer to develop Circulant-Diagonal Flow (CDFlow), which achieves strong density estimation on natural image datasets.
  arXiv  Detail & Related papers  (2025-10-29T09:38:50Z)
• High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces [48.465738895704455]
  We construct path matrices for decomposition of Cartesian tensors up to rank $n=9$ with reduced and affordable complexity.<n>Our method avoids the RREF algorithm and maintains a fully analytical derivation of each ICT decomposition matrix.<n>We extend our result to the arbitrary tensor product and direct sum spaces, enabling free design between different spaces while keeping symmetry.
  arXiv  Detail & Related papers  (2024-12-24T08:25:38Z)
• Matrix logistic map: fractal spectral distributions and transfer of chaos [0.0]
  We show that for an arbitrary initial ensemble of hermitian random matrices with a continuous level density supported on the interval $[0,1]$, the level density converges to the invariant measure of the logistic map.<n>This approach generalizes the known model of coupled logistic maps, and allows us to study the transition to chaos in complex networks and multidimensional systems.
  arXiv  Detail & Related papers  (2023-03-10T19:19:56Z)
• $O(N^2)$ Universal Antisymmetry in Fermionic Neural Networks [107.86545461433616]
  We propose permutation-equivariant architectures, on which a determinant Slater is applied to induce antisymmetry. FermiNet is proved to have universal approximation capability with a single determinant, namely, it suffices to represent any antisymmetric function. We substitute the Slater with a pairwise antisymmetry construction, which is easy to implement and can reduce the computational cost to $O(N2)$.
  arXiv  Detail & Related papers  (2022-05-26T07:44:54Z)
• Hybrid Model-based / Data-driven Graph Transform for Image Coding [54.31406300524195]
  We present a hybrid model-based / data-driven approach to encode an intra-prediction residual block. The first $K$ eigenvectors of a transform matrix are derived from a statistical model, e.g., the asymmetric discrete sine transform (ADST) for stability. Using WebP as a baseline image, experimental results show that our hybrid graph transform achieved better energy compaction than default discrete cosine transform (DCT) and better stability than KLT.
  arXiv  Detail & Related papers  (2022-03-02T15:36:44Z)
• Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via GDPA Linearization [59.87663954467815]
  Algorithm unfolding creates an interpretable and parsimonious neural network architecture by implementing each iteration of a model-based algorithm as a neural layer. In this paper, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we unroll a projection-free algorithm for semi-definite programming relaxation (SDR) of a binary graph. Experimental results show that our unrolled network outperformed pure model-based graph classifiers, and achieved comparable performance to pure data-driven networks but using far fewer parameters.
  arXiv  Detail & Related papers  (2021-09-10T07:01:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.