1 related articles
This article interprets the nearly linear-time FTPL algorithm for weakly observable graph bandits, achieving best-of-both-worlds guarantees via a novel loss estimator, with regret bounds of O(δ_*^{1/3}T^{2/3}) and O(δ_* log T/Δ_min^2), and near-linear computational efficiency.
