Fetching the paper…
Reading the bibliography…
Estimation of Shannon and R\'enyi entropies of unknown discrete distributions is a fundamental problem in statistical property testing and an active research topic in both theoretical computer science and information theory.
Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli M. Maurer, Generalized privacy amplification , IEEE Transactions on Information Theory 41
1923
Earlier work this paper cites.
Godfrey H. Hardy, P. V. Seshu Aiyar, and Bertram M. Wilson, Collected papers of Srinivasa Ramanujan , AMS, 1927
1927
Earlier work this paper cites.
Ralph V. L. Hartley, Transmission of information , Bell Labs Technical Journal 7
1928
Earlier work this paper cites.
Ronald A. Fisher, Alexander S. Corbet, and Carrington B. Williams, The relation between the number of species and the number of individuals in a random sample of an animal population , The Journal of Animal Ecology (1943), 42–58
1943
Earlier work this paper cites.
Claude E. Shannon, A mathematical theory of communication , Bell System Technical Journal 27
1948
Earlier work this paper cites.
I. J. Good and G. H. Toulmin, The number of new species, and the increase in population coverage, when a sample is increased , Biometrika 43
1956
Earlier work this paper cites.
Alfréd Rényi, On measures of entropy and information , Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 547–561, 1961
1961
Earlier work this paper cites.
Paul Valiant, Testing symmetric properties of distributions , SIAM Journal on Computing 40
1968
Earlier work this paper cites.
Bradley Efron and Ronald Thisted, Estimating the number of unseen species: How many words did Shakespeare know? , Biometrika 63
1976
Earlier work this paper cites.
Peter W. Glynn, Upper bounds on Poisson tail probabilities , Operations Research Letters 6
1987
Earlier work this paper cites.
Ronald Thisted and Bradley Efron, Did Shakespeare write a newly-discovered poem? , Biometrika 74
1987
Earlier work this paper cites.
Russell Impagliazzo and David Zuckerman, How to recycle random bits , 30th Annual Symposium on Foundations of Computer Science, pp. 248–253, IEEE, 1989
1989
Earlier work this paper cites.
Ramamohan Paturi, On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) , Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 468–474, ACM, 1992
1992
Earlier work this paper cites.
Imre Csiszár, Generalized cutoff rates and Rényi’s information measures , IEEE Transactions on Information Theory 41
1995
Earlier work this paper cites.
Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, and Lynne Stokes, Sampling-based estimation of the number of distinct values of an attribute , Proceedings of 21th International Conference on Very Large Data Bases, vol. 95, pp. 311–322, 1995
1995
Earlier work this paper cites.
Erdal Arikan, An inequality on guessing and its application to sequential decoding , IEEE Transactions on Information Theory 42
1996
Earlier work this paper cites.
Solomon Kullback, Information theory and statistics , Courier Corporation, 1997
1997
Earlier work this paper cites.
Ian Kroes, Paul W. Lepp, and David A. Relman, Bacterial diversity within the human subgingival crevice , Proceedings of the National Academy of Sciences 96
1999
Earlier work this paper cites.
Ashwin Nayak and Felix Wu, The quantum query complexity of approximating the median and related statistics , Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 384–393, ACM, 1999, arXiv:quant-ph/9804066
1999
Earlier work this paper cites.
Paul C. van Oorschot and Michael J. Wiener, Parallel collision search with cryptanalytic applications , Journal of Cryptology 12
1999
Earlier work this paper cites.
Paul Dagum, Richard Karp, Michael Luby, and Sheldon Ross, An optimal algorithm for Monte Carlo estimation , SIAM Journal on Computing 29
2000
Cited alongside, same era.
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf, Quantum lower bounds by polynomials , Journal of the ACM (JACM) 48
2001
Cited alongside, same era.
Jennifer B. Hughes, Jessica J. Hellmann, Taylor H. Ricketts, and Brendan J. M. Bohannan, Counting the uncountable: statistical approaches to estimating microbial diversity , Applied and Environmental Microbiology 67
2001
Cited alongside, same era.
Bruce J. Paster, Susan K. Boches, Jamie L. Galvin, Rebecca E. Ericson, Carol N. Lau, Valerie A. Levanos, Ashish Sahasrabudhe, and Floyd E. Dewhirst, Bacterial diversity in human subgingival plaque , Journal of Bacteriology 183
2001
Cited alongside, same era.
Gregory Valiant and Paul Valiant, Estimating the unseen: an n / l o g ( n ) n/log(n) -sample estimator for entropy and support size, shown optimal via new CLTs , Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 685–694, ACM, 2011
2011
Later among the works it cites.
2012
Later among the works it cites.
Lucien Le Cam, Asymptotic methods in statistical decision theory , Springer Science & Business Media, 2012
2012
Later among the works it cites.
Salil P. Vadhan, Pseudorandomness , Foundations and Trends® in Theoretical Computer Science 7
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp, Quantum amplitude amplification and estimation , Contemporary Mathematics 305
2002
Cited alongside, same era.
Liam Paninski, Estimation of entropy and mutual information , Neural Computation 15
2003
Cited alongside, same era.
Scott Aaronson and Yaoyun Shi, Quantum lower bounds for the collision and the element distinctness problems , Journal of the ACM (JACM) 51
2004
Cited alongside, same era.
Olivier Catoni, Statistical learning theory and stochastic optimization: Ecole d’eté de probabilités de saint-flour xxxi-2001 , Springer, 2004
2004
Cited alongside, same era.
Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, and Ronitt Rubinfeld, The complexity of approximating the entropy , SIAM Journal on Computing 35
2005
Cited alongside, same era.
Samuel Kutin, Quantum lower bound for the collision problem with small range , Theory of Computing 1
2005
Cited alongside, same era.
Michael Mitzenmacher and Eli Upfal, Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis , Cambridge University Press, 2005
2005
Cited alongside, same era.
Andris Ambainis, Quantum walk algorithm for element distinctness , SIAM Journal on Computing 37
2007
Cited alongside, same era.
2013
Later among the works it cites.
Diederik P. Kingma and Max Welling, Auto-encoding variational bayes , arXiv:1312.6114 (2013)
2013
Later among the works it cites.
Ashley Montanaro and Ronald de Wolf, A survey of quantum property testing , arXiv:1310.2035 (2013)
2013
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
Alon Orlitsky, Ananda Theertha Suresh, and Yihong Wu, Optimal prediction of the number of unseen species , Proceedings of the National Academy of Sciences 113
2016
Later among the works it cites.
2016
Later among the works it cites.
Jayadev Acharya, Hirakendu Das, Alon Orlitsky, and Ananda Theertha Suresh, A unified maximum likelihood approach for optimal distribution property estimation , (2017)
2017
Closest in time.