Fetching the paper…
Reading the bibliography…
We introduce a new class of Frank-Wolfe algorithms for minimizing differentiable functionals over probability measures.
“Maxima for Graphs and a New Proof of a Theorem of Turán”
Theodore. Motzkin and Ernst. Straus · 1965
Earlier work this paper cites.
“The Existence of Probability Measures with Given Marginals”
V. Strassen · 1965
Earlier work this paper cites.
“Convex Analysis”, Princeton Landmarks in Mathematics and Physics
R.T. Rockafellar · 1970
Earlier work this paper cites.
“Functional Analysis”, Classics in mathematics / Springer
K. Yoshida · 1980
Earlier work this paper cites.
“Optimal methods for smooth convex minimization”
A.. Nemirovski and Yu.. Nesterov · 1985
Earlier work this paper cites.
“Optimal Rates of Convergence for Deconvolving a Density”
Raymond. Carroll and Peter Hall · 1988
Earlier work this paper cites.
“A Convexity Principle for Interacting Gases”
Robert. McCann · 1997
Earlier work this paper cites.
“Introductory Lectures on Convex Optimization: A Basic Course”, Applied Optimization
Y. Nesterov · 2003
Earlier work this paper cites.
“Gradient Flows: In Metric Spaces and in the Space of Probability Measures”, Lectures in Mathematics. ETH Zürich
L. Ambrosio, N. Gigli and G. Savare · 2005
Earlier work this paper cites.
“Construction of the Parallel Transport in the Wasserstein Space”
Luigi Ambrosio and Nicola Gigli · 2008
Earlier work this paper cites.
“Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions”
A. Hantoute, M.. López and C. Zălinescu · 2008
Earlier work this paper cites.
“A Course on Borel Sets”
Shashi. Srivastava · 2008
Earlier work this paper cites.
“Optimal Transport: Old and New”, Grundlehren der mathematischen Wissenschaften
C. Villani · 2008
Earlier work this paper cites.
“Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems”
Erick Delage and Yinyu Ye · 2010
Earlier work this paper cites.
“Distributionally Robust Optimization and Its Tractable Approximations”
Joel Goh and Melvyn Sim · 2010
Earlier work this paper cites.
“Foundations of Optimization”, Graduate Texts in Mathematics
O. G\"uler · 2010
Earlier work this paper cites.
“Deconvolution for the Wasserstein metric and geometric inference”
Claire Caillerie, Frédéric Chazal, Jérôme Dedecker and Bertrand Michel · 2011
Earlier work this paper cites.
“A Kernel Two-Sample Test”
Arthur Gretton et al · 2012
Earlier work this paper cites.
“Sinkhorn Distances: Lightspeed Computation of Optimal Transport”
Marco Cuturi · 2013
Earlier work this paper cites.
“First-order methods of smooth convex optimization with inexact oracle”
Olivier Devolder, Francois Glineur and Yurii Nesterov · 2014
Earlier work this paper cites.
“Generative Adversarial Nets”
Ian. Goodfellow et al · 2014
Earlier work this paper cites.
“Distributionally Robust Convex Optimization”
Wolfram Wiesemann, Daniel Kuhn and Melvyn Sim · 2014
Earlier work this paper cites.
“Optimal Transport for Applied Mathematicians: Calculus of Variations, PDEs, and Modeling”, Progress in Nonlinear Differential Equations and Their Applications
F. Santambrogio · 2015
Earlier work this paper cites.
“Quantifying Distributional Model Risk Via Optimal Transport”
Jose Blanchet and Karthyek Murthy · 2016
Earlier work this paper cites.
“Distributionally Robust Stochastic Optimization with Wasserstein Distance”
Rui Gao and A. Kleywegt · 2016
Cited alongside, same era.
“Stochastic Optimization for Large-scale Optimal Transport”
Aude Genevay, Marco Cuturi, Gabriel Peyr\’e and Francis Bach · 2016
Cited alongside, same era.
“Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithm”
Qiang Liu and Dilin Wang · 2016
Cited alongside, same era.
“Stochastic Gradient Methods for Distributionally Robust Optimization with F-Divergences”
Hongseok Namkoong and John. Duchi · 2016
Cited alongside, same era.
“Nonconvex gradient flow in the Wasserstein metric and applications to constrained nonlocal interactions”
Katy Craig · 2017
Cited alongside, same era.
“Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls”
“Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning”
Daniel Kuhn, Peyman Esfahani, V. Nguyen and Soroosh Shafieezadeh-Abadeh · 2019
Later among the works it cites.
“A First-Order Algorithmic Framework for Distributionally Robust Logistic Regression”
Jiajin Li, Sen Huang and Anthony Man-Cho So · 2019
Later among the works it cites.
“Understanding and Accelerating Particle-Based Variational Inference”
Chang Liu et al · 2019
Later among the works it cites.
“Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm”
Giulia Luise, Saverio Salzo, Massimiliano Pontil and Carlo Ciliberto · 2019
Later among the works it cites.
“Optimal Transport Relaxations with Application to Wasserstein GANs”
S. Mahdian, J. Blanchet and P. Glynn · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Grani. Hanasusanto and Daniel Kuhn · 2017
Cited alongside, same era.
Jose Blanchet, Karthyek Murthy and Fan Zhang · 2018
Cited alongside, same era.
Jose Blanchet, Karthyek Murthy and Fan Zhang · 2018
Cited alongside, same era.
“Probabilistic Theory of Mean Field Games with Applications II: Mean Field Games with Common Noise and Master Equations”, Probability Theory and Stochastic Modelling
R. Carmona and F. Delarue · 2018
Cited alongside, same era.
“Data-Driven Chance Constrained Programs over Wasserstein Balls”
Z. Chen, D. Kuhn and W. Wiesemann · 2018
Cited alongside, same era.
“On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport”
L\’ena\"c Chizat and Francis Bach · 2018
Cited alongside, same era.
“Efficient Stochastic Gradient Descent for Learning with Distributionally Robust Optimization”, 2018
Soumyadip Ghosh, Mark Squillante and Ebisa Wollega · 2018
Cited alongside, same era.
“Sobolev Descent”
Youssef Mroueh, Tom Sercu and Anant Raj · 2019
Later among the works it cites.
“Distributionally Robust Optimization and Generalization in Kernel Methods”
Matthew Staib and Stefanie Jegelka · 2019
Later among the works it cites.
“Accelerated Flow for Probability Distributions”
Amirhossein Taghvaei and Prashant Mehta · 2019
Later among the works it cites.
“Limits of random walks with distributionally robust transition probabilities”
D. Bartl, S. Eckstein and M. Kupper · 2020
Later among the works it cites.
“Computational aspects of robust optimized certainty equivalents and option pricing”
Daniel Bartl, Samuel Drapeau and Ludovic Tangpi · 2020
Later among the works it cites.
“Gradient descent algorithms for Bures-Wasserstein barycenters”
Sinho Chewi, Tyler Maunu, Philippe Rigollet and Austin J. Stromme · 2020
Later among the works it cites.
“Smoothness and Stability in GANs”
Casey Chu, Kentaro Minami and Kenji Fukumizu · 2020
Later among the works it cites.
“Estimating Barycenters of Measures in High Dimensions”
Samuel Cohen, Michael Arbel and Marc. Deisenroth · 2020
Later among the works it cites.
“Large-Scale Methods for Distributionally Robust Optimization”
Daniel Levy, Yair Carmon, John Duchi and Aaron Sidford · 2020
Later among the works it cites.
“Infinite-Dimensional Game Optimization via Variational Transport”
L. Liu et al · 2020
Later among the works it cites.
“Equitable and Optimal Transport with Multiple Agents”
M. Scetbon, Laurent Meunier, J. Atif and Marco Cuturi · 2020
Later among the works it cites.
“A Distributionally Robust Approach to Fair Classification”
Bahar Taskesen, V. Nguyen, Daniel Kuhn and J. Blanchet · 2020
Later among the works it cites.
“From Data to Decisions: Distributionally Robust Optimization Is Optimal”
Bart P.. Van, Peyman Esfahani and Daniel Kuhn · 2020
Later among the works it cites.
“Variational Policy Gradient Method for Reinforcement Learning with General Utilities”
Junyu Zhang et al · 2020
Later among the works it cites.
“Variational Policy Gradient Method for Reinforcement Learning with General Utilities”
Junyu Zhang et al · 2020
Later among the works it cites.
“Data-Driven Distributionally Robust Unit Commitment With Wasserstein Metric: Tractable Formulation and Efficient Solution Method”
X. Zheng and H. Chen · 2020
Later among the works it cites.
A. Zhou, M. Yang, M. Wang and Y. Zhang · 2020
Later among the works it cites.
“On distributionally robust chance constrained programs with Wasserstein distance”
Weijun Xie · 2021
Closest in time.
“An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note”
T.C.E. Cheng and Mikhail. Kovalyov · 2091
Closest in time.