Near-optimal method for highly smooth convex optimizationDownload PDFOpen Website

2019 (modified: 19 May 2022)COLT 2019Readers: Everyone
Abstract: We propose a near-optimal method for highly smooth convex optimization. More precisely, in the oracle model where one obtains the $p^{th}$ order Taylor expansion of a function at the query point, w...
0 Replies

Loading