Predictive Learning on Hidden Tree-Structured Ising Models

MaRDI QIDQ6311041arXivFDO

Authors Konstantinos E. Nikolakakis, Dionysios S. Kalogerias, Anand Dilip Sarwate

Publication date 11 December 2018

Published in arXiv

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Neural nets applied to problems in time-dependent statistical mechanics (82C32)

arXiv classification

cs.LGmath.STstat.MLstat.THcs.ITmath.IT

Abstract: We provide high-probability sample complexity guarantees for exact structure recovery and accurate predictive learning using noise-corrupted samples from an acyclic (tree-shaped) graphical model. The hidden variables follow a tree-structured Ising model distribution, whereas the observable variables are generated by a binary symmetric channel taking the hidden variables as its input (flipping each bit independently with some constant probability $qin[0,1/2)$). In the absence of noise, predictive learning on Ising models was recently studied by Bresler and Karzand (2020); this paper quantifies how noise in the hidden model impacts the tasks of structure recovery and marginal distribution estimation by proving upper and lower bounds on the sample complexity. Our results generalize state-of-the-art bounds reported in prior work, and they exactly recover the noiseless case ($q=0$). In fact, for any tree with $p$ vertices and probability of incorrect recovery $delta>0$, the sufficient number of samples remains logarithmic as in the noiseless case, i.e., $mathcalO(log(p/delta))$, while the dependence on $q$ is $$, for both aforementioned tasks. We also present a new equivalent of Isserlis' Theorem for sign-valued tree-structured distributions, yielding a new low-complexity algorithm for higher-order moment estimation.

This page was built for publication: Predictive Learning on Hidden Tree-Structured Ising Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6311041)