Optimal Confidence Regions for the Multinomial Parameter

T. Peel, S. Anthoine, and L. Ralaivola, “Empirical bernstein inequalities for u-statistics,” in Advances in Neural Information Processing Systems , 2010, pp. 1903–1911

1911

Earlier work this paper cites.

C. J. Clopper and E. S. Pearson, “The use of confidence or fiducial limits illustrated in the case of the binomial,” Biometrika , vol. 26, no. 4, pp. 404–413, 1934

1934

Earlier work this paper cites.

C. R. Blyth and H. A. Still, “Binomial confidence intervals,” Journal of the American Statistical Association , vol. 78, no. 381, pp. 108–116, 1983

1983

Earlier work this paper cites.

A. Agresti and B. A. Coull, “Approximate is better than “exact” for interval estimation of binomial proportions,” The American Statistician , vol. 52, no. 2, pp. 119–126, 1998

1998

Earlier work this paper cites.

P. Auer, N. Cesa-Bianchi, and P. Fischer, “Finite-time analysis of the multiarmed bandit problem,” Machine learning , vol. 47, no. 2-3, pp. 235–256, 2002

2002

Earlier work this paper cites.

A. Agresti, “Dealing with discreteness: making exact confidence intervals for proportions, differences of proportions, and odds ratios more exact,” Statistical Methods in Medical Research , vol. 12, no. 1, pp. 3–21, 2003

2003

Earlier work this paper cites.

J. Langford, “Tutorial on practical prediction theory for classification,” Journal of machine learning research , vol. 6, no. Mar, pp. 273–306, 2005

2005

Earlier work this paper cites.

V. Mnih, C. Szepesvári, and J.-Y. Audibert, “Empirical bernstein stopping,” in Proceedings of the 25th international conference on Machine learning . ACM, 2008, pp. 672–679

2008

Earlier work this paper cites.

D. Chafai and D. Concordet, “Confidence regions for the multinomial parameter with small sample size,” Journal of the American Statistical Association , vol. 104, no. 487, pp. 1071–1079, 2009

2009

Cited alongside, same era.

A. Maurer and M. Pontil, “Empirical bernstein bounds and sample variance penalization,” in COLT 2009-The 22nd Conference on Learning Theory , 2009

2009

Cited alongside, same era.

J.-Y. Audibert, R. Munos, and C. Szepesvári, “Exploration–exploitation tradeoff using variance estimates in multi-armed bandits,” Theoretical Computer Science , vol. 410, no. 19, pp. 1876–1902, 2009

2009

Cited alongside, same era.

B. A. Frigyik, A. Kapila, and M. R. Gupta, “Introduction to the dirichlet distribution and related processes,” Department of Electrical Engineering, University of Washington, UWEETR-2010-0006 , no. 0006, pp. 1–27, 2010

2010

Cited alongside, same era.

E. Kaufmann and S. Kalyanakrishnan, “Information complexity in bandit subset selection,” ser. Proceedings of Machine Learning Research, S. Shalev-Shwartz and I. Steinwart, Eds., vol. 30. Princeton, NJ, USA: PMLR, 12–14 Jun 2013, pp. 228–251. [Online]. Available: http://proceedings.mlr.press/v30/Kaufmann13.html

2013

Later among the works it cites.

M. L. Malloy and R. D. Nowak, “Sequential testing for sparse recovery,” IEEE Transactions on Information Theory , vol. 60, no. 12, pp. 7862–7873, 2014

2014

Later among the works it cites.

K. Jamieson, M. Malloy, R. Nowak, and S. Bubeck, “lil’ucb: An optimal exploration algorithm for multi-armed bandits,” in Conference on Learning Theory , 2014, pp. 423–439

2014

Later among the works it cites.

A. Balsubramani and A. Ramdas, “Sequential nonparametric testing with the law of the iterated logarithm,” in Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence . AUAI Press, 2016, pp. 42–51

2016

Later among the works it cites.