no code implementations • 16 Sep 2023 • Peng Zhao, Yan-Feng Xie, Lijun Zhang, Zhi-Hua Zhou
In this paper, we present efficient methods for optimizing dynamic regret and adaptive regret, which reduce the number of projections per round from $\mathcal{O}(\log T)$ to $1$.
