@report {1616151,
	title = {Revisiting the Polyak step size},
	year = {2019},
	institution = {ArXiv Report},
	abstract = {This paper revisits the Polyak step size schedule for convex optimization problems, proving that a simple variant of it simultaneously attains near optimal convergence rates for the gradient descent algorithm, for all ranges of strong convexity, smoothness, and Lipschitz parameters, without a-priory knowledge of these parameters.},
	url = {https://arxiv.org/abs/1905.00313},
	author = {Elad Hazan and Sham Kakade}
}
