Large alphabets: Finite, infinite, and scaling models

2012 46th Annual Conference on Information Sciences and Systems, CISS 2012

Volumn , Issue , 2012, Pages

  Ohannessian, Mesrob I ^a   Dahleh, Munther A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERED SYSTEMS; FINITE ALPHABET; FINITE NUMBER; FINITE SIZE; LARGE ALPHABETS; SCALING MODEL;

MACHINERY;

INFORMATION SCIENCE;

EID: 84868534894     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2012.6310941     Document Type: Conference Paper

References (18)

1. L. Paninski, "Estimating entropy on m bins given fewer than m samples," IEEE Trans. on Information Theory, vol. 50, no. 9, pp. 2200-2203, 2004.
2. G. Valiant and P. Valiant, "Estimating the unseen: An n=log(n)-sample estimator for entropy and support, shown optimal via new CLTs," in 43rd ACM Symposium on Theory of Computing, STOC, 2011, pp. 1840-1847.
3. A. B. Wagner, P. Viswanath, and S. R. Kulkarni, "Probability estimation in the rare-events regime," IEEE Trans. on Information Theory, vol. 57, no. 6, pp. 3207-3229, 2011.
4. I. J. Good, "The population frequencies of species and the estimation of population parameters," Biometrika, vol. 40, no. 16, pp. 237-264, 1953.
5. M. I. Ohannessian, V. Y. F. Tan, and M. A. Dahleh, "Canonical estimation in a rare-events regime," in 49th Allerton Conference on Communication, Control, and Computing, Allerton, 2011, pp. 679-682.
6. J. Kieffer, "A unified approach to weak universal source coding," IEEE Trans. on Information Theory, vol. IT-24, no. 6, pp. 674-682, 1978.
7. L. Györfi, I. Páli, and E. van der Meulen, "A unified approach to weak universal source coding," IEEE Trans. on Information Theory, vol. 40, no. 1, pp. 267-271, 1994.
8. A. Orlitsky, N. P. Santhanam, and J. Zhang, "Universal compression of memoryless sources over unknown alphabets," IEEE Trans. on Information Theory, vol. 50, no. 7, pp. 1469-1481, 2004.
9. S. Boucheron, A. Garivier, and E. Gassiat, "Coding on countably infinite alphabets," IEEE Trans. on Information Theory, vol. 55, no. 1, pp. 358-373, 2009.
10. H. E. Robbins, "Estimating the total probability of the unobserved outcomes of an experiment," Annals of Mathematical Statistics, vol. 39, no. 1, pp. 256-257, 1968.
11. W. W. Esty, "A normal limit law for a nonparametric estimator of the coverage of a random sample," The Annals of Statistics, vol. 11, no. 3, pp. 905-912, 1983.
12. D. McAllester and R. E. Schapire, "On the convergence rate of Good-Turing estimators," in 13th Annual Conference on Computational Learning Theory, 2000.
13. D. McAllester and L. Ortiz, "Concentration inequalities for the missing mass and for histogram rule error," Journal of Machine Learning Research, vol. 4, pp. 895-911, 2003.
14. M. I. Ohannessian, "On inference about rare events," Ph.D. dissertation, Massachusetts Institute of Technology, 2012.
15. J. Karamata, "Sur un mode de croissance régulière. Théorèmes fondamenteaux," Bulletin de la Socié té Mathématique de France, vol. 61, pp. 55-62, 1933.
16. S. Karlin, "Central limit theorems for certain infinite urn schemes," J. of Mathematics and Mechanics, vol. 17, no. 4, pp. 373-401, 1967.
17. A. Gnedin, B. Hansen, and J. Pitman, "Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws," Probability Surveys, vol. 4, pp. 146-171, 2007.
18. J. Beirlant, Y. Goegebeur, J. Segers, and J. Teugels, Statistics of extremes: theory and applications. Wiley, 2004.