Numerical Accuracy of Ladder Schemes for Parallel Transport on Manifolds
Nicolas Guigui (UCA, Inria, EPIONE), Xavier Pennec (UCA, Inria,, EPIONE)

TL;DR
This paper analyzes the numerical accuracy and convergence of ladder schemes like Schild's and pole ladder for parallel transport on manifolds, demonstrating quadratic convergence and practical effectiveness across various spaces.
Contribution
It provides a Taylor approximation analysis of ladder methods, proves quadratic convergence even with approximate geodesics, and links Schild's ladder to the Fanning Scheme for better understanding.
Findings
Ladder methods converge quadratically with iteration.
The Fanning Scheme converges linearly, explained via a new link.
Theoretical error bounds match high-accuracy practical measurements.
Abstract
Parallel transport is a fundamental tool to perform statistics on Rie-mannian manifolds. Since closed formulae don't exist in general, practitioners often have to resort to numerical schemes. Ladder methods are a popular class of algorithms that rely on iterative constructions of geodesic parallelograms. And yet, the literature lacks a clear analysis of their convergence performance. In this work, we give Taylor approximations of the elementary constructions of Schild's ladder and the pole ladder with respect to the Riemann curvature of the underlying space. We then prove that these methods can be iterated to converge with quadratic speed, even when geodesics are approximated by numerical schemes. We also contribute a new link between Schild's ladder and the Fanning Scheme which explains why the latter naturally converges only linearly. The extra computational cost of ladder methods is…
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.
