Bounding the false discovery rate in local Bayesian network learning

Modern Bayesian Network learning algorithms are time-efficient, scalable and produce high-quality models; these al-gorithms feature prominently in decision support model de-velopment, variable selection, and causal discovery. The quality of the models, however, has often only been em-pirically evaluated; the available theoretical results typically guarantee asymptotic correctness (consistency) of the algo-rithms. This paper describes theoretical bounds on the quality of a fundamental Bayesian Network local-learning task in the finite sample using theories for controlling the False Discov-ery Rate. The behavior of the derived bounds is investigated across various problem and algorithm parameters. Empirical results support the theory which has immediate ramifications in the design of new algorithms for Bayesian Network learn-ing, variable selection and causal discovery