Maximum volume coordinates for Grassmann interpolation: Lagrange, Hermite, and errors
Rasmus Jensen, Ralf Zimmermann

TL;DR
This paper introduces a new coordinate system for Grassmann manifold interpolation that avoids matrix decompositions, providing numerical advantages and explicit error bounds, with applications in model reduction and projector interpolation.
Contribution
It proposes maximum-volume coordinates for Grassmann interpolation, offering a numerically efficient alternative to Riemann normal coordinates with explicit error estimates.
Findings
Maximum-volume coordinates are well-conditioned for Grassmann interpolation.
Interpolation error magnitude matches Euclidean space asymptotics.
Numerical experiments validate the effectiveness of the proposed method.
Abstract
We present a novel approach to Riemannian interpolation on the Grassmann manifold. Instead of relying on the Riemannian normal coordinates, i.e. the Riemannian exponential and logarithm maps, we approach the interpolation problem with an alternative set of local coordinates and corresponding parameterizations. A special property of these coordinates is that their calculation does not require any matrix decompositions. This is a numerical advantage over Riemann normal coordinates and many other retractions on the Grassmann manifold, especially when derivative data are to be treated. To estimate the interpolation error, we examine the conditioning of these mappings and state explicit bounds. It turns out that the parameterizations are well-conditioned, but the coordinate mappings are generally not. As a remedy, we introduce maximum-volume coordinates that are based on a search for…
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
TopicsModel Reduction and Neural Networks · Matrix Theory and Algorithms · Tensor decomposition and applications
