1. Abbasi-Yadkori, Y., Bartlett, P., Gabillon, V., Malek, A., & Valko, M. (2018). Best of both worlds: Stochastic & adversarial best-arm identification. In Conference on learning theory (COLT).
2. Abdelfattah, M. S., Mehrotra, A., Dudziak, Ł., & Lane, N. D. (2021). Zero-Cost Proxies for Lightweight NAS. In International conference on learning representations (ICLR).
3. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002). The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1), 48–77.
4. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (1995). Gambling in a rigged casino: The adversarial multi-armed bandit problem. In Proceedings of IEEE 36th annual foundations of computer science, pp. 322–331. IEEE.
5. Bender, G., Liu, H., Chen, B., Chu, G., Cheng, S., Kindermans, P. J., & Le, Q. V. (2020). Can weight sharing outperform random architecture search? an investigation with tunas. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 14323–14332.