Fetching the paper…
Reading the bibliography…
We consider the problem of estimating the $L_1$ distance between two discrete probability measures $P$ and $Q$ from empirical data in a nonasymptotic and large alphabet setting.
S. Bernstein, “Sur la meilleure approximation de | x | |x| par des polynomes de degrés donnés,” Acta Mathematica , vol. 37, no. 1, pp. 1–57, 1914
1914
Earlier work this paper cites.
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.
W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American statistical association , vol. 58, no. 301, pp. 13–30, 1963
1963
Earlier work this paper cites.
C. S. Withers, “Bias reduction by Taylor series,” Communications in Statistics-Theory and Methods , vol. 16, no. 8, pp. 2369–2383, 1987
1987
Earlier work this paper cites.
Z. Ditzian and V. Totik, Moduli of smoothness . Springer, 1987
1987
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.
R. A. DeVore and G. G. Lorentz, Constructive approximation . Springer, 1993, vol. 303
1993
Earlier work this paper cites.
L. Devroye, L. Györfi, and G. Lugosi, “A probabilistic theory of pattern recognition,” 1996
1996
Earlier work this paper cites.
R. Latala, “Estimation of moments of sums of independent real random variables,” The Annals of Probability , pp. 1502–1513, 1997
1997
Earlier work this paper cites.
E. L. Lehmann and G. Casella, Theory of point estimation . Springer, 1998, vol. 31
1998
Earlier work this paper cites.
O. Lepski, A. Nemirovski, and V. Spokoiny, “On estimation of the L r {L}_{r} norm of a regression function,” Probability theory and related fields , vol. 113, no. 2, pp. 221–253, 1999
1999
Earlier work this paper cites.
E. L. Lehmann and J. P. Romano, Testing statistical hypotheses . Springer, 2005
2005
Earlier work this paper cites.
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 , 2nd ed. New York: Wiley, 2006
2006
Cited alongside, same era.
A. Tsybakov, Introduction to Nonparametric Estimation . Springer-Verlag, 2008
2008
Cited alongside, same era.
A. Hoorfar and M. Hassani, “Inequalities on the lambert W W function and hyperpower function,” J. Inequal. Pure and Appl. Math , vol. 9, no. 2, pp. 5–9, 2008
2008
Cited alongside, same era.
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
Cited alongside, same era.
H. Robbins, “A remark on Stirling’s formula,” The American Mathematical Monthly , vol. 62, no. 1, pp. 26–29, 1955
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
Later among the works it cites.
2015
Later among the works it cites.
Y. Han, J. Jiao, and T. Weissman, “Minimax estimation of discrete distributions under l 1 l_{1} loss,” IEEE Transactions on Information Theory , vol. 61, no. 11, pp. 6343–6354, 2015
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. T. Cai and M. G. Low, “Testing composite hypotheses, Hermite polynomials and optimal estimation of a nonsmooth functional,” The Annals of Statistics , vol. 39, no. 2, pp. 1012–1041, 2011
2011
Cited alongside, same era.
G. Peccati and M. S. Taqqu, “Some facts about Charlier polynomials,” in Wiener Chaos: Moments, Cumulants and Diagrams . Springer, 2011, pp. 171–175
2011
Cited alongside, same era.
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
Cited alongside, same era.
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
Cited alongside, same era.
A. Tsybakov, “Aggregation and high-dimensional statistics,” Lecture notes for the course given at the École d’été de Probabilités in Saint-Flour, URL http://www. crest. fr/ckfinder/userfiles/files/Pageperso/ATsybakov/Lecture_notes_SFlour. pdf , vol. 16, p. 20, 2013
2013
Cited alongside, same era.
H. N. Mhaskar, P. Nevai, and E. Shvarts, “Applications of classical approximation theory to periodic basis function networks and computational harmonic analysis,” Bulletin of Mathematical Sciences , vol. 3, no. 3, pp. 485–549, 2013
2013
Cited alongside, same era.
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
Cited alongside, same era.
2016
Later among the works it cites.
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
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
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, Jan 2017
2017
Closest in time.
2017
Closest in time.
J. Acharya, H. Das, A. Orlitsky, and A. T. Suresh, “A unified maximum likelihood approach for estimating symmetric properties of discrete distributions,” in International Conference on Machine Learning , 2017, pp. 11–21
2017
Closest in time.
Y. Bu, S. Zou, Y. Liang, and V. V. Veeravalli, “Estimation of KL divergence: Optimal minimax rate,” IEEE Transactions on Information Theory , vol. 64, no. 4, pp. 2648–2674, 2018
2018
Closest in time.