In the past few years, there has been considerable interest in two promi...
In this work, we present the Bregman Alternating Projected Gradient (BAP...
Gromov Wasserstein (GW) distance is a powerful tool for comparing and
al...
Graph alignment, which aims at identifying corresponding entities across...
Nonconvex-nonconcave minimax optimization has been the focus of intense
...
The optimal design of experiments typically involves solving an NP-hard
...
Distributionally robust optimization has been shown to offer a principle...
Nonconvex-concave minimax optimization has received intense interest in
...
Graph Neural Networks (GNNs) are widely applied for graph anomaly detect...
In this paper, we study the design and analysis of a class of efficient
...
Finding multiple solutions of non-convex optimization problems is a
ubiq...
We introduce a robust optimization method for flip-free distortion energ...
Wasserstein Distributionally Robust Optimization
(DRO) is concerned with...
Many contemporary applications in signal processing and machine learning...
We analyze the Gambler's problem, a simple reinforcement learning proble...
Wasserstein distance-based distributionally robust optimization (DRO) ha...
Policy optimization on high-dimensional continuous control tasks exhibit...