The Complexity of Making the Gradient Small in Stochastic Convex Optimization. Foster, D.; Sekhari, A.; Shamir, O.; Srebro, N.; Sridharan, K.; and Woodworth, B. In Proceedings of the 32nd Annual Conference on Learning Theory (COLT), volume PMLR 99, pages 1319–1345, 2019.
The Complexity of Making the Gradient Small in Stochastic Convex Optimization [pdf]Paper  bibtex   
@inproceedings{2019fostercomplexity,
  title={The Complexity of Making the Gradient Small in Stochastic Convex Optimization},
  author={Foster, Dylan and Sekhari, Ayush and Shamir, Ohad and Srebro, Nathan and Sridharan, Karthik and Woodworth, Blake},
  booktitle={Proceedings of the 32nd Annual Conference on Learning Theory (COLT)},
  volume={PMLR 99},
  pages={1319--1345},
  year={2019},
  %http://proceedings.mlr.press/v99/foster19b.html
  url_Paper={https://arxiv.org/pdf/1902.04686.pdf}
}
Downloads: 0