# Provable learning of noisy-or networks

## Author(s): Arora, Sanjeev; Ge, R; Ma, T; Risteski, A

DownloadTo refer to this page use:

`http://arks.princeton.edu/ark:/88435/pr1n431`

Abstract: | Many machine learning applications use latent variable models to explain structure in data, whereby visible variables (= coordinates of the given datapoint) are explained as a probabilistic function of some hidden variables. Finding parameters with the maximum likelihood is NP-hard even in very simple settings. In recent years, provably efficient algorithms were nevertheless developed for models with linear structures: topic models, mixture models, hidden Markov models, etc. These algorithms use matrix or tensor decomposition, and make some reasonable assumptions about the parameters of the underlying model. But matrix or tensor decomposition seems of little use when the latent variable model has nonlinearities. The current paper shows how to make progress: tensor decomposition is applied for learning the single-layer noisy or network, which is a textbook example of a Bayes net, and used for example in the classic QMR-DT software for diagnosing which disease(s) a patient may have by observing the symptoms he/she exhibits. The technical novelty here, which should be useful in other settings in future, is analysis of tensor decomposition in presence of systematic error (i.e., where the noise/error is correlated with the signal, and doesn't decrease as number of samples goes to infinity). This requires rethinking all steps of tensor decomposition methods from the ground up. For simplicity our analysis is stated assuming that the network parameters were chosen from a probability distribution but the method seems more generally applicable. |

Publication Date: | 2017 |

Citation: | Arora, S, Ge, R, Ma, T, Risteski, A. (2017). Provable learning of noisy-or networks. Part F128415 (1057 - 1066. doi:10.1145/3055399.3055482 |

DOI: | doi:10.1145/3055399.3055482 |

Pages: | 1057 - 1066 |

Type of Material: | Conference Article |

Journal/Proceeding Title: | Proceedings of the Annual ACM Symposium on Theory of Computing |

Version: | Author's manuscript |

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.