Yevgeny Seldin
Professor
Machine Learning
Universitetsparken 1
2100 København Ø
ORCID: 0000-0003-3152-4635
1 - 2 out of 2Page size: 10
- 2017
- Published
A strongly quasiconvex PAC-Bayesian bound
Thiemann, N., Igel, Christian, Wintenberger, O. & Seldin, Yevgeny, 2017, Proceedings of International Conference on Algorithmic Learning Theory, 15-17 October 2017, Kyoto University, Kyoto, Japan . Hanneke, S. & Reyzin, L. (eds.). Proceedings of Machine Learning Research, p. 466-492 (Proceedings of Machine Learning Research, Vol. 76).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
An improved parametrization and analysis of the EXP3++ algorithm for stochastic and adversarial bandits
Seldin, Yevgeny & Lugosi, G., 2017, Proceedings of Conference on Learning Theory, 7-10 July 2017, Amsterdam, Netherlands. Kale, S. & Shamir, O. (eds.). Proceedings of Machine Learning Research, p. 1743-1759 (Proceedings of Machine Learning Research, Vol. 65).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 120818606
Most downloads
-
72
downloads
Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
30
downloads
Second Order PAC-Bayesian Bounds for the Weighted Majority Vote
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
28
downloads
Tsallis-INF: An optimal algorithm for stochastic and adversarial bandits
Research output: Contribution to journal › Journal article › Research › peer-review
Published