# Two Polyak-Type Step Sizes for Mirror Descent

arXiv: https://arxiv.org/abs/2210.01532 · HTML: https://mlsanity.com/paper/2210.01532/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Oct 2022.

## Built on by (most cited first, 1 of 1)

- [Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers](https://mlsanity.com/paper/2602.05813/) (2026)

## Abstract (arXiv)

We propose two Polyak-type step sizes for mirror descent and prove their convergences for minimizing convex locally Lipschitz functions. Both step sizes, unlike the original Polyak step size, do not need the optimal value of the objective function.