Fetching the paper…
Reading the bibliography…
We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample.
G. H. Hardy and S. Ramanujan, “Asymptotic formulaæ in combinatory analysis,” Proceedings of the London Mathematical Society , vol. 2, no. 1, pp. 75–115, 1918
1918
Earlier work this paper cites.
A. Kolmogoroff, “Sur l’éstimation statistique des paramètres be la loi de gauss,” Izvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya , vol. 6, no. 1, pp. 3–32, 1942
1942
Earlier work this paper cites.
A. Wald, Statistical decision functions. Wiley, 1950
1950
Earlier work this paper cites.
F. Auluck, “On partitions of bipartite numbers,” in Mathematical Proceedings of the Cambridge Philosophical Society , vol. 49, no. 01. Cambridge Univ Press, 1953, pp. 72–83
1953
Earlier work this paper cites.
A. Birnbaum, “On the foundations of statistical inference,” Journal of the American Statistical Association , vol. 57, no. 298, pp. 269–306, 1962
1962
Earlier work this paper cites.
L. Le, “Sufficiency and approximate sufficiency,” The Annals of Mathematical Statistics , pp. 1419–1455, 1964
1964
Earlier work this paper cites.
J. Hájek, “On basic concepts of statistics,” in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probabilities , vol. 1, 1967, pp. 139–162
1967
Earlier work this paper cites.
S. Vallender, “Calculation of the wasserstein distance between probability distributions on the line,” Theory of Probability & Its Applications , vol. 18, no. 4, pp. 784–786, 1974
1974
Earlier work this paper cites.
L. Le Cam, “Maximum likelihood: an introduction,” Statistics Branch, Department of Mathematics, University of Maryland , 1979
1979
Earlier work this paper cites.
D. A. Blackwell and M. A. Girshick, Theory of games and statistical decisions . Courier Corporation, 1979
1979
Earlier work this paper cites.
L. G. Valiant, “The complexity of computing the permanent,” Theoretical Computer Science , vol. 8, pp. 189–201, 1979
1979
Earlier work this paper cites.
B. Efron, “Maximum likelihood and decision theory,” The Annals of Statistics , pp. 340–356, 1982
1982
Earlier work this paper cites.
I. Bárány and A. Vershik, “On the number of convex lattice polytopes,” Geometric and Functional Analysis , vol. 2, no. 4, pp. 381–393, 1992
1992
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.
A. W. Van der Vaart, Asymptotic statistics . Cambridge university press, 2000, vol. 3
2000
Cited alongside, same era.
S. A. Murphy and A. W. Van der Vaart, “On profile likelihood,” Journal of the American Statistical Association , vol. 95, no. 450, pp. 449–465, 2000
2000
Cited alongside, same era.
T. Batu, L. Fortnow, R. Rubinfeld, W. D. Smith, and P. White, “Testing that distributions are close,” in Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on . IEEE, 2000, pp. 259–269
2000
Cited alongside, same era.
L. Paninski, “Estimation of entropy and mutual information,” Neural Computation , vol. 15, no. 6, pp. 1191–1253, 2003
2003
Cited alongside, same era.
A. Orlitsky, N. P. Santhanam, K. Viswanathan, and J. Zhang, “On modeling profiles instead of values,” in Proceedings of the 20th conference on Uncertainty in artificial intelligence . AUAI Press, 2004, pp. 426–435
W. Fernandes and N. Kashyap, “A phase transition for the uniform distribution in the pattern maximum likelihood problem,” in ITW , 2013
2013
Later among the works it cites.
C. L. Chan, W. Fernandes, N. Kashyap, and M. Krishnapur, “Phase transitions for the uniform distribution in the pattern maximum likelihood problem and its Bethe approximation,” SIAM J. Discrete Math , vol. 31, pp. 597–631, 2015
2015
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
P. Valiant, “Testing symmetric properties of distributions,” Ph.D. dissertation, Massachusetts Institute of Technology, 2008
2008
Cited alongside, same era.
D. P. Palomar and S. Verdú, “Lautum information,” IEEE transactions on information theory , vol. 54, no. 3, pp. 964–975, 2008
2008
Cited alongside, same era.
J. Acharya, A. Orlitsky, and S. Pan, “The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns,” in Information Theory (ISIT), 2009 IEEE International Symposium on . IEEE, 2009, pp. 1135–1139
2009
Cited alongside, same era.
J. Acharya, H. Das, A. Jafarpour, A. Orlitsky, and S. Pan, “Competitive closeness testing,” in Proceedings of the 24th Annual Conference on Learning Theory , 2011, pp. 47–68
2011
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 the 43rd ACM Symposium on Theory of Computing (STOC) , 2011
2011
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. Wang and M. Song, “Ckmeans.1d.dp: Optimal k-means clustering in one dimension by dynamic programming,” The R Journal , vol. 3, no. 2, pp. 29–33, 2011
2011
Cited alongside, same era.
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
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.
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.
D. S. Pavlichin, J. Jiao, and T. Weissman, “Approximate profile maximum likelihood,” 2017. [Online]. Available: https://doi.org/10.5281/zenodo.1043617
2017
Closest in time.
2017
Closest in time.
J. Jiao, K. Venkat, and T. Weissman, “Relations between information and estimation in discrete-time Lévy channels,” IEEE Transactions on Information Theory , 2017
2017
Closest in time.
“The online encyclopedia of integer sequences (OEIS)–a007716,” https://oeis.org/A007716 , accessed: 2017-05-16
2017
Closest in time.