Fetching the paper…
Reading the bibliography…
We provide high probability finite sample complexity guarantees for hidden non-parametric structure learning of tree-shaped graphical models, whose hidden and observable nodes are discrete random variables with either finite or countable alphabets.
Efficient learning of discrete graphical models
Marc Vuffray, Sidhant Misra, and Andrey Y. Lokhov · 1902
Earlier work this paper cites.
Randomized response: A survey technique for eliminating evasive answer bias
Stanley L. Warner · 1965
Earlier work this paper cites.
Approximating discrete probability distributions with dependence trees
C Chow and Cong Liu · 1968
Earlier work this paper cites.
Graphical Models , volume 17
Steffen L Lauritzen · 1996
Earlier work this paper cites.
Convergence properties of functional estimates for discrete distributions
András Antos and Ioannis Kontoyiannis · 2001
Earlier work this paper cites.
Learning Markov networks: Maximum bounded tree-width graphs
David Karger and Nathan Srebro · 2001
Earlier work this paper cites.
Limiting privacy breaches in privacy preserving data mining
Alexandre Evfimievski, Johannes Gehrke, and Ramakrishnan Srikant · 2003
Earlier work this paper cites.
Robust estimation of tree structured Ising models
Ashish Katiyar, Vatsal Shah, and Constantine Caramanis · 2006
Earlier work this paper cites.
Efficient structure learning of Markov networks using ℓ 1 \ell_{1} -regularization
Su-In Lee, Varun Ganapathi, and Daphne Koller · 2006
Earlier work this paper cites.
Reconstruction of Markov random fields from samples: Some observations and algorithms
Guy Bresler, Elchanan Mossel, and Allan Sly · 2008
Earlier work this paper cites.
What can we learn privately?
S. A. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith · 2008
Earlier work this paper cites.
What can we learn privately?
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith · 2008
Earlier work this paper cites.
Probabilistic Graphical Models: Principles and Techniques
Daphne Koller and Nir Friedman · 2009
Earlier work this paper cites.
Introduction to Non-parametric Estimation. Revised and Extended from the 2004 French Original. Translated by Vladimir Zaiats, 2009
Alexandre B Tsybakov · 2009
Earlier work this paper cites.
Lectures on statistical learning theory for Chow-Liu trees
Timo Koski · 2010
Earlier work this paper cites.
High-dimensional Ising model selection using L1-regularized logistic regression
Pradeep Ravikumar, Martin J Wainwright, John D Lafferty, et al · 2010
Cited alongside, same era.
Learning gaussian tree models: Analysis of error exponents and extremal structures
Vincent YF Tan, Animashree Anandkumar, and Alan S Willsky · 2010
Cited alongside, same era.
Near-optimal learning of tree-structured distributions by Chow-Liu
Arnab Bhattacharyya, Sutanu Gayen, Eric Price, and NV Vinodchandran · 2011
Cited alongside, same era.
Forest density estimation
Han Liu, Min Xu, Haijie Gu, Anupam Gupta, John Lafferty, and Larry Wasserman · 2011
Cited alongside, same era.
A large-deviation analysis of the maximum-likelihood learning of Markov tree structures
V. Y. F. Tan, A. Anandkumar, L. Tong, and A. S. Willsky · 2011
Cited alongside, same era.
Interaction screening: Efficient and sample-optimal learning of Ising models
Marc Vuffray, Sidhant Misra, Andrey Lokhov, and Michael Chertkov · 2016
Later among the works it cites.
Information theoretic properties of Markov random fields, and their algorithmic applications
Linus Hamilton, Frederic Koehler, and Ankur Moitra · 2017
Later among the works it cites.
Strong data-processing inequalities for channels and Bayesian networks
Yury Polyanskiy and Yihong Wu · 2017
Later among the works it cites.
Is interaction necessary for distributed private learning?
A. Smith, A. Thakurta, and J. Upadhyay · 2017
Later among the works it cites.
Shannon entropy estimation in ∞ \infty alphabets from convergence results: Studying plug-in estimators
Jorge Silva · 2018
Later among the works it cites.
Learning of tree-structured Gaussian graphical models on distributed data under communication constraints
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A large-deviation analysis of the maximum-likelihood learning of Markov tree structures
Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, and Alan S. Willsky · 2011
Cited alongside, same era.
Large-deviation analysis and applications Of learning tree-structured graphical models
Vincent Yan Fu Tan · 2011
Cited alongside, same era.
Elements of Information Theory
Thomas M Cover and Joy A Thomas · 2012
Cited alongside, same era.
Information-theoretic limits of selecting binary graphical models in high dimensions
Narayana P Santhanam and Martin J Wainwright · 2012
Cited alongside, same era.
Robust estimation in signal processing: A tutorial-style treatment of fundamental concepts
A. M. Zoubir, V. Koivunen, Y. Chakhchoukh, and M. Muma · 2012
Cited alongside, same era.
Local privacy and statistical minimax rates
J. C. Duchi, M. I. Jordan, and M. J. Wainwright · 2013
Cited alongside, same era.
Hardness of parameter estimation in graphical models
Guy Bresler, David Gamarnik, and Devavrat Shah · 2014
Cited alongside, same era.
M. Tavassolipour, S. A. Motahari, and M. M. Shalmani · 2018
Later among the works it cites.
On information-theoretic characterizations of Markov random fields and subfields
Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, and Pierre Moulin · 2018
Later among the works it cites.
Learning Ising models with independent failures
Surbhi Goel, Daniel M Kane, and Adam R Klivans · 2019
Closest in time.
Learning tree structures from noisy data
Konstantinos E. Nikolakakis, Dionysios S. Kalogerias, and Anand D. Sarwate · 2019
Closest in time.
Learning a tree-structured Ising model in order to make predictions
Guy Bresler and Mina Karzand · 2020
Closest in time.
Exact asymptotics for learning tree-structured graphical models with side information: Noiseless and noisy samples
Anshoo Tandon, Vincent YF Tan, and Shiyao Zhu · 2020
Closest in time.
Robust estimation of tree structured models
Marta Casanellas, Marina Garrote-López, and Piotr Zwiernik · 2021
Closest in time.
Robust estimation of tree structured markov random fields
Ashish Katiyar, Soumya Basu, Vatsal Shah, and Constantine Caramanis · 2021
Closest in time.
Predictive learning on hidden tree-structured Ising models
Konstantinos E. Nikolakakis, Dionysios S. Kalogerias, and Anand D. Sarwate · 2021
Closest in time.
SGA: A robust algorithm for partial recovery of tree-structured graphical models with noisy samples
Anshoo Tandon, Aldric H. J. Yuan, and Vincent Y. F. Tan · 2021
Closest in time.