Incremental Aggregation on the Grassmannian for Asynchronous Eigenspace Computation

• URL: http://arxiv.org/abs/2608.04406v1
• Date: Wed, 05 Aug 2026 03:21:38 GMT
• Title: Incremental Aggregation on the Grassmannian for Asynchronous Eigenspace Computation
• Abstract summary: We study asynchronous optimization for finite-sum eigenspace computation in heterogeneous distributed systems.<n>We propose a Grassmannian incremental aggregation method that refreshes only arriving components and reuses cached gradients.<n> Experiments on serial and distributed PCA demonstrate improved sample efficiency and wall-clock convergence over representative baselines.
• Score: 37.26483427088676
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study asynchronous optimization for finite-sum eigenspace computation in heterogeneous distributed systems. The theoretical foundations for asynchronous eigenspace computation remain scarce, with existing approaches offering limited coverage of dynamics directly on the Grassmannian under stale information. In this paper, we propose a Grassmannian incremental aggregation method that refreshes only arriving components and reuses cached gradients, retaining low per-update cost without global synchronization. The method employs an extrinsic polar update that preserves the intrinsic subspace geometry without requiring parallel transport of stale tangent vectors. Our analysis establishes a tight angle-dependent gradient-dominance characterization of the objective and a basin-invariance property for stale aggregated updates. These yield two-phase linear convergence, comprising an explicit broad-basin regime and a sharper local regime, with constants controlled by component spectral spreads. Experiments on serial and distributed PCA demonstrate improved sample efficiency and wall-clock convergence over representative baselines.

Related papers

• K-space Gaussian Representation for Parallel MRI [17.6035099220156]
  We propose K-space Gaussian Representation (KGR), the first explicit continuous formulated directly in the native k-space domain.<n>KGR parameterizes the continuous signal using Gabor-Gaussian primitives with shared spatial geometry, yielding a compact representation that naturally preserves inter-coil correlations.<n>These results suggest that explicit continuous parameterization of native k-space provides a principled framework for integrating continuous signal modeling with structured low-rank reconstruction.
  arXiv  Detail & Related papers  (2026-07-29T13:12:59Z)
• Nonlocal Bayesian Modeling of Continuous Spatio-Temporal Dynamics [9.926231893220061]
  We propose a principled NonLocal S-NL model (BST) for continuous-temporal fields that learns nonlocal coupling while retaining tractable inference.<n> NLBST represents the latent field via a coordinate-based spatial basis expansion and models the sequential process with a continuous-time ODE.<n>A linear-Gssianau observation model enables Kalmanssian-style sequential sparse updates under missing and irregular observations, while the spatial basis representation enables inductive prediction at unmeasured locations without retraining.
  arXiv  Detail & Related papers  (2026-06-12T09:51:07Z)
• Recovering Physical Dynamics from Discrete Observations via Intrinsic Differential Consistency [12.266189649117003]
  We replace local supervision with a global structural constraint.<n>We train a time-conditioned secant velocity field whose deviation from this property serves two purposes.<n>As a training regularizer, it confines the hypothesis space to flows that compose consistently across temporal scales.
  arXiv  Detail & Related papers  (2026-05-08T20:24:32Z)
• Reversible Residual Normalization Alleviates Spatio-Temporal Distribution Shift [0.0]
  We propose Reversible Residual Normalization (NRR), a framework that performs spatially-aware invertible normalization to address distribution shift in both spatial and temporal dimensions.<n>Our approach integrates graph convolutional operations within invertible residual blocks, enabling adaptive normalization that respects the underlying graph structure while maintaining reversibility.
  arXiv  Detail & Related papers  (2026-04-17T08:40:28Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity [51.56484100374058]
  We introduce Ringleader ASGD, the first asynchronous algorithm that attains the theoretical lower bounds for parallel computation.<n>Our analysis further establishes that Ringleader ASGD remains optimal under arbitrary gradient and even time-varying speeds.
  arXiv  Detail & Related papers  (2025-09-26T19:19:15Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Spatio-Temporal Variational Gaussian Processes [26.60276485130467]
  We introduce a scalable approach to Gaussian process inference that combinestemporal-temporal filtering with natural variational inference. We derive a sparse approximation that constructs a state-space model over a reduced set of inducing points. We show that for separable Markov kernels the full sparse cases recover exactly the standard variational GP.
  arXiv  Detail & Related papers  (2021-11-02T16:53:31Z)
• The Connection between Discrete- and Continuous-Time Descriptions of Gaussian Continuous Processes [60.35125735474386]
  We show that discretizations yielding consistent estimators have the property of invariance under coarse-graining' This result explains why combining differencing schemes for derivatives reconstruction and local-in-time inference approaches does not work for time series analysis of second or higher order differential equations.
  arXiv  Detail & Related papers  (2021-01-16T17:11:02Z)
• On dissipative symplectic integration with applications to gradient-based optimization [77.34726150561087]
  We propose a geometric framework in which discretizations can be realized systematically. We show that a generalization of symplectic to nonconservative and in particular dissipative Hamiltonian systems is able to preserve rates of convergence up to a controlled error.
  arXiv  Detail & Related papers  (2020-04-15T00:36:49Z)

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.