Optimization
Fixed-SupportWassersteinBarycenters: ComputationalHardnessandFastAlgorithm
The WBP problem is related to the optimal transport (OT) problem, in that both are based on the Wassersteindistance, buttheWBP issignificantly harder.
Memory-Constrained Algorithms for Convex Optimization
As a summary, this paper makes the following contributions.
Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem
However, all the above results are limited to the deterministic setting.
Graph of Circuits with GNN for Exploring the Optimal Design Space
The design automation of analog circuits poses significant challenges in terms of the large design space, complex interdependencies between circuit specifications, and resource-intensive simulations.
