1. Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
2. Peter Auer , Nicolo Cesa-Bianchi , and Paul Fischer . 2002. Finite-time Analysis of the Multiarmed Bandit Problem. Machine learning 47, 2 ( 2002 ), 235--256. Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer. 2002. Finite-time Analysis of the Multiarmed Bandit Problem. Machine learning 47, 2 (2002), 235--256.
3. Removing the Genetics from the Standard Genetic Algorithm
4. Greg Brockman , Vicki Cheung , Ludwig Pettersson , Jonas Schneider , John Schulman , Jie Tang , and Wojciech Zaremba . 2016. Openai gym. arXiv preprint arXiv:1606.01540 ( 2016 ). Greg Brockman, Vicki Cheung, Ludwig Pettersson, Jonas Schneider, John Schulman, Jie Tang, and Wojciech Zaremba. 2016. Openai gym. arXiv preprint arXiv:1606.01540 (2016).
5. Sébastian Bubeck , Tengyao Wang , and Nitin Viswanathan . 2013 . Multiple Identifications in Multi-Armed Bandits . In Proceedings of the 30th International Conference on Machine Learning (ICML 2013). PMLR, 258--265. Sébastian Bubeck, Tengyao Wang, and Nitin Viswanathan. 2013. Multiple Identifications in Multi-Armed Bandits. In Proceedings of the 30th International Conference on Machine Learning (ICML 2013). PMLR, 258--265.