Goto

Collaborating Authors

 dgapk


OptimalEpochStochasticGradientDescentAscent MethodsforMin-MaxOptimization

Neural Information Processing Systems

However,itsextension tosolvingstochastic min-max problems withstrong convexity and strong concavity still remains open, and itisstill unclear whether a fast rate ofO(1/T) for the duality gapis achievable for stochastic min-max optimization under strong convexity and strong concavity.