Geometric design of the tangent term in landing algorithms for orthogonality constraints
Florentin Goyens, P.-A. Absil, Florian Feppon

TL;DR
This paper introduces a new family of metrics for the set of full-rank matrices, extending the $eta$-metric on the Stiefel manifold, to improve landing algorithms for orthogonality-constrained optimization.
Contribution
It proposes a novel family of metrics tailored for full-rank matrices, enhancing the geometric framework for orthogonality-constrained optimization problems.
Findings
New metrics extend the $eta$-metric to full-rank matrices.
Application to landing algorithms improves optimization under orthogonality constraints.
Provides a geometric foundation for better algorithm design.
Abstract
We propose a family a metrics over the set of full-rank real matrices, and apply them to the landing framework for optimization under orthogonality constraints. The family of metrics we propose is a natural extension of the -metric, defined on the Stiefel manifold.
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.
