On the Universality of Online Mirror Descent

Mar-15-2024, 07:59:39 GMT–Neural Information Processing Systems

We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.

artificial intelligence, machine learning, mirror descent, (15 more...)

Neural Information Processing Systems

Mar-15-2024, 07:59:39 GMT

Conferences PDF

Country:
- Asia > Middle East
  - Israel (0.14)
- North America > United States
  - Texas (0.14)

Industry:
- Education (0.58)

Technology:
- Information Technology > Artificial Intelligence > Machine Learning > Statistical Learning (0.47)