Probabilistic Logic Programming (PLP) combines logic and probability for representing and reasoning over domains with uncertainty. Hierarchical probability Logic Programming (HPLP) is a recent language of PLP whose clauses are hierarchically organized forming a deep neural network or arithmetic circuit. Inference in HPLP is done by circuit evaluation and learning is therefore cheaper than any generic PLP language. We present in this paper an Expectation Maximization algorithm, called Expectation Maximization Parameter learning for HIerarchical Probabilistic Logic programs (EMPHIL), for learning HPLP parameters. The algorithm converts an arithmetic circuit into a Bayesian network and performs the belief propagation algorithm over the corresponding factor graph.
|Titolo:||Expectation Maximization in Deep Probabilistic Logic Programming|
NGUEMBANG FADJA, Arnaud (Corresponding)
RIGUZZI, Fabrizio (Corresponding)
LAMMA, Evelina (Corresponding)
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||04.2 Contributi in atti di convegno (in Volume)|