Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz RequirementsDownload PDF

21 May 2021, 20:47 (edited 09 Nov 2021)NeurIPS 2021 PosterReaders: Everyone
  • Keywords: convex optimization, non-Lipschitz, adaptive methods
  • TL;DR: We provide adaptive methods which simultaneously provide order optimal convergence rates for convex objectives beyond standard Lipschitz continuity conditions for both deterministic and/or stochastic settings.
  • Abstract: We propose a new family of adaptive first-order methods for a class of convex minimization problems that may fail to be Lipschitz continuous or smooth in the standard sense. Specifically, motivated by a recent flurry of activity on non-Lipschitz (NoLips) optimization, we consider problems that are continuous or smooth relative to a reference Bregman function – as opposed to a global, ambient norm (Euclidean or otherwise). These conditions encompass a wide range ofproblems with singular objective, such as Fisher markets, Poisson tomography, D-design, and the like. In this setting, the application of existing order-optimal adaptive methods – like UnixGrad or AcceleGrad – is not possible, especially in the presence of randomness and uncertainty. The proposed method, adaptive mirror descent (AdaMir), aims to close this gap by concurrently achieving min-max optimal rates in problems that are relatively continuous or smooth, including stochastic ones.
  • Supplementary Material: pdf
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
11 Replies

Loading