72%Highly rated
?Highly ratedVote to see the score
Difference of Convex Programming in the Wasserstein Space with Applications to MMD Optimization
A difference-of-convex convex-concave procedure is lifted to Wasserstein space for non-convex measure optimization, yielding almost-stationary iterates and explicit decompositions for MMD and energy distance with faster convergence.
Paris Poster Session 4, Thu, Dec 10, 5:30 PM–7:30 PM, Paris Poster Hall · Published 2026
– ReadersNo votes yet
8/20 AI panelreviewers recommend it
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
AI panel: 8 of 20 reviewers recommend it
lenient 2/5
medium 4/10
strict 2/5