no code implementations • 9 May 2024 • Yu Liu, Yunlu Shu, Tianyu Wang
More specifically, we introduce an algorithm, called Geometric Narrowing (GN), whose regret bound is of order $\widetilde{{\mathcal{O}}} ( A_{+}^d \sqrt{T} )$.
