Fetching the paper…
Reading the bibliography…
Given side information that an Ising tree-structured graphical model is homogeneous and has no external field, we derive the exact asymptotics of learning its structure from independently drawn samples.
1909
Earlier work this paper cites.
D. Blackwell and J. L. Hodges, “The probability in the extreme tail of a convolution,” Ann. Math. Statist. , vol. 30, no. 4, pp. 1113–1120, Dec. 1959
1959
Earlier work this paper cites.
R. R. Bahadur and R. Ranga Rao, “On deviations of the sample mean,” Ann. Math. Statist. , vol. 31, no. 4, pp. 1015–1027, Dec. 1960
1960
Earlier work this paper cites.
C. K. Chow and C. N. Liu, “Approximating discrete probability distributions with dependence trees,” IEEE Trans. Inform. Theory , vol. 14, no. 3, pp. 462–467, May 1968
1968
Earlier work this paper cites.
C. K. Chow and T. J. Wagner, “Consistency of an estimate of tree-dependent probability distributions,” IEEE Trans. Inform. Theory , vol. 19, no. 3, pp. 369–371, May 1973
1973
Earlier work this paper cites.
I. Herstein, Topics In Algebra , 2nd ed. John Wiley and Sons, New York, 1975
1975
Earlier work this paper cites.
J. Besag, “On the statistical analysis of dirty pictures,” J. Roy. Statist. Soc., Ser. B , vol. 48, no. 3, pp. 259–302, 1986
1986
Earlier work this paper cites.
A. D. M. Kester and W. C. M. Kallenberg, “Large deviations of estimators,” Ann. Statist. , vol. 14, no. 2, pp. 648–664, 1986
1986
Earlier work this paper cites.
S. Lauritzen, Graphical Models . Oxford, U.K.: Oxford Univ. Press, 1996
1996
Earlier work this paper cites.
F. R. Kschischang and B. J. Frey, “Iterative decoding of compound codes by probability propagation in graphical models,” IEEE J. Sel. Areas Commun. , vol. 16, no. 2, pp. 219–230, 1998
1998
Earlier work this paper cites.
F. den Hollander, Large Deviations , ser. Fields Institute Monographs. American Mathematical Soc., 2000
2000
Earlier work this paper cites.
I. Csiszár and F. Matús̆, “Information projections revisited,” IEEE Trans. Inform. Theory , vol. 49, no. 6, pp. 1474–1490, Jun. 2003
2003
Cited alongside, same era.
F. Topsøe, “Some bounds for the logarithmic function,” RGMIA Res. Rep. Collection , vol. 7, no. 2, 2004
2004
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. Hoboken, N.J.: Wiley-Interscience, 2006
2006
Cited alongside, same era.
E. Maneva, E. Mossel, and M. J. Wainwright, “A new look at survey propagation and its generalizations,” Journal of the ACM , vol. 54, no. 4, pp. 2–41, 2007
2007
Cited alongside, same era.
M. J. Wainwright and M. I. Jordan, “Graphical models, exponential families, and variational inference,” Found. Trends Mach. Learn. , vol. 1, no. 1-2, pp. 1–305, 2008
2008
Cited alongside, same era.
R. Tandon, K. Shanmugam, P. Ravikumar, and A. G. Dimakis, “On the information theoretic limits of learning Ising models,” in Proc. NeurIPS , Montreal, Canada, 2014, pp. 2303–2311
2014
Later among the works it cites.
G. Bresler, “Efficiently learning Ising models on arbitrary graphs,” in Proc. ACM Symp. Theory Comp. (STOC) , New York, NY, USA, 2015, pp. 771–782
2015
Later among the works it cites.
G. Dasarathy, A. Singh, M.-F. Balcan, and J. H. Park, “Active learning algorithms for graphical model selection,” in Proc. AISTATS , Cadiz, Spain, 2016, pp. 1356–1364
2016
Later among the works it cites.
J. Scarlett and V. Cevher, “Lower bounds on active learning for graphical model selection,” in Proc. AISTATS , Fort Lauderdale, Flordia, USA, 2017, pp. 1356–1364
2017
Later among the works it cites.
P. Moulin, “The log-volume of optimal codes for memoryless channels, asymptotically within a few nats,” IEEE Trans. Inform. Theory , vol. 63, no. 4, pp. 2278–2313, Apr. 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms , 3rd ed. Cambridge, M.A.: The MIT Press, 2009
2009
Cited alongside, same era.
R. Navigli and M. Lapata, “An experimental study of graph connectivity for unsupervised word sense disambiguation,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 32, no. 4, pp. 678–692, 2010
2010
Cited alongside, same era.
V. Y. F. Tan, A. Anandkumar, and A. S. Willsky, “Learning Gaussian tree models: Analysis of error exponents and extremal structures,” IEEE Trans. Signal Process. , vol. 58, no. 5, pp. 2701–2714, May 2010
2010
Cited alongside, same era.
V. Y. F. Tan, A. Anandkumar, L. Tong, and A. S. Willsky, “A large-deviation analysis of the maximum-likelihood learning of Markov tree structures,” IEEE Trans. Inform. Theory , vol. 57, no. 3, pp. 1714–1735, Mar. 2011
2011
Cited alongside, same era.
M. J. Choi, V. Y. F. Tan, A. Anandkumar, and A. S. Willsky, “Learning latent tree graphical models,” J. Mach. Learn. Res. , vol. 12, pp. 1771–1812, 2011
2011
Cited alongside, same era.
A. Anandkumar, V. Y. F. Tan, F. Huang, and A. S. Willsky, “High-dimensional structure estimation in Ising models: Local separation criterion,” Ann. Statist. , vol. 40, no. 3, pp. 1346–1375, 2012
2012
Cited alongside, same era.
2017
Later among the works it cites.
E. Haim, Y. Kochman, and U. Erez, “On random-coding union bounds with and without erasures,” IEEE Trans. Inform. Theory , vol. 64, no. 6, pp. 4294–4308, Jun 2018
2018
Later among the works it cites.
Y. Cheng, I. Diakonikolas, D. M. Kane, and A. Stewart, “Robust learning of fixed-structure Bayesian networks,” in Proc. NeurIPS , Montreal, Canada, 2018, pp. 10 304–10 316
2018
Later among the works it cites.
K. E. Nikolakakis, D. S. Kalogerias, and A. D. Sarwate, “Learning tree structures from noisy data,” in Proc. AISTATS , Naha, Okinawa, Japan, 2019, pp. 1771–1782
2019
Later among the works it cites.
2019
Later among the works it cites.