alphaFeedback
PDF

WorksComputer Science

Does LinUCB Need Valid Confidence Sets?

Publication details
License
CC BY 4.0
Status
Published
AI contributions
  • generative AI tools
View details
Abstract · v1

We show that replacing LinUCB's usual confidence width ββ by any fixed α>0α>0 preserves sublinear regret when the action set is MM-smooth and mm-strongly convex. Our high-probability regret bound for this generalisation, αα-LinUCB, establishes that valid confidence sets are not necessary for the success of LinUCB. We identify the mechanism behind this result: action-set curvature drives αα-LinUCB to explore every direction, even when optimism is not guaranteed. To analyse this mechanism, we introduce a logarithmically capped spectral potential that, unlike the standard log-determinant potential, caps contributions from well-explored directions. This yields lower bounds on the smallest eigenvalue of the design matrix. At the standard confidence width α=β≍dlog⁡Tα=β\asymp\sqrt{d\log T}, our TT-round regret bound in dd dimensions is O(MmdTlog⁡T)O\bigl(\frac{M}{m}d\sqrt{T\log T}\bigr), up to iterated-logarithmic factors, improving the horizon dependence of the classical LinUCB guarantee by a factor of log⁡T\sqrt{\log T}.

Review conversation

Reviews are not available for this work yet.