### Web: http://arxiv.org/abs/2206.05404

June 17, 2022, 1:12 a.m. | Wonyoung Kim, Min-hwan Oh, Myunghee Cho Paik

We propose a novel algorithm for linear contextual bandits with $O(\sqrt{dT \log T})$ regret bound, where $d$ is the dimension of contexts and $T$ is the
time horizon. Our proposed algorithm is equipped with a novel estimator in
which exploration is embedded through explicit randomization. Depending on the
randomization, our proposed estimator takes contribution either from contexts
of all arms or from selected contexts. We establish a self-normalized bound for
our estimator, which allows a novel decomposition of the cumulative …

### Machine Learning Researcher - Saalfeld Lab

@ Howard Hughes Medical Institute - Chevy Chase, MD | Ashburn, Virginia

### Project Director, Machine Learning in US Health

@ ideas42.org | Remote, US

### Data Science Intern

@ NannyML | Remote

### Machine Learning Engineer NLP/Speech

@ Play.ht | Remote

### Research Scientist, 3D Reconstruction

@ Yembo | Remote, US

### Clinical Assistant or Associate Professor of Management Science and Systems

@ University at Buffalo | Buffalo, NY