Sequential subspace methods on Stiefel manifold optimization
Pengwen Chen, Chung-Kuan Cheng, Chester Holtz

TL;DR
This paper introduces sequential subspace methods for optimizing quadratic functions over Stiefel manifolds, reducing computational complexity and ensuring convergence to high-quality solutions with potential acceleration via Newton directions.
Contribution
It proposes a novel SSM framework that guarantees convergence to qualified critical points in Stiefel manifold optimization, incorporating eigenvector and Newton directions for improved efficiency.
Findings
Guaranteed convergence to qualified critical points
Incorporation of Newton directions accelerates convergence
Effective reduction of high-dimensional problems to low-dimensional subproblems
Abstract
We investigate the minimization of a quadratic function over Stiefel manifolds (the set of all orthogonal - frames in ), which has applications in high-dimensional semi-supervised classification tasks. To reduce the computational complexity, we employ sequential subspace methods(SSM) to transform the high-dimensional problem to a series of low-dimensional ones. In this paper, our goal is to achieve an optimal solution of high quality, referred to as a ''qualified critical point". Qualified critical points are defined as those where the associated multiplier matrix meets specific upper-bound conditions. These points exhibit near-global optimality in quadratic optimization problems. In the context of a general quadratic, SSM generates a sequence of qualified critical points through low-dimensional surrogate regularized models. The convergence to a qualified critical…
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
