A stochastic algorithm finding generalized means on compact manifolds
Marc Arnaudon (IMB), Laurent Miclo (IMT)

TL;DR
This paper introduces a stochastic algorithm that computes generalized means on compact Riemannian manifolds using a simulated annealing approach, requiring only samples from the probability measure.
Contribution
It presents a novel stochastic method for finding generalized means on manifolds, applicable to various distance functions and divergences, with theoretical convergence guarantees.
Findings
Algorithm successfully computes generalized means on manifolds.
Convergence proven using spectral gap estimates and annealing techniques.
Applicable to p-means, Finsler metrics, and divergence-based means.
Abstract
A stochastic algorithm is proposed, finding the set of generalized means associated to a probability measure on a compact Riemannian manifold M and a continuous cost function on the product of M by itself. Generalized means include p-means for p>0, computed with any continuous distance function, not necessarily the Riemannian distance. They also include means for lengths computed from Finsler metrics, or for divergences. The algorithm is fed sequentially with independent random variables Y_n distributed according to the probability measure on the manifold and this is the only knowledge of this measure required. It evolves like a Brownian motion between the times it jumps in direction of the Y_n. Its principle is based on simulated annealing and homogenization, so that temperature and approximations schemes must be tuned up. The proof relies on the investigation of the evolution of a…
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.
