arXiv:2606.15442stat.MLcs.LG2026-06

提出新型坐标系,让正定矩阵生成更高效且几何直观。

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

论文配图:The Reverse Telescoping Coordinate System for Positive Definite Matrices: Geometry, Computation, and Generative Modeling
图 1 · 摘自论文原文
  • 用反向递推映射将正定矩阵转为无约束变量,保留矩阵及其逆的完整信息。
  • 关键计算在变换域只需O(p²),结果还原才需O(p³),显著提速。
  • 适合生成正定矩阵数据,如脑连接网络建模与流形扩散模拟。

我们设计了一种新的无约束坐标系统,将p×p对称正定(SPD)矩阵Θ表示为反向递推映射Θ(x)=RT(x),其中x=(v,d,r)∈ℝ×ℝ^(p−1)×ℝ^(p(p−1)/2),分别代表对数体积(或对数行列式)、形状信息(含对数相对对角尺度和节点间部分协方差)。该构造具有独特性质:雅可比仅依赖对数行列式,且变量x能无损编码矩阵及其逆。许多涉及矩阵及其逆的计算可在变换域以O(p²)完成,而结果转回矩阵形式需O(p³)开销。此外,变换域中两个行列式为1的矩阵可通过直线路径连接,且路径上始终保持单位行列式。在生成建模中,这允许构建分量体积-形状流模型,通过条件流匹配训练,沿单位行列式路径传输形状,并单独使用一维流处理体积/行列式。原本严苛的SPD约束经此转化成为强大引导,揭示了在行列式归一化下设计形状流反而比在无约束ℝ^(p×p)空间更易实现。我们在合成双峰目标上成功应用至p=200,并在基于fMRI数据训练的脑连接网络生成及SPD流形上的内在扩散中验证有效性。

原文摘要 · Abstract (English)

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.

正定矩阵生成建模流模型脑网络

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。