You're currently viewing an old version of this dataset. To see the current version, click here.

Concave Bandits

The dataset used in the paper is a concave bandit problem, where the learner aims at selecting satisficing arms (arms with mean reward exceeding a certain threshold value) as frequently as possible.

Data and Resources

This dataset has no data

Cite this as

Qing Feng, Tianyi Ma, Ruihao Zhu (2024). Dataset: Concave Bandits. https://doi.org/10.57702/19io1s9m

Private DOI This DOI is not yet resolvable.
It is available for use in manuscripts, and will be published when the Dataset is made public.

Additional Info

Field	Value
Created	December 16, 2024
Last update	December 16, 2024
Defined In	https://doi.org/10.48550/arXiv.2406.06802
Author	Qing Feng
More Authors	Tianyi Ma Ruihao Zhu
Homepage	https://arxiv.org/abs/2303.12345