2 papers
math.OC2025
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
Andi Han, Pierre-Louis Poirion, Akiko Takeda
Optimization with orthogonality constraints frequently arises in various fields such as machine learning. Riemannian optimization offers a powerful framework for solving these prob…
math.OC2025
The Adaptive Complexity of Finding a Stationary Point
Huanjian Zhou, Andi Han, Akiko Takeda +1
In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study th…