![]() | Up a level |
Sentenac, Flore, Yi, Jialin, Calauzènes, Clément, Perchet, Vianney and Vojnovic, Milan ORCID: 0000-0003-1382-022X
(2021)
Pure exploration and regret minimization in matching bandits.
In:
Proceedings of the 38th International Conference on Machine Learning.
Proceedings of Machine Learning Research,139.
Journal of Machine Learning Research, pp. 9434-9442.