Paper

Universal Algorithms: Beyond the Simplex

The bulk of universal algorithms in the online convex optimisation literature are variants of the Hedge (exponential weights) algorithm on the simplex. While these algorithms extend to polytope domains by assigning weights to the vertices, this process is computationally unfeasible for many important classes of polytopes where the number $V$ of vertices depends exponentially on the dimension $d$... (read more)

Results in Papers With Code
(↓ scroll down to see all results)