Adaptivity and Optimality: A Universal Algorithm for Online Convex OptimizationDownload PDFOpen Website

2019 (modified: 16 May 2025)UAI 2019Readers: Everyone
Abstract: In this paper, we study adaptive online convex optimization, and aim to design a universal algorithm that achieves optimal regret bounds for multiple common types of loss functions. Existing univer...
0 Replies

Loading