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--{\L}ojasiewicz 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 (RHM) and present their convergence analyses. We extend RHM to include consensus regularization and to the stochastic setting. We illustrate the efficacy of the proposed RHM in applications such as subspace robust Wasserstein distance, robust training of neural networks, and generative adversarial networks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
Riemannian Optimization on Relaxed Indicator Matrix Manifold
Causal Abstraction Learning based on the Semantic Embedding Principle
A Spectral Framework for Tracking Communities in Evolving Networks
Elliptical Wishart distributions: information geometry, maximum likelihood estimator, performance analysis and statistical learning
The Gaussian Discriminant Variational Autoencoder (GdVAE): A Self-Explainable Model with Counterfactual Explanations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.