Fetching the paper…
Reading the bibliography…
This paper studies the generalization bounds for the empirical saddle point (ESP) solution to stochastic saddle point (SSP) problems.
On the method of bounded differences
C. McDiarmid · 1989
Earlier work this paper cites.
Principles of risk minimization for learning theory
V. Vapnik · 1992
Earlier work this paper cites.
Concentration
C. McDiarmid · 1998
Earlier work this paper cites.
Algorithmic stability and sanity-check bounds for leave-one-out cross-validation
M. Kearns and D. Ron · 1999
Earlier work this paper cites.
Rademacher and Gaussian complexities: Risk bounds and structural results
P. L. Bartlett and S. Mendelson · 2002
Earlier work this paper cites.
Stability and generalization
O. Bousquet and A. Elisseeff · 2002
Earlier work this paper cites.
Local rademacher complexities
P. L. Bartlett, O. Bousquet, S. Mendelson, et al · 2005
Earlier work this paper cites.
Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
S. Mukherjee, P. Niyogi, T. Poggio, and R. Rifkin · 2006
Earlier work this paper cites.
Estimation of dependences based on empirical data
V. Vapnik · 2006
Earlier work this paper cites.
Modified Gauss–Newton scheme with worst case guarantees for global performance
Y. Nesterov · 2007
Earlier work this paper cites.
Online learning: Theory, algorithms, and applications
S. Shalev-Shwartz and Y. Singer · 2007
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.
Stochastic convex optimization
S. Shalev-Shwartz, O. Shamir, N. Srebro, and K. Sridharan · 2009
Earlier work this paper cites.
Fast rates for regularized objectives
K. Sridharan, S. Shalev-Shwartz, and N. Srebro · 2009
Earlier work this paper cites.
Smoothness, low noise and fast rates
N. Srebro, K. Sridharan, and A. Tewari · 2010
Cited alongside, same era.
Regularization techniques for learning with matrices
S. M. Kakade, S. Shalev-Shwartz, and A. Tewari · 2012
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2013
Cited alongside, same era.
The nature of statistical learning theory
V. Vapnik · 2013
Cited alongside, same era.
Markov decision processes: discrete stochastic dynamic programming
M. L. Puterman · 2014
Cited alongside, same era.
Lectures on stochastic programming: modeling and theory
A. Shapiro, D. Dentcheva, and A. Ruszczyński · 2014
Cited alongside, same era.
L. Zhang, T. Yang, and R. Jin · 2017
Later among the works it cites.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Y. Zhang and L. Xiao · 2017
Later among the works it cites.
Stability and convergence trade-off of iterative optimization algorithms
Y. Chen, C. Jin, and B. Yu · 2018
Later among the works it cites.
Scalable bilinear pi learning using state and action features
Y. Chen, L. Li, and M. Wang · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Hardt, B. Recht, and Y. Singer · 2015
Cited alongside, same era.
Fast rates for exp-concave empirical risk minimization
T. Koren and K. Levy · 2015
Cited alongside, same era.
Stochastic primal-dual methods and sample complexity of reinforcement learning
Y. Chen and M. Wang · 2016
Cited alongside, same era.
Fast rates with high probability in exp-concave statistical learning
N. A. Mehta · 2016
Cited alongside, same era.
Lower bound on the computational complexity of discounted markov decision problems
Y. Chen and M. Wang · 2017
Cited alongside, same era.
Average stability is invariant to data preconditioning: Implications to exp-concave empirical risk minimization
A. Gonen and S. Shalev-Shwartz · 2017
Cited alongside, same era.
S. S. Du and W. Hu · 2018
Later among the works it cites.
Stochastic proximal algorithms for auc maximization
M. Natole, Y. Ying, and S. Lyu · 2018
Later among the works it cites.
Solving non-convex non-concave min-max games under Polyak-Lojasiewicz condition
M. Sanjabi, M. Razaviyayn, and J. D. Lee · 2018
Later among the works it cites.
A universal algorithm for variational inequalities adaptive to smoothness and noise
F. Bach and K. Y. Levy · 2019
Later among the works it cites.
Dscovr: Randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
L. Xiao, A. W. Yu, Q. Lin, and W. Chen · 2019
Later among the works it cites.
Y. Yan, Y. Xu, Q. Lin, L. Zhang, and T. Yang · 2019
Later among the works it cites.
A stochastic composite gradient method with incremental variance reduction
J. Zhang and L. Xiao · 2019
Later among the works it cites.
Optimal algorithms for stochastic three-composite convex-concave saddle point problems
R. Zhao · 2019
Later among the works it cites.
Sharp analysis of epoch stochastic gradient descent ascent methods for min-max optimization
Y. Yan, Y. Xu, Q. Lin, W. Liu, and T. Yang · 2020
Closest in time.