Mirror Descent Under Generalized Smoothness
Dingzhi Yu, Wei Jiang, Hongyi Tao, Yuanyu Wan, Lijun Zhang

TL;DR
This paper extends the concept of smoothness in optimization to general norms and dual norms, enabling convergence guarantees for mirror descent algorithms in broader settings including non-Euclidean geometries and stochastic, non-convex, or composite problems.
Contribution
It introduces a new ll*-smoothness framework and a generalized self-bounding property, broadening the applicability of mirror descent beyond Euclidean spaces with theoretical guarantees.
Findings
Established convergence for mirror descent under ll*-smoothness.
Extended results to stochastic, non-convex, and composite optimization.
Matched state-of-the-art rates under classic smoothness conditions.
Abstract
Smoothness is crucial for attaining fast rates in first-order optimization. However, many optimization problems in modern machine learning involve non-smooth objectives. Recent studies relax the smoothness assumption by allowing the Lipschitz constant of the gradient to grow with respect to the gradient norm, which accommodates a broad range of objectives in practice. Despite this progress, existing generalizations of smoothness are restricted to Euclidean geometry with -norm and only have theoretical guarantees for optimization in the Euclidean space. In this paper, we address this limitation by introducing a new -smoothness concept that measures the norm of Hessians in terms of a general norm and its dual, and establish convergence for mirror-descent-type algorithms, matching the rates under the classic smoothness. Notably, we propose a generalized self-bounding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques
