A Note on Bounding Regret of the C²UCB Contextual Combinatorial Bandit
classification
💻 cs.LG
stat.ML
keywords
regretbanditboundingcombinatorialcontextualproofboundbounded
read the original abstract
We revisit the proof by Qin et al. (2014) of bounded regret of the C$^2$UCB 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.