On a class of geodesically convex optimization problems solved via Euclidean MM methods
원문 초록
We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling, M-estimators for covariances, and Brascamp-Lieb inequalities. Our work offers efficient algorithms that on the one hand exploit g-convexity to ensure global optimality along with guarantees on iteration complexity. On the other hand, the split structure permits us to develop Euclidean Majorization-Minorization algorithms that help us bypass the need to compute expensive Riemannian operations such as exponential maps and parallel transport. We illustrate our results by specializing them to a few concrete optimization problems that have been previously studied in the machine learning literature. Ultimately, we hope our work helps motivate the broader search for mixed Euclidean-Riemannian optimization algorithms
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.