arXiv:2605.18316cs.LGcs.GR2026-05

提出新方法动态建模时变图结构,兼顾几何特性与时间连续性。

Dynamic Elliptical Graph Factor Models via Riemannian Optimization with Geodesic Temporal Regularization

论文配图:Dynamic Elliptical Graph Factor Models via Riemannian Optimization with Geodesic Temporal Regularization
图 1 · 摘自论文原文
  • 基于低秩加对角结构的椭圆因子模型,降低参数量
  • 在格拉斯曼流形上用测地线正则化保证时间轨迹平滑
  • 适用于小样本高维数据,尤其适合神经科学等场景

从高维节点观测中推断时变图结构是神经科学、金融学、气候学等领域中的基础问题。两大内在挑战在于:保持潜在图在相邻观测窗口间的时序一致性,以及尊重精度矩阵自然位于对称正定流形上的固有黎曼几何特性——该曲面的测地线结构与欧氏空间截然不同。本文提出一种在格拉斯曼流形上使用因子模型的动态估计方法(Degfm),联合解决上述挑战。将时变精度矩阵序列建模为低秩加对角结构,由潜藏的椭圆图因子模型控制,大幅减少有效参数量,实现小样本条件下的可靠估计。通过定义在格拉斯曼流形上的黎曼测地线惩罚项,强制图轨迹沿内在几何路径平滑演化,而非欧氏空间。针对具有低秩加对角约束的非凸优化问题,推导出一种高效黎曼梯度下降算法,在每一步迭代中均保留流形结构,并严格证明其收敛至驻点。在合成基准和真实数据集上的大量实验表明,Degfm 在所有评估指标上持续优于现有先进基线,验证了该框架的实用性。

原文摘要 · Abstract (English)

Inferring time-varying graph structures from high-dimensional nodal observations is a fundamental problem arising in neuroscience, finance, climatology, and beyond. Two intrinsic challenges govern this problem: maintaining the \emph{temporal coherence} of the latent graph across successive observation windows, and respecting the \emph{intrinsic Riemannian geometry} of the symmetric positive definite manifold on which precision matrices naturally reside, a curved space whose geodesic structure departs fundamentally from that of the ambient Euclidean space. In this paper we propose dynamic estimation on the Grassmann manifold with a factor model (\textsc{Degfm}), a novel algorithm that jointly addresses both challenges. We model the time-varying precision matrix sequence as a low-rank-plus-diagonal structure governed by a latent elliptical graph factor model, which drastically reduces the effective parameter count and enables reliable estimation in the challenging small-sample regime. Temporal coherence is enforced through a Riemannian geodesic penalty defined on the Grassmann manifold, ensuring that the estimated graph trajectory is smooth with respect to the intrinsic geometry rather than the ambient Euclidean space. To solve the resulting non-convex optimization problem over Grassmann-manifold-valued sequences subject to the LRaD constraint, we derive an efficient Riemannian gradient descent algorithm that respects the manifold structure at every iterate and rigorously establish its convergence to a stationary point. Extensive experiments on both synthetic benchmarks and real-world datasets demonstrate that \textsc{Degfm} consistently outperforms state-of-the-art baselines across all evaluation metrics, confirming the practical effectiveness of the proposed framework.

图学习黎曼优化时变模型低秩建模

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