Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein space

MZ Diao, K Balasubramanian… - … on Machine Learning, 2023 - proceedings.mlr.press
Variational inference (VI) seeks to approximate a target distribution $\pi $ by an element of a
tractable family of distributions. Of key interest in statistics and machine learning is Gaussian …

From symmetry to geometry: Tractable nonconvex problems

Y Zhang, Q Qu, J Wright - arxiv preprint arxiv:2007.06753, 2020 - arxiv.org
As science and engineering have become increasingly data-driven, the role of optimization
has expanded to touch almost every stage of the data analysis pipeline, from signal and …

Projection robust Wasserstein distance and Riemannian optimization

T Lin, C Fan, N Ho, M Cuturi… - Advances in neural …, 2020 - proceedings.neurips.cc
Projection robust Wasserstein (PRW) distance, or Wasserstein projection pursuit (WPP), is a
robust variant of the Wasserstein distance. Recent work suggests that this quantity is more …

Understanding notions of stationarity in nonsmooth optimization: A guided tour of various constructions of subdifferential for nonsmooth functions

J Li, AMC So, WK Ma - IEEE Signal Processing Magazine, 2020 - ieeexplore.ieee.org
Many contemporary applications in signal processing and machine learning give rise to
structured nonconvex nonsmooth optimization problems that can often be tackled by simple …

Decentralized Riemannian gradient descent on the Stiefel manifold

S Chen, A Garcia, M Hong… - … on Machine Learning, 2021 - proceedings.mlr.press
We consider a distributed non-convex optimization where a network of agents aims at
minimizing a global function over the Stiefel manifold. The global function is represented as …

First-order algorithms for min-max optimization in geodesic metric spaces

M Jordan, T Lin… - Advances in Neural …, 2022 - proceedings.neurips.cc
From optimal transport to robust dimensionality reduction, many machine learning
applicationscan be cast into the min-max optimization problems over Riemannian manifolds …

A riemannian admm

J Li, S Ma, T Srivastava - arxiv preprint arxiv:2211.02163, 2022 - arxiv.org
We consider a class of Riemannian optimization problems where the objective is the sum of
a smooth function and a nonsmooth function, considered in the ambient space. This class of …

Arcs: Accurate rotation and correspondence search

L Peng, MC Tsakiris, R Vidal - Proceedings of the IEEE/CVF …, 2022 - openaccess.thecvf.com
This paper is about the old Wahba problem in its more general form, which we call"
simultaneous rotation and correspondence search". In this generalization we need to find a …

A Riemannian Smoothing Steepest Descent Method for Non-Lipschitz Optimization on Embedded Submanifolds of

C Zhang, X Chen, S Ma - Mathematics of Operations …, 2024 - pubsonline.informs.org
In this paper, we study the generalized subdifferentials and the Riemannian gradient
subconsistency that are the basis for non-Lipschitz optimization on embedded submanifolds …

A Riemannian proximal Newton method

W Si, PA Absil, W Huang, R Jiang, S Vary - SIAM Journal on Optimization, 2024 - SIAM
In recent years, the proximal gradient method and its variants have been generalized to
Riemannian manifolds for solving optimization problems with an additively separable …