Fetching the paper…
Reading the bibliography…
The Dirichlet prior is widely used in estimating discrete distributions and functionals of discrete distributions.
C. E. Shannon, “A mathematical theory of communication,” The Bell System Technical Journal , vol. 27, pp. 379–423, 623–656, 1948
1948
Earlier work this paper cites.
A. Wald, Statistical decision functions. Wiley, 1950
1950
Earlier work this paper cites.
G. A. Miller, “Note on the bias of information estimates,” Information Theory in Psychology: Problems and Methods , vol. 2, pp. 95–100, 1955
1955
Earlier work this paper cites.
S. Bernstein, “Collected works: Vol 1. constructive theory of functions (1905-1930), English translation,” Atomic Energy Commission, Springfield, Va , 1958
1958
Earlier work this paper cites.
A. Rényi, “On measures of entropy and information,” in Fourth Berkeley Symposium on Mathematical Statistics and Probability , 1961, pp. 547–561
1961
Earlier work this paper cites.
A. Carlton, “On the bias of information estimates.” Psychological Bulletin , vol. 71, no. 2, p. 108, 1969
1969
Earlier work this paper cites.
J. Hájek, “A characterization of limiting distributions of regular estimates,” Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete , vol. 14, no. 4, pp. 323–330, 1970
1970
Earlier work this paper cites.
——, “Local asymptotic minimax and admissibility in estimation,” in Proceedings of the sixth Berkeley symposium on mathematical statistics and probability , vol. 1, 1972, pp. 175–194
1972
Earlier work this paper cites.
M. O. Hill, “Diversity and evenness: a unifying notation and its consequences,” Ecology , vol. 54, no. 2, pp. 427–432, 1973
1973
Earlier work this paper cites.
B. Harris, “The statistical estimation of entropy in the non-parametric case,” DTIC Document, Tech. Rep., 1975
1975
Earlier work this paper cites.
B. Efron and R. Thisted, “Estimating the number of unsen species: How many words did Shakespeare know?” Biometrika , vol. 63, no. 3, pp. pp. 435–447, 1976. [Online]. Available: http://www.jstor.org/stable/2335721
1976
Earlier work this paper cites.
S. Zahl, “Jackknifing an index of diversity,” Ecology , vol. 58, no. 4, pp. 907–913, 1977
1977
Earlier work this paper cites.
L. Strukov and A. Timan, “Mathematical expectation of continuous functions of random variables. smoothness and variance,” Siberian Mathematical Journal , vol. 18, no. 3, pp. 469–474, 1977
1977
Earlier work this paper cites.
B. Efron, “Bootstrap methods: another look at the Jackknife,” The Annals of Statistics , pp. 1–26, 1979
1979
Earlier work this paper cites.
H. H. Gonska, Quantitative Aussagen zur Approximation durch positive lineare Operatoren . Gesamthochschule Duisburg, 1979
1979
Earlier work this paper cites.
H. Walk, “Probabilistic methods in the approximation by linear positive operators,” in Indagationes Mathematicae (Proceedings) , vol. 83, no. 4. Elsevier, 1980, pp. 445–455
1980
Earlier work this paper cites.
I. A. Ibragimov and R. Z. Has’ minskii, Statistical estimation: asymptotic theory . Springer-Verlag New York, 1981, vol. 2
1981
Earlier work this paper cites.
B. Efron and C. Stein, “The jackknife estimate of variance,” The Annals of Statistics , pp. 586–596, 1981
1981
Earlier work this paper cites.
L. Hahn et al. , “A note on stochastic methods in connection with approximation theorems for positive linear operators,” Pacific J. Math , vol. 101, pp. 307–319, 1981
1981
Earlier work this paper cites.
K. Joag-Dev and F. Proschan, “Negative association of random variables with applications,” The Annals of Statistics , vol. 11, no. 1, pp. 286–295, March 1983
1983
Earlier work this paper cites.
L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen, Classification and regression trees . CRC press, 1984
1984
Earlier work this paper cites.
L. Le Cam, Asymptotic methods in statistical decision theory . Springer, 1986
1986
Earlier work this paper cites.
Z. Ditzian and V. Totik, Moduli of smoothness . Springer, 1987
1987
Earlier work this paper cites.
P. Grassberger, “Finite sample corrections to entropy and dimension estimates,” Physics Letters A , vol. 128, no. 6, pp. 369–373, 1988
1988
Earlier work this paper cites.
O. E. Barndorff-Nielsen and D. R. Cox, Asymptotic techniques for use in statistics . Chapman & Hall, 1989
1989
Earlier work this paper cites.
P. Diaconis and S. Zabell, “Closed form summation for classical distributions: variations on a theme of de moivre,” Statistical Science , pp. 284–302, 1991
1991
Earlier work this paper cites.
P. Hall, The bootstrap and Edgeworth expansion . Springer Science & Business Media, 1992
1992
Earlier work this paper cites.
R. A. DeVore and G. G. Lorentz, Constructive approximation . Springer, 1993, vol. 303
1993
Earlier work this paper cites.
V. Totik, “Approximation by Bernstein polynomials,” American Journal of Mathematics , pp. 995–1018, 1994
1994
Cited alongside, same era.
D. H. Wolpert and D. R. Wolf, “Estimating functions of probability distributions from a finite set of samples,” Physical Review E , vol. 52, no. 6, p. 6841, 1995
1995
Cited alongside, same era.
R. D. Gill and B. Y. Levit, “Applications of the van Trees inequality: a Bayesian Cramér-Rao bound,” Bernoulli , pp. 59–79, 1995
1995
Cited alongside, same era.
T. Schürmann and P. Grassberger, “Entropy estimation of symbol sequences,” Chaos: An Interdisciplinary Journal of Nonlinear Science , vol. 6, no. 3, pp. 414–427, 1996
1996
Cited alongside, same era.
P. Viola and W. M. Wells III, “Alignment by maximization of mutual information,” International journal of computer vision , vol. 24, no. 2, pp. 137–154, 1997
1997
C. Olsen, P. E. Meyer, and G. Bontempi, “On the impact of entropy estimation on transcriptional regulatory network inference based on mutual information,” EURASIP Journal on Bioinformatics and Systems Biology , vol. 2009, no. 1, p. 308959, 2009
2009
Later among the works it cites.
J. Hausser and K. Strimmer, “Entropy inference and the James-Stein estimator, with application to nonlinear gene association networks,” The Journal of Machine Learning Research , vol. 10, pp. 1469–1484, 2009
2009
Later among the works it cites.
C. G. Small, Expansions and asymptotics for statistics . CRC Press, 2010
2010
Later among the works it cites.
L. Batina, B. Gierlichs, E. Prouff, M. Rivain, F.-X. Standaert, and N. Veyrat-Charvillon, “Mutual information analysis: a comprehensive study,” Journal of Cryptology , vol. 24, no. 2, pp. 269–291, 2011
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
D. Holste, I. Grosse, and H. Herzel, “Bayes’ estimators of generalized entropies,” Journal of Physics A: Mathematical and General , vol. 31, no. 11, p. 2551, 1998
1998
Cited alongside, same era.
E. L. Lehmann and G. Casella, Theory of point estimation . Springer, 1998, vol. 31
1998
Cited alongside, same era.
P. Jacquet and W. Szpankowski, “Entropy computations via analytic depoissonization,” Information Theory, IEEE Transactions on , vol. 45, no. 4, pp. 1072–1081, 1999
1999
Cited alongside, same era.
P. Flajolet, “Singularity analysis and asymptotics of Bernoulli sums,” Theoretical Computer Science , vol. 215, no. 1, pp. 371–381, 1999
1999
Cited alongside, same era.
A. Antos and I. Kontoyiannis, “Convergence properties of functional estimates for discrete distributions,” Random Structures & Algorithms , vol. 19, no. 3-4, pp. 163–193, 2001
2001
Cited alongside, same era.
I. Nemenman, F. Shafee, and W. Bialek, “Entropy and inference, revisited,” Advances in neural information processing systems , vol. 1, pp. 471–478, 2002
2002
Cited alongside, same era.
J. P. Pluim, J. A. Maintz, and M. A. Viergever, “Mutual-information-based registration of medical images: a survey,” Medical Imaging, IEEE Transactions on , vol. 22, no. 8, pp. 986–1004, 2003
2003
Cited alongside, same era.
G. Valiant and P. Valiant, “Estimating the unseen: an n / log n n/\log n -sample estimator for entropy and support size, shown optimal via new CLTs,” in Proceedings of the 43rd annual ACM symposium on Theory of computing . ACM, 2011, pp. 685–694
2011
Later among the works it cites.
G. Valiant and P. Valiant, “The power of linear estimators,” in Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on . IEEE, 2011, pp. 403–412
2011
Later among the works it cites.
I. Nemenman, “Coincidences and estimation of entropies of random variables with large cardinalities,” Entropy , vol. 13, no. 12, pp. 2013–2023, 2011
2011
Later among the works it cites.
M. Vinck, F. P. Battaglia, V. B. Balakirsky, A. H. Vinck, and C. M. Pennartz, “Estimation of the entropy based on its polynomial representation,” Physical Review E , vol. 85, no. 5, p. 051139, 2012
2012
Later among the works it cites.
P. Valiant and G. Valiant, “Estimating the unseen: improved estimators for entropy and other properties,” in Advances in Neural Information Processing Systems , 2013, pp. 2157–2165
2013
Later among the works it cites.
S. Schober, “Some worst-case bounds for Bayesian estimators of discrete distributions,” in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on . IEEE, 2013, pp. 2194–2198
2013
Later among the works it cites.
S. Boucheron, G. Lugosi, and P. Massart, Concentration inequalities: A nonasymptotic theory of independence . Oxford University Press, 2013
2013
Later among the works it cites.
J. Cichoń, Z. Golkebiewski, M. Kardas, and M. Klonowski, “On delta-method of moments and probabilistic sums,” 2013
2013
Later among the works it cites.
2014
Later among the works it cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. New York: Wiley, 2006
2014
Later among the works it cites.
J. Jiao, K. Venkat, Y. Han, and T. Weissman, “Minimax estimation of functionals of discrete distributions,” Information Theory, IEEE Transactions on , vol. 61, no. 5, pp. 2835–2885, 2015
2015
Closest in time.
2015
Closest in time.
Y. Han, J. Jiao, and T. Weissman, “Minimax estimation of discrete distributions under ℓ 1 \ell_{1} loss,” IEEE Transactions on Information Theory , vol. 61, no. 11, pp. 6343–6354, 2015
2015
Closest in time.
Y. Han, J. Jiao, and T. Weissman, “Adaptive estimation of Shannon entropy,” in Information Theory (ISIT), 2015 IEEE International Symposium on . IEEE, 2015, pp. 1372–1376
2015
Closest in time.
J. Jiao, Y. Han, and T. Weissman, “Beyond maximum likelihood: Boosting the Chow-Liu algorithm for large alphabets,” in Signals, Systems and Computers, 2016 50th Asilomar Conference on . IEEE, 2016, pp. 321–325
2016
Closest in time.
Y. Wu and P. Yang, “Minimax rates of entropy estimation on large alphabets via best polynomial approximation,” IEEE Transactions on Information Theory , vol. 62, no. 6, pp. 3702–3720, 2016
2016
Closest in time.
2016
Closest in time.
J. Jiao, Y. Han, and T. Weissman, “Minimax estimation of the L 1 {L}_{1} distance,” in Information Theory (ISIT), 2016 IEEE International Symposium on . IEEE, 2016, pp. 750–754
2016
Closest in time.
2016
Closest in time.
A. Orlitsky, A. T. Suresh, and Y. Wu, “Optimal prediction of the number of unseen species,” Proceedings of the National Academy of Sciences , p. 201607774, 2016
2016
Closest in time.
2016
Closest in time.
J. Acharya, A. Orlitsky, A. T. Suresh, and H. Tyagi, “Estimating Rényi entropy of discrete distributions,” IEEE Transactions on Information Theory , vol. 63, no. 1, pp. 38–56, 2017
2017
Closest in time.
E. Archer, I. M. Park, and J. W. Pillow, “Bayesian estimation of discrete entropy with mixtures of stick-breaking priors,” in Advances in Neural Information Processing Systems , 2012, pp. 2015–2023
2023
Closest in time.