Learning directed acyclic graph SPNs in sub-quadratic time

DOI10.1016/j.ijar.2020.01.005zbMath1433.68342OpenAlexW3006484274MaRDI QIDQ2310290

Amur Ghose, Pascal Poupart, Priyank Jaini

Publication date: 6 April 2020

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2020.01.005

zbMATH Keywords

Bayesian networksdirected acyclic graphprobabilistic graphical modelsstructure learningsum-product networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Uses Software

• QUIC
• STL-10 dataset

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Correlation clustering
• The restricted isometry property and its implications for compressed sensing
• A simple proof of the restricted isometry property for random matrices
• Balanced partitions of trees and applications
• Exact Recovery in the Stochastic Block Model
• Certifying the Restricted Isometry Property is Hard
• A differential approach to inference in Bayesian networks
• A randomized linear-time algorithm to find minimum spanning trees
• Detecting the large entries of a sparse covariance matrix in sub-quadratic time
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Learning directed acyclic graph SPNs in sub-quadratic time