Aadirupa Saha, Nagarajan Natarajan, Praneeth Netrapalli, Prateek Jain 0002. Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization. In Marina Meila, Tong Zhang 0001, editors, Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event. Volume 139 of Proceedings of Machine Learning Research, pages 9255-9264, PMLR, 2021. [doi]
@inproceedings{SahaNNJ21,
title = {Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization},
author = {Aadirupa Saha and Nagarajan Natarajan and Praneeth Netrapalli and Prateek Jain 0002},
year = {2021},
url = {http://proceedings.mlr.press/v139/saha21c.html},
researchr = {https://researchr.org/publication/SahaNNJ21},
cites = {0},
citedby = {0},
pages = {9255-9264},
booktitle = {Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event},
editor = {Marina Meila and Tong Zhang 0001},
volume = {139},
series = {Proceedings of Machine Learning Research},
publisher = {PMLR},
}