Towards Scalable and Robust Sum-Product Networks

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Sum-Product Networks (SPNs) and their credal counterparts are machine learning models that combine good representational power with tractable inference. Yet they often have thousands of nodes which result in high processing times. We propose the addition of caches to the SPN nodes and show how this memoisation technique reduces inference times in a range of experiments. Moreover, we introduce class-selective SPNs, an architecture that is suited for classification tasks and enables efficient robustness computation in Credal SPNs. We also illustrate how robustness estimates relate to reliability through the accuracy of the model, and how one can explore robustness in ensemble modelling.

Author supplied keywords

Cite

CITATION STYLE

APA

Correia, A. H. C., & de Campos, C. P. (2019). Towards Scalable and Robust Sum-Product Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11940 LNAI, pp. 409–422). Springer. https://doi.org/10.1007/978-3-030-35514-2_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free