Fetching the paper…
Reading the bibliography…
We consider optimal transport based distributionally robust optimization (DRO) problems with locally strongly convex transport cost functions and affine decision rules.
1906
Earlier work this paper cites.
Robbins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statistics 22:400–407
1951
Earlier work this paper cites.
Delves LM, Lyness JN (1967) A numerical method for locating the zeros of an analytic function. Math. Comp. 21:543–560
1967
Earlier work this paper cites.
Bertsekas DP (1973) Stochastic optimization problems with nondifferentiable cost functionals. J. Optim. Theory Appl. 12:218–231
1973
Earlier work this paper cites.
Bertsekas DP, Shreve SE (1978) Stochastic optimal control: the discrete time case (Elsevier, Amsterdam)
1978
Earlier work this paper cites.
Polyak BT, Juditsky AB (1992) Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30(4):838–855
1992
Earlier work this paper cites.
Dellnitz M, Schütze O, Zheng Q (2002) Locating all the zeros of an analytic function in one complex variable. J. Comput. Appl. Math. 138(2):325–333
2002
Earlier work this paper cites.
Milgrom P, Segal I (2002) Envelope theorems for arbitrary choice sets. Econometrica 70(2):583–601
2002
Earlier work this paper cites.
Kushner HJ, Yin GG (2003) Stochastic approximation and recursive algorithms and applications , volume 35 of Applications of Mathematics (New York) (Springer-Verlag, New York)
2003
Earlier work this paper cites.
Mokkadem A, Pelletier M (2006) Convergence rate and averaging of nonlinear two-time-scale stochastic approximation algorithms. Ann. Appl. Probab. 16(3):1671–1702
2006
Earlier work this paper cites.
den Boef E, den Hertog D (2007) Efficient line search methods for convex functions. SIAM J. Optim. 18(1):338–363
2007
Earlier work this paper cites.
Nemirovski A, Juditsky A, Lan G, Shapiro A (2008) Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4):1574–1609
2008
Earlier work this paper cites.
Noh Yk, Zhang Bt, Lee D (2010) Generative local metric learning for nearest neighbor classification. Lafferty J, Williams C, Shawe-Taylor J, Zemel R, Culotta A, eds., Advances in Neural Information Processing Systems , volume 23 (Curran Associates, Red Hook, NY)
2010
Cited alongside, same era.
Moulines E, Bach F (2011) Non-asymptotic analysis of stochastic approximation algorithms for machine learning. Shawe-Taylor J, Zemel R, Bartlett P, Pereira F, Weinberger KQ, eds., Advances in Neural Information Processing Systems , volume 24 (Curran Associates, Red Hook, NY)
2011
Cited alongside, same era.
Wang J, Kalousis A, Woznica A (2012) Parametric local metric learning for nearest neighbor classification. Pereira F, Burges CJC, Bottou L, Weinberger KQ, eds., Advances in Neural Information Processing Systems , volume 25 (Curran Associates, Red Hook, NY)
2012
Cited alongside, same era.
Johnson R, Zhang T (2013) Accelerating stochastic gradient descent using predictive variance reduction. Burges CJC, Bottou L, Welling M, Ghahramani Z, Weinberger KQ, eds., Advances in Neural Information Processing Systems 26 , 315–323 (Curran Associates, Red Hood, NY)
Gao R, Xie L, Xie Y, Xu H (2018) Robust hypothesis testing using Wasserstein uncertainty sets. Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds., Advances in Neural Information Processing Systems , volume 31 (Curran Associates, Red Hook, NY)
2018
Closest in time.
Hanasusanto GA, Kuhn D (2018) Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls. Oper. Res. 66(3):849–869
2018
Closest in time.
Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations. Math. Programming 171(1):115–166
2018
Closest in time.
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
Shamir O, Zhang T (2013) Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes. Dasgupta S, McAllester D, eds., Proceedings of the 30th International Conference on Machine Learning , volume 28 of PMLR , 71–79 (PMLR, Atlanta, GA)
2013
Cited alongside, same era.
Defazio A, Bach F, Lacoste-Julien S (2014) SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. Ghahramani Z, Welling M, Cortes C, Lawrence N, Weinberger KQ, eds., Advances in Neural Information Processing Systems 27 , 1646–1654 (Curran Associates, Red Hook, NY)
2014
Cited alongside, same era.
Shapiro A, Dentcheva D, Ruszczyński A (2014) Lectures on stochastic programming , volume 9 of MOS-SIAM Series on Optimization (SIAM, Philadelphia, PA)
2014
Cited alongside, same era.
Shafieezadeh-Abadeh S, Mohajerin Esfahani P, Kuhn D (2015) Distributionally robust logistic regression. Cortes C, Lawrence N, Lee D, Sugiyama M, Garnett R, eds., Advances in Neural Information Processing Systems , volume 28 (Curran Associates, Red Hook, NY)
2015
Cited alongside, same era.
Gao R, Kleywegt AJ (2016) Distributionally robust stochastic optimization with Wasserstein distance. Working paper, Georgia Institute of Technology, Atlanta
2016
Cited alongside, same era.
Allen-Zhu Z (2017) Katyusha: the first direct acceleration of stochastic gradient methods. STOC’17—Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , 1200–1205 (ACM, New York)
2017
Cited alongside, same era.
Gao R, Chen X, Kleywegt AJ (2017) Wasserstein distributional robustness and regularization in statistical learning. Working Paper, Georgia Institute of Technology, Atlanta
2017
Cited alongside, same era.
Yang I (2017) A convex optimization approach to distributionally robust Markov decision processes with Wasserstein distance. IEEE Control Systems Letters 1(1):164–169
2017
Cited alongside, same era.
Sinha A, Namkoong H, Duchi J (2018) Certifiable distributional robustness with principled adversarial training. International Conference on Learning Representations
2018
Closest in time.
Volpi R, Namkoong H, Sener O, Duchi JC, Murino V, Savarese S (2018) Generalizing to unseen domains via adversarial data augmentation. Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds., Advances in Neural Information Processing Systems , volume 31 (Curran Associates, Red Hook, NY)
2018
Closest in time.
2018
Closest in time.
Blanchet J, Murthy K (2019) Quantifying distributional model risk via optimal transport. Math. Oper. Res. 44(2):565–600
2019
Closest in time.
Luo F, Mehrotra S (2019) Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models. Eur. J. Oper. Res. 278(1):20 – 35
2019
Closest in time.
MOSEK ApS (2019) MOSEK Optimizer API for Python 9.2.10 . URL https://docs.mosek.com/9.2/pythonapi/index.html
2019
Closest in time.
Shafieezadeh-Abadeh S, Kuhn D, Mohajerin Esfahani P (2019) Regularization via mass transportation. J. Mach. Learn. Res. 20:Paper No. 103, 68
2019
Closest in time.
Xie W (2021) On distributionally robust chance constrained programs with Wasserstein distance. Math. Program. 186(1-2, Ser. A):115–155
2021
Closest in time.