当前位置：
X-MOL 学术
›
Int. J. Approx. Reason.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Learning directed acyclic graph SPNs in sub-quadratic time
International Journal of Approximate Reasoning ( IF 3.2 ) Pub Date : 2020-05-01 , DOI: 10.1016/j.ijar.2020.01.005 Amur Ghose , Priyank Jaini , Pascal Poupart
International Journal of Approximate Reasoning ( IF 3.2 ) Pub Date : 2020-05-01 , DOI: 10.1016/j.ijar.2020.01.005 Amur Ghose , Priyank Jaini , Pascal Poupart
Abstract In this paper, we present Prometheus, a graph partitioning based algorithm that creates multiple variable decompositions efficiently for learning Sum-Product Network structures across both continuous and discrete domains. Prometheus proceeds by creating multiple candidate decompositions that are represented compactly with an acyclic directed graph in which common parts of different decompositions are shared. It eliminates the correlation threshold hyperparameter often used in other structure learning techniques, allowing Prometheus to learn structures that are robust in low data regimes. Prometheus outperforms other structure learning techniques in 30 discrete and continuous domains. We also extend Prometheus to exploit sparsity in correlations between features in order to obtain an efficient sub-quadratic algorithm (w.r.t. the number of features) that scales better to high dimensional datasets.
更新日期：2020-05-01
京公网安备 11010802027423号