In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.

Example Input: A BN20 network is a two level belief net in which parent interactions are modeled using the noisy-or interaction model. In this paper we discuss application of the SPI local expression language [1] to effi cient inference in large BN20 networks. In particular, we show that there is sig nificant structure which can be exploited to improve over the Quickscore result. We further describe how symbolic tech niques can provide information which can significantly reduce the computation required for computing all cause poste rior marginals. Finally, we present a novel approximation technique with pre liminary experimental results.
Example Output: Symbolic Probabilistic Inference in large BN20 networks

Example Input: We marry ideas from deep neural networks and approximate Bayesian inference to derive a generalised class of deep, directed generative models, endowed with a new algorithm for scalable inference and learning. Our algorithm introduces a recognition model to represent approximate posterior distributions, and that acts as a stochastic encoder of the data. We develop stochastic backpropagation rules for back-propagation through stochastic variables and use this to develop an algorithm that allows for joint optimisation of the parameters of both the generative and recognition model. We demonstrate on several real-world data sets that the model generates realistic samples, provides accurate imputations of missing data and is a useful tool for high-dimensional data visualisation.
Example Output: Stochastic Back-propagation and Variational Inference in Deep Latent Gaussian Models

Example Input: In Machine Learning, the parent set identification problem is to find a set of random variables that best explain selected variable given the data and some predefined scoring function. This problem is a critical component to structure learning of Bayesian networks and Markov blankets discovery, and thus has many practical applications ranging from fraud detection to clinical decision support. In this paper, we introduce a new distributed memory approach to the exact parent sets assignment problem. To achieve scalability, we derive theoretical bounds to constraint the search space when MDL scoring function is used, and we reorganize the underlying dynamic programming such that the computational density is increased and fine-grain synchronization is eliminated. We then design efficient realization of our approach in the Apache Spark platform. Through experimental results, we demonstrate that the method maintains strong scalability on a 500-core standalone Spark cluster, and it can be used to efficiently process data sets with 70 variables, far beyond the reach of the currently available solutions.
Example Output:
Scalable Exact Parent Sets Identification in Bayesian Networks Learning with Apache Spark