Fetching the paper…
Reading the bibliography…
Distributionally robust supervised learning (DRSL) is emerging as a key paradigm for building reliable machine learning systems for real-world applications -- reflecting the need for classifiers and predictive models that are robust to the distribution shifts that arise from phenomena such as selection bias or nonstationarity.
On general minimax theorems
M. Sion · 1958
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
Generalized logistic models
T. A. Stukel · 1988
Earlier work this paper cites.
On duality theory of conic linear problems
A. Shapiro · 2001
Earlier work this paper cites.
Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
A. Nemirovski · 2004
Earlier work this paper cites.
Robust supervised learning
J. A. Bagnell · 2005
Earlier work this paper cites.
Generalized Linear Models and Extensions
J. W. Hardin and J. M. Hilbe · 2007
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Y. Nesterov · 2007
Earlier work this paper cites.
Optimal Transport: Old and New , volume 338
C. Villani · 2008
Earlier work this paper cites.
Convex Optimization Theory
D. P. Bertsekas · 2009
Earlier work this paper cites.
Curiously fast convergence of some stochastic gradient descent algorithms
L. Bottou · 2009
Earlier work this paper cites.
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
T. Hastie, R. Tibshirani, and J. Friedman · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
Dataset shift in machine learning
J. Quionero-Candela, M. Sugiyama, A. Schwaighofer, and N. D. Lawrence · 2009
Earlier work this paper cites.
Distributionally robust optimization under moment uncertainty with application to data-driven problems
E. Delage and Y. Ye · 2010
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Earlier work this paper cites.
LIBSVM: A library for support vector machines
C-C. Chang and C-J. Lin · 2011
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm
A. Juditsky, A. Nemirovski, and C. Tauvel · 2011
Earlier work this paper cites.
Robust solutions of optimization problems affected by uncertain probabilities
A. Ben-Tal, D. Den Hertog, A. De Waegenaere, B. Melenberg, and G. Rennen · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Earlier work this paper cites.
Parallel stochastic gradient algorithms for large-scale matrix completion
B. Recht and C. Ré · 2013
Earlier work this paper cites.
Intriguing properties of neural networks
C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus · 2013
Earlier work this paper cites.
The Nature of Statistical Learning Theory
V. Vapnik · 2013
Earlier work this paper cites.
Optimal primal-dual methods for a class of saddle point problems
Y. Chen, G. Lan, and Y. Ouyang · 2014
Earlier work this paper cites.
Distributionally robust convex optimization
W. Wiesemann, D. Kuhn, and M. Sim · 2014
Earlier work this paper cites.
Distributionally robust logistic regression
S. Abadeh, P. Esfahani, and D. Kuhn · 2015
Earlier work this paper cites.
A distributionally-robust approach for finding support vector machines
C. Lee and S. Mehrotra · 2015
Earlier work this paper cites.
Convex Analysis , volume 36
R. T. Rockafellar · 2015
Cited alongside, same era.
Stochastic nested variance reduction for nonconvex optimization
D. Zhou, P. Xu, and Q. Gu · 2015
Cited alongside, same era.
Variance reduction for faster non-convex optimization
Z. Allen-Zhu and E. Hazan · 2016
Cited alongside, same era.
Improved SVRG for non-strongly-convex or sum-of-non-convex objectives
Z. Allen-Zhu and Y. Yuan · 2016
Cited alongside, same era.
Stochastic variance reduction methods for saddle-point problems
P. Balamurugan and F. Bach · 2016
Cited alongside, same era.
Stochastic gradient methods for distributionally robust optimization with f-divergences
H. Namkoong and J. C. Duchi · 2016
Cited alongside, same era.
On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems
S. Cui and U. V. Shanbhag · 2019
Later among the works it cites.
Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity
S. S. Du and W. Hu · 2019
Later among the works it cites.
Why random reshuffling beats stochastic gradient descent
M. Gürbüzbalaban, A. Ozdaglar, and P. A. Parrilo · 2019
Later among the works it cites.
Random shuffling beats SGD after finite epochs
J. Haochen and S. Sra · 2019
Later among the works it cites.
On the convergence of single-call stochastic extra-gradient methods
Y. Hsieh, F. Iutzeler, J. Malick, and P. Mertikopoulos · 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…
Stochastic variance reduction for nonconvex optimization
S. J. Reddi, A. Hefny, S. Sra, B. Poczos, and A. Smola · 2016
Cited alongside, same era.
Without-replacement sampling for stochastic gradient methods
O. Shamir · 2016
Cited alongside, same era.
Towards evaluating the robustness of neural networks
N. Carlini and D. Wagner · 2017
Cited alongside, same era.
Accelerated schemes for a class of variational inequalities
Y. Chen, G. Lan, and Y. Ouyang · 2017
Cited alongside, same era.
Distributional robustness and regularization in statistical learning
R. Gao, X. Chen, and A. J. Kleywegt · 2017
Cited alongside, same era.
Extragradient method with variance reduction for stochastic variational inequalities
A. N. Iusem, A. Jofré, R. I. Oliveira, and P. Thompson · 2017
Cited alongside, same era.
J. Li, S. Huang, and A. M-C. So · 2019
Later among the works it cites.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
T. Liang and J. Stokes · 2019
Later among the works it cites.
Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
F. Luo and S. Mehrotra · 2019
Later among the works it cites.
On finding local Nash equilibria (and only local Nash equilibria) in zero-sum games
E. V. Mazumdar, M. I. Jordan, and S. S. Sastry · 2019
Later among the works it cites.
SGD without replacement: Sharper rates for general smooth convex functions
D. Nagaraj, P. Jain, and P. Netrapalli · 2019
Later among the works it cites.
Distributionally robust optimization: A review
H. Rahimian and S. Mehrotra · 2019
Later among the works it cites.
Regularization via mass transportation
S. Shafieezadeh-Abadeh, D. Kuhn, and P. M. Esfahani · 2019
Later among the works it cites.
Efficient algorithms for smooth minimax optimization
K. K. Thekumparampil, P. Jain, P. Netrapalli, and S. Oh · 2019
Later among the works it cites.
Efficient algorithms for distributionally robust stochastic optimization with discrete scenario support
Z. Zhang, S. Ahmed, and G. Lan · 2019
Later among the works it cites.
Generalized logistic distribution and its regression model
M. A. Aljarrah, F. Famoye, and C. Lee · 2020
Later among the works it cites.
Simple and optimal methods for stochastic variational inequalities, i: operator extrapolation
G. Kotsalis, G. Lan, and T. Li · 2020
Later among the works it cites.
Fast epigraphical projection-based incremental algorithms for Wasserstein distributionally robust support vector machine
J. Li, C. Chen, and A. M-C. So · 2020
Later among the works it cites.
Near-optimal algorithms for minimax optimization
T. Lin, C. Jin, and M. I. Jordan · 2020
Later among the works it cites.
On gradient-based learning in continuous games
E. Mazumdar, L. J. Ratliff, and S. S. Sastry · 2020
Later among the works it cites.
Random reshuffling: Simple analysis with vast improvements
K. Mishchenko, A. Khaled, and P. Richtárik · 2020
Later among the works it cites.
A unified convergence analysis for shuffling-type gradient methods
L. M. Nguyen, Q. Tran-Dinh, D. T. Phan, P. H. Nguyen, and M. van Dijk · 2020
Later among the works it cites.
Closing the convergence gap of SGD without replacement
S. Rajput, A. Gupta, and D. Papailiopoulos · 2020
Later among the works it cites.
How good is SGD with random shuffling?
I. Safran and O. Shamir · 2020
Later among the works it cites.
Lower complexity bounds for finite-sum convex-concave minimax optimization problems
G. Xie, L. Luo, Y. Lian, and Z. Zhang · 2020
Later among the works it cites.
Optimal epoch stochastic gradient descent ascent methods for min-max optimization
Y. Yan, Y. Xu, Q. Lin, W. Liu, and T. Yang · 2020
Later among the works it cites.
A catalyst framework for minimax optimization
J. Yang, S. Zhang, N. Kiyavash, and N. He · 2020
Later among the works it cites.
Stochastic variance reduction for variational inequality methods
A. Alacaoglu and Y. Malitsky · 2021
Closest in time.