RIEMANNIAN HAMILTONIAN METHODS FOR MIN-MAX OPTIMIZATION ON MANIFOLDS.

In this paper, we study min-max optimization problems on Riemannian manifolds. We introduce a Riemannian Hamiltonian function, minimization of which serves as a proxy for solving the original min-max problems. Under the Riemannian Polyak-Lojasiewicz condition on the Hamiltonian function, its minimizer corresponds to the desired min-max saddle point. We also provide cases where this condition is satisfied. For geodesic-bilinear optimization in particular, solving the proxy problem leads to the correct search direction towards global optimality, which becomes challenging with the min-max formulation. To minimize the Hamiltonian function, we propose Riemannian Hamiltonian methods (RHMs) and present their convergence analyses. We extend RHMs to include consensus regularization and to the stochastic setting. We illustrate the efficacy of the proposed RHMs in applications such as subspace robust Wasserstein distance, robust training of neural networks, and generative adversarial networks. [ABSTRACT FROM AUTHOR]