Distributed Riemannian Stochastic Gradient Tracking Algorithm on the Stiefel Manifold
Jishu Zhao, Xi Wang, Jinlong Lei

TL;DR
This paper introduces a distributed Riemannian stochastic gradient tracking algorithm on the Stiefel manifold for multi-agent systems, addressing stochastic gradient estimation noise and proving convergence with different sample size strategies.
Contribution
It proposes a novel algorithm combining variable sample size gradient approximation with gradient tracking on the Stiefel manifold, improving efficiency and convergence analysis.
Findings
Algorithm converges to stationary points under fixed step sizes.
Increasing sample size reduces noise and improves convergence.
Numerical experiments validate theoretical convergence results.
Abstract
This paper focus on investigating the distributed Riemannian stochastic optimization problem on the Stiefel manifold for multi-agent systems, where all the agents work collaboratively to optimize a function modeled by the average of their expectation-valued local costs. Each agent only processes its own local cost function and communicate with neighboring agents to achieve optimal results while ensuring consensus. Since the local Riemannian gradient in stochastic regimes cannot be directly calculated, we will estimate the gradient by the average of a variable number of sampled gradient, which however brings about noise to the system. We then propose a distributed Riemannian stochastic optimization algorithm on the Stiefel manifold by combining the variable sample size gradient approximation method with the gradient tracking dynamic. It is worth noticing that the suitably chosen…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition
