Boosting First-Order Methods by Shifting Objective: New Schemes with Faster Worst Case Rates

NeurIPS 2020

Boosting First-Order Methods by Shifting Objective: New Schemes with Faster Worst Case Rates

Dec 06, 2020
|
24 views
|
|
Code
Details
We propose a new methodology to design first-order methods for unconstrained strongly convex problems, i.e., to design for a shifted objective function. Several technical lemmas are provided as the building blocks for designing new methods. By shifting objective, the analysis is tightened, which leaves space for faster rates, and also simplified. Following this methodology, we derived several new accelerated schemes for problems that equipped with various first-order oracles, and all of the derived methods have faster worst case convergence rates than their existing counterparts. Experiments on machine learning tasks are conducted to evaluate the new methods. Speakers: Kaiwen Zhou, Anthony Man-Cho So, James Cheng

Comments
loading...