Sign inGet started
Paper · arXiv

RIE-Greedy: Regularization-Induced Exploration for Contextual Bandits

Real-world contextual bandit problems with complex reward models are often tackled with iteratively trained models, such as boosting trees. However, it is difficult to directly apply simple and effective exploration strategies--such as Thompson Sampling or UCB--on top of those black-box estimators. Existing approaches rely on sophisticated assumptions or intractable procedures that are hard to verify and implement in practice. In this work, we explore the use of an exploration-free (pure-greedy) action selection strategy, that exploits the randomness inherent in model fitting process as an intrinsic source of exploration. More specifically, we note that the stochasticity in cross-validati...

AuthorsTong Li, Thiago de Queiroz Casanova, Eric M. Schwartz et al.
Primary categorystat.ML
Published11 March 2026
Last updated at source17 May 2026
stat.MLcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f30e8470-58d9-410d-8343-e49b537fe109" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.