We prove prop:conbandits in app:conbandits using the reduction of [1]} and prop:kpieceregression. Note that, in contradistinction to the corresponding bound proved as [2]}, we achieve the optimal \(\sqrt{T}\)  regret, albeit with stronger assumptions on the setting.
