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

• URL: http://arxiv.org/abs/2605.18316v1
• Date: Mon, 18 May 2026 12:34:44 GMT
• Title: Dynamic Elliptical Graph Factor Models via Riemannian Optimization with Geodesic Temporal Regularization
• Abstract summary: In this paper we propose dynamic estimation on the Grassmann manifold with a factor model (textscDegfm)<n>We model the time-varying precision matrix sequence as a low-rank-plus-diagonal structure governed by a latent elliptical graph factor model.<n>Experiments on both synthetic benchmarks and real-world datasets demonstrate that textscDegfm consistently outperforms state-of-the-art evaluations.
• Score: 1.7430416823420511
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• Riemannian gradient descent for Hartree-Fock theory [0.0]
  We present an optimization framework for Hartree-Fock theory formulated directly in the Sobolev space $H1$.<n>Explicit expressions for Euclidean and Riemannian gradients, tangent-space projections, and retractions are derived.<n>The proposed formulation provides a geometrically consistent and discretization-independent perspective on electronic structure optimization.
  arXiv  Detail & Related papers  (2026-03-16T19:58:42Z)
• Riemannian Flow Matching for Disentangled Graph Domain Adaptation [51.98961391065951]
  Graph Domain Adaptation (GDA) typically uses adversarial learning to align graph embeddings in Euclidean space.<n>DisRFM is a geometry-aware GDA framework that unifies embedding and flow-based transport.
  arXiv  Detail & Related papers  (2026-01-31T11:05:35Z)
• Riemannian Liquid Spatio-Temporal Graph Network [6.583503277841693]
  Liquid-Constant networks (LTCs) excel at modeling irregularly-sampled dynamics but are fundamentally confined to Euclidean space.<n>This limitation introduces significant geometric distortion when representing real-world graphs with inherent non-Euclidean structures.<n>We introduce a framework that unifies continuous-time liquid dynamics with inductive inductive geometric biases.<n>RLSTG achieves superior performance on graphs with complex structures.
  arXiv  Detail & Related papers  (2026-01-20T16:09:05Z)
• Riemannian Zeroth-Order Gradient Estimation with Structure-Preserving Metrics for Geodesically Incomplete Manifolds [57.179679246370114]
  We construct metrics that are geodesically complete while ensuring that every stationary point under the new metric remains stationary under the original one.<n>An $$-stationary point under the constructed metric $g'$ also corresponds to an $$-stationary point under the original metric $g'$.<n>Experiments on a practical mesh optimization task demonstrate that our framework maintains stable convergence even in the absence of geodesic completeness.
  arXiv  Detail & Related papers  (2026-01-12T22:08:03Z)
• Guaranteed Noisy CP Tensor Recovery via Riemannian Optimization on the Segre Manifold [9.804487437104289]
  We exploit the intrinsic geometry of rank-one tensors by casting the recovery task as an optimization problem over the Segre manifold.<n>We prove that RGD converges at a local linear rate, while RGN exhibits an initial local quadratic convergence phase that transitions to a linear rate as the iterates approach the statistical noise floor.
  arXiv  Detail & Related papers  (2025-10-01T06:44:52Z)
• Follow the Energy, Find the Path: Riemannian Metrics from Energy-Based Models [63.331590876872944]
  We propose a method for deriving Riemannian metrics directly from pretrained Energy-Based Models.<n>These metrics define spatially varying distances, enabling the computation of geodesics.<n>We show that EBM-derived metrics consistently outperform established baselines.
  arXiv  Detail & Related papers  (2025-05-23T12:18:08Z)
• GeoERM: Geometry-Aware Multi-Task Representation Learning on Riemannian Manifolds [14.251447722365661]
  Multi-Task Learning (MTL) seeks to boost statistical power and learning efficiency by discovering structure shared across related tasks.<n>We propose GeoERM, a geometry-aware MTL framework that embeds the shared representation on its natural Riemannian manifold.<n>We show that GeoERM consistently improves estimation accuracy, reduces negative transfer, and remains stable under adversarial label noise.
  arXiv  Detail & Related papers  (2025-05-05T18:56:16Z)
• Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent [25.846262685970164]
  This paper proposes and analyzes a gradient-type algorithm based on Burer-Monteiro factorization.<n>It reconstructs the point set configuration from partial Euclidean distance measurements.
  arXiv  Detail & Related papers  (2025-04-28T07:13:23Z)
• Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
  This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces [93.35384756718868]
  min-max algorithms have been analyzed in the Euclidean setting. We prove that the extraiteient (RCEG) method corrected lastrate convergence at a linear rate.
  arXiv  Detail & Related papers  (2022-06-04T18:53:44Z)

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.