Fetching the paper…
Reading the bibliography…
We analyze the problem of discrete distribution estimation under $\ell_1$ loss.
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.
C. Stein, “Inadmissibility of the usual estimator for the mean of a multivariate normal distribution,” in Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability , vol. 1, no. 399, 1956, pp. 197–206
1956
Earlier work this paper cites.
H. Steinhaus, “The problem of estimation,” The Annals of Mathematical Statistics , vol. 28, pp. 633–648, 1957
1957
Earlier work this paper cites.
S. Trybula, “Some problems of simultaneous minimax estimation,” The Annals of Mathematical Statistics , vol. 29, pp. 245–253, 1958
1958
Earlier work this paper cites.
J. Hájek, “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. Rutkowska, “Minimax estimation of the parameters of the multivariate hypergeometric and multinomial distributions,” Zastos. Mat. , vol. 16, pp. 9–21, 1977
1977
Earlier work this paper cites.
I. Olkin and M. Sobel, “Admissible and minimax estimation for the multinomial distribution and for independent binomial distributions,” The Annals of Statistics , vol. 7, pp. 284–290, 1979
1979
Earlier work this paper cites.
I. Csiszar and J. Körner, “Information theory: Coding theorems for discrete memoryless channels,” Budapest: Akadémiai Kiadó , 1981
1981
Earlier work this paper cites.
L. Devroye and L. Györfi, Nonparametric Density Estimation: The L 1 L_{1} View . New York, NY: John Wiley, 1985
1985
Earlier work this paper cites.
P. H. Algoet and T. M. Cover, “A sandwich proof of the shannon-mcmillan-breiman theorem,” The Annals of Probability , vol. 16, no. 2, pp. 899–909, 1988
1988
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 , vol. 6, no. 3, pp. 284–302, 1991
1991
Earlier work this paper cites.
K. Marton and P. C. Shields, “Entropy and the consistent estimation of joint distributions,” The Annals of Probability , vol. 22, no. 2, pp. 960–977, 1994
1994
Earlier work this paper cites.
D. L. Donoho and J. M. Johnstone, “Minimax risk over ℓ p \ell_{p} -balls for ℓ q \ell_{q} -error,” Probability Theory and Related Fields , vol. 99, pp. 277–303, 1994
1994
Cited alongside, same era.
D. L. Donoho and J. M. Johnstone, “Ideal spatial adaptation by wavelet shrinkage,” Biometrika , vol. 81, no. 3, pp. 425–455, 1994
1994
Cited alongside, same era.
E. L. Lehmann and G. Casella, Theory of Point Estimation , 2nd ed. New York, NY: Springer-Verlag, 1998
1998
Cited alongside, same era.
A. W. Van der Vaart, Asymptotic Statistics . Cambridge university press, 2000, vol. 3
2000
Cited alongside, same era.
A. Antos and I. Kontoyiannis, “Convergence properties of functional estimates for discrete distributions,” Random Struct. Algorithms , vol. 19, no. 3-4, pp. 163–193, 2001
2001
Cited alongside, same era.
C. Daskalakis, I. Diakonikolas, and R. A. Servedio, “Learning k-modal distributions via testing,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms , 2012, pp. 1371–1385
2012
Later among the works it cites.
J. F. Silva and P. A. Parada, “Shannon entropy convergence results in the countable infinite case,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on , July 2012, pp. 155–159
2012
Later among the works it cites.
T. T. Cai, “Minimax and adaptive inference in nonparametric function estimation,” Statistical Science , vol. 27, no. 1, pp. 31–50, 2012
2012
Later among the works it cites.
D. Berend and A. Kontorovich, “A sharp estimate of the binomial mean absolute deviation with applications,” Statistics & Probability Letters , vol. 83, no. 4, pp. 1254 – 1259, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Paninski, “Estimation of entropy and mutual information,” Neural Computation , vol. 15, no. 6, pp. 1191–1253, 2003
2003
Cited alongside, same era.
A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh, “Clustering with bregman divergences,” The Journal of Machine Learning Research , vol. 6, pp. 1705–1749, 2005
2005
Cited alongside, same era.
M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press, 2005
2005
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of Information Theory . New York, NY, USA: Wiley-Interscience, 2006
2006
Cited alongside, same era.
J. A. Adell and P. Jodra, “Exact Kolmogorov and total variation distances between some familiar discrete distributions,” Journal of Inequalities and Applications , vol. 2006, no. 1, pp. 1–8, 2006
2006
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 ACM Symposium on Theory of Computing , 2011, pp. 685–694
2011
Cited alongside, same era.
G. Valiant and P. Valiant, “The power of linear estimators,” in IEEE 52nd Annual Symposium on Foundations of Computer Science , Oct 2011, pp. 403–412
2011
Cited alongside, same era.
I. Diakonikolas, “Beyond histograms: Structure and distribution estimation,” in Workshop of the 46th ACM Symposium on Theory of Computing , 2014
2014
Closest in time.
S. Chan, I. Diakonikolas, R. A. Servedio, and X. Sun, “Efficient density estimation via piecewise polynomial approximation,” in 46th ACM Symposium on Theory of Computing , 2014, pp. 604–613
2014
Closest in time.
Y. Wu and P. Yang, “Minimax rates of entropy estimation on large alphabets via best polynomial approximation,” available on arXiv , 2014
2014
Closest in time.
——, “Beyond maximum likelihood: from theory to practice,” available on arXiv , 2014
2014
Closest in time.
S. Kamath, A. Orlitsky, V. Pichapati, and A. T. Suresh, “On learning distributions from their samples,” in Proceedings of The 28th Conference on Learning Theory , 2015, pp. 1066–1100
2015
Closest in time.
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.
J. Jiao, K. Venkat, Y. Han, and T. Weissman, “Maximum likelihood estimation of functionals of discrete distributions,” submitted to IEEE Transactions on Information Theory , 2015
2015
Closest in time.