Learning bounded-degree polytrees with known skeleton

MaRDI QIDQ7017107zbMATH OpenFDO

Authors Joy Qiping Yang, Arnab Bhattacharyya, Clement L. Canonne

Publication date 6 March 2025

Full work available at URL https://proceedings.mlr.press/v237/choo24a.html

zbMATH Keywords

Bayesian networkpolytreesample complexity

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• 10.1162/153244303321897717
• A linear non-Gaussian acyclic model for causal discovery
• Approximating discrete probability distributions with dependence trees
• Bayesian Networks and Decision Graphs
• Identifiability of Gaussian structural equation models with equal error variances
• Large-sample learning of Bayesian networks is NP-hard
• Learning factor graphs in polynomial time and sample complexity
• Learning quadratic variance function (QVF) DAG models via overdispersion scoring (ODS)
• Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
• Near-optimal learning of tree-structured distributions by Chow-Liu
• Probabilistic graphical models.
• Testing Bayesian Networks
• The sample complexity of learning fixed-structure Bayesian networks

This page was built for publication: Learning bounded-degree polytrees with known skeleton

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