REVIEW 2 cited by
First-order Conditions for Optimization in the Wasserstein Space
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We study first-order optimality conditions for constrained optimization in the Wasserstein space, whereby one seeks to minimize a real-valued function over the space of probability measures endowed with the Wasserstein distance. Our analysis combines recent insights on the geometry and the differential structure of the Wasserstein space with more classical calculus of variations. We show that simple rationales such as "setting the derivative to zero" and "gradients are aligned at optimality" carry over to the Wasserstein space. We deploy our tools to study and solve optimization problems in the setting of distributionally robust optimization and statistical inference. The generality of our methodology allows us to naturally deal with functionals, such as mean-variance, Kullback-Leibler divergence, and Wasserstein distance, which are traditionally difficult to study in a unified framework.
Forward citations
Cited by 2 Pith papers
-
Sensitivity of functionals of McKean-Vlasov SDE's with respect to the initial distribution
For McKean-Vlasov SDEs, the derivative of the distributionally robust value at zero perturbation is the L2 norm of an adjoint tangent-flow operator applied to the L-derivative of the objective.
-
Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces
The paper gives global convergence and oracle complexity bounds for a Wasserstein-space minimax algorithm that finds continuous least favorable distributions via transport maps and modified JKO steps.
Discussion (0). Continue with ORCID to comment.