سند علمی

Testing Bayesian Networks

چکیده

This work initiates a systematic investigation of testing high-dimensional structured distributions by focusing on testing Bayesian networks – the prototypical family of directed graphical models. A Bayesian network is defined by a directed acyclic graph, where we associate a random variable with each node. The value at any particular node is conditionally independent of all the other nondescendant nodes once its parents are fixed. Specifically, we study the properties of identity testing and closeness testing of Bayesian networks. Our main contribution is the first non-trivial efficient testing algorithms for these problems and corresponding information-theoretic lower bounds. For a wide range of parameter settings, our testing algorithms have sample complexity sublinear in the dimension and are sample-optimal, up to constant factors.

اسناد مشابه

  • Testing Bayesian Networks

    مقاله‌ی دسترسی آزاد۲۰۲۰IEEE Transactions on Information TheoryClement L.Canonne, IliasDiakonikolas, Daniel M.Kane, AlistairStewart
  • Building adaptive tests using Bayesian networks

    سند علمی۲۰۰۴KybernetikaJirí Vomlel

    1 JlŘÍ VOMLEL Wc propose a framework for building decision strategies using Bayesian network models and discuss its application to adaptive testing. Dynamic programming and AO* algorithm are used to find optimal adaptive tests. The proposed AO* algorithm is based on a new admissi

  • Permutation Testing Improves Bayesian Network Learning

    سند علمی۲۰۱۰ECML/PKDDIoannis Tsamardinos, Giorgos Borboudakis

    We are taking a peek “under the hood” of constraint-based learning of graphical models such as Bayesian Networks. This mainstream approach to learning is founded on performing statistical tests of conditional independence. In all prior work however, the tests employed for categor

  • A Hypothesis Test for Equality of Bayesian Network Models

    سند علمی۲۰۱۰EURASIP J. Bioinformatics and Systems BiologyAnthony Almudevar

    Bayesian network models are commonly used to model gene expression data. Some applications require a comparison of the network structure of a set of genes between varying phenotypes. In principle, separately fit models can be directly compared, but it is difficult to assign stati

  • Measuring the Hardness of Stochastic Sampling on Bayesian Networks with Deterministic Causalities: the k-Test

    سند علمی۲۰۱۱UAIHaohai Yu, Robert A. van Engelen

    Approximate Bayesian inference is NP-hard. Dagum and Luby defined the Local Variance Bound (LVB) to measure the approximation hardness of Bayesian inference on Bayesian networks, assuming the networks model strictly positive joint probability distributions, i.e. zero probabilitie

  • Constructing Bayesian-network models of software testing and maintenance uncertainties

    سند علمی۱۹۹۷ICSMHadar Ziv, Debra J. Richardson

    The lifetime of many software systems is surprisingly long, often far exceeding initial plans and expectations. During development and maintenance of long-lived software, requirements are analyzed and speci ed, designs and code modules are developed, testing is planned, and code