Optimal Rates for Learning Hidden Tree Structures

Konstantinos E. Nikolakakis, Dionysios S. Kalogerias, Anand D. Sarwate

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…