Data Party THU
Aug 13, 2025 · Artificial Intelligence
How Dual Adaptivity Powers Universal Algorithms to Minimize Adaptive Regret
This article reviews the recent work by Zhou Zhihua’s team at Nanjing University on dual‑adaptivity universal algorithms for online convex optimization, introducing a meta‑expert framework, the UMA2 and UMA3 methods, and extending them to online composite optimization with strong adaptive‑regret guarantees.
Online Learningadaptive regretconvex optimization
0 likes · 10 min read
