Journal article
Varun R. Embar, Dhanya Sridhar, G. Farnadi, L. Getoor
ArXiv, 2018
ArXiv, 2018
Semantic Scholar
ArXiv
DBLP
Cite
Cite
APA
Click to copy
Embar, V. R., Sridhar, D., Farnadi, G., & Getoor, L. (2018). Scalable Structure Learning for Probabilistic Soft Logic. ArXiv.
Chicago/Turabian
Click to copy
Embar, Varun R., Dhanya Sridhar, G. Farnadi, and L. Getoor. “Scalable Structure Learning for Probabilistic Soft Logic.” ArXiv (2018).
MLA
Click to copy
Embar, Varun R., et al. “Scalable Structure Learning for Probabilistic Soft Logic.” ArXiv, 2018.
BibTeX Click to copy
@article{varun2018a,
title = {Scalable Structure Learning for Probabilistic Soft Logic},
year = {2018},
journal = {ArXiv},
author = {Embar, Varun R. and Sridhar, Dhanya and Farnadi, G. and Getoor, L.}
}
Abstract
Statistical relational frameworks such as Markov logic networks and probabilistic soft logic (PSL) encode model structure with weighted first-order logical clauses. Learning these clauses from data is referred to as structure learning. Structure learning alleviates the manual cost of specifying models. However, this benefit comes with high computational costs; structure learning typically requires an expensive search over the space of clauses which involves repeated optimization of clause weights. In this paper, we propose the first two approaches to structure learning for PSL. We introduce a greedy search-based algorithm and a novel optimization method that trade-off scalability and approximations to the structure learning problem in varying ways. The highly scalable optimization method combines data-driven generation of clauses with a piecewise pseudolikelihood (PPLL) objective that learns model structure by optimizing clause weights only once. We compare both methods across five real-world tasks, showing that PPLL achieves an order of magnitude runtime speedup and AUC gains up to 15% over greedy search.
