Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
Research output: Contribution to conference › Abstract › peer-review
Standard
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information. / Auer, Peter; Chen, Yifang; Gajane, Pratik et al.
2019.
2019.
Research output: Contribution to conference › Abstract › peer-review
Harvard
Auer, P, Chen, Y, Gajane, P, Lee, C-W, Luo, H, Ortner, R & Wei, C-Y 2019, 'Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information'. <http://proceedings.mlr.press/v99/auer19b/auer19b.pdf>
APA
Auer, P., Chen, Y., Gajane, P., Lee, C.-W., Luo, H., Ortner, R., & Wei, C.-Y. (2019). Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information. http://proceedings.mlr.press/v99/auer19b/auer19b.pdf
Vancouver
Auer P, Chen Y, Gajane P, Lee CW, Luo H, Ortner R et al.. Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information. 2019.
Author
Bibtex - Download
@conference{432dea49aedc4400a3051a878130ea71,
title = "Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information",
author = "Peter Auer and Yifang Chen and Pratik Gajane and Chung-Wei Lee and Haipeng Luo and Ronald Ortner and Chen-Yu Wei",
year = "2019",
language = "English",
}
RIS (suitable for import to EndNote) - Download
TY - CONF
T1 - Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
AU - Auer, Peter
AU - Chen, Yifang
AU - Gajane, Pratik
AU - Lee, Chung-Wei
AU - Luo, Haipeng
AU - Ortner, Ronald
AU - Wei, Chen-Yu
PY - 2019
Y1 - 2019
M3 - Abstract
ER -
