The Confidence Bound Target (CBT) algorithm is designed for infinite arms bandit problem. It is shown that CBT algorithm achieves the regret lower bound for general reward distributions. Reference: Hock Peng Chan and Shouri Hu (2018) <arXiv:1805.11793>.
| Version: | 1.0 |
| Published: | 2018-05-31 |
| Author: | Hock Peng Chan and Shouri Hu |
| Maintainer: | Shouri Hu <e0054325 at u.nus.edu> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| CRAN checks: | CBT results |
| Reference manual: | CBT.pdf |
| Package source: | CBT_1.0.tar.gz |
| Windows binaries: | r-devel: CBT_1.0.zip, r-release: CBT_1.0.zip, r-oldrel: CBT_1.0.zip |
| macOS binaries: | r-release: CBT_1.0.tgz, r-oldrel: CBT_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=CBT to link to this page.