Satisficing Exploration in Bandit Optimization
<|reference_start|>Satisficing Exploration in Bandit Optimization: Motivated by the concept of satisficing in decision-making, we consider the problem of satisficing exploration in bandit optimization. In this setting, the learner aims at selecting satisficing arms (arms with mean reward exceeding a certain threshold value) as frequently as possible. The performance is measured by satisficing regret, which is the cumulative deficit of the chosen arm's mean reward compared to the threshold. We propose SELECT, a general algorithmic template for Satisficing Exploration via LowEr Confidence bound Testing, that attains constant satisficing regret for a wide variety of bandit optimization problems in the realizable case (i.e., a satisficing arm exists). Specifically, given a class of bandit optimization problems and a corresponding learning oracle with sub-linear (standard) regret upper bound, SELECT iteratively makes use of the oracle to identify a potential satisficing arm with low regret. Then, it collects data samples from this arm, and continuously compares the LCB of the identified arm's mean reward against the threshold value to determine if it is a satisficing arm. As a complement, SELECT also enjoys the same (standard) regret guarantee as the oracle in the non-realizable case. Finally, we conduct numerical experiments to validate the performance of SELECT for several popular bandit optimization settings.<|reference_end|>
@article{feng2024satisficing,
    title={Satisficing Exploration in Bandit Optimization},
    author={Qing Feng, Tianyi Ma, Ruihao Zhu},
    journal={arXiv preprint arXiv:2406.06802},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.06802},
    primaryClass={stat.ML cs.LG}
}