Author:
Rolet Philippe,Teytaud Olivier
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Lecture Notes in Computer Science;D.V. Arnold,2000
2. Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. The Journal of Machine Learning Research 3, 397–422 (2003)
3. Bernstein, S.: On a modification of chebyshev’s inequality and of the error formula of laplace. Original publication: Ann. Sci. Inst. Sav. Ukraine, Sect. Math. 1 3(1), 38–49 (1924)
4. Bernstein, S.: The Theory of Probabilities. Gastehizdat Publishing House, Moscow (1946)
5. Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat. 23, 493–509 (1952)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Statistically Significant Duration-Independent-based Noise-Robust Speaker Verification;International Journal of Mathematical, Engineering and Management Sciences;2024-02-01
2. Noisy Optimization;Proceedings of the Genetic and Evolutionary Computation Conference 2016;2016-07-20
3. Simple and cumulative regret for continuous noisy optimization;Theoretical Computer Science;2016-02
4. Algorithm portfolios for noisy optimization;Annals of Mathematics and Artificial Intelligence;2015-11-04
5. Analysis of runtime of optimization algorithms for noisy functions over discrete codomains;Theoretical Computer Science;2015-11