Loading...
Please wait, while we are loading the content...
Similar Documents
O C ] 1 M ay 2 01 9 Revisiting the Polyak step size
| Content Provider | Semantic Scholar |
|---|---|
| Author | Hazan, Elad Kakade, Sham M. |
| Copyright Year | 2019 |
| 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://arxiv-export-lb.library.cornell.edu/pdf/1905.00313 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
