A Note on Bounding Regret of the C2UCB Contextual Combinatorial Bandit
Not on the map. Why?
Abstract (arXiv)
We revisit the proof by Qin et al. (2014) of bounded regret of the C2UCB contextual combinatorial bandit. We demonstrate an error in the proof of volumetric expansion of the moment matrix, used in upper bounding a function of context vector norms. We prove a relaxed inequality that yields the originally-stated regret bound.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 20 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.