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.

[EX Q]: This paper is about reducing influence dia­ gram (ID) evaluation into Bayesian network (BN) inference problems. Such reduction is interesting because it enables one to read­ ily use one's favorite BN inference algorithm to efficiently evaluate IDs. Two such reduc­ tion methods have been proposed previously (Cooper 1988, Shachter and Peot 1992). This paper proposes a new method. The BN in­ ference problems induced by the mew method are much easier to solve than those induced by the two previous methods.
[EX A]: Probabilistic Inference in Influence Diagrams

[EX Q]: This manuscript develops the theory of agglomerative clustering with Bregman divergences. Geometric smoothing techniques are developed to deal with degenerate clusters. To allow for cluster models based on exponential families with overcomplete representations, Bregman divergences are developed for nondifferentiable convex functions.
[EX A]: Agglomerative Bregman Clustering

[EX Q]: Neural networks have recently been proposed for multi-label classification because they are able to capture and model label dependencies in the output layer. In this work, we investigate limitations of BP-MLL, a neural network (NN) architecture that aims at minimizing pairwise ranking error. Instead, we propose to use a comparably simple NN approach with recently proposed learning techniques for large-scale multi-label text classification tasks. In particular, we show that BP-MLL’s ranking loss minimization can be efficiently and effectively replaced with the commonly used cross entropy error function, and demonstrate that several advances in neural network training that have been developed in the realm of deep learning can be effectively employed in this setting. Our experimental results show that simple NN models equipped with advanced techniques such as rectified linear units, dropout, and AdaGrad perform as well as or even outperform state-of-the-art approaches on six large-scale textual datasets with diverse characteristics.
[EX A]:
Large-scale Multi-label Text Classification — Revisiting Neural Networks