Directed Reduction Algorithms and Decomposable Graphs
In recent years, there have been intense research efforts to develop efficient methods for probabilistic inference in probabilistic influence diagrams or belief networks. Many people have concluded that the best methods are those based on undirected graph structures, and that those methods are inherently superior to those based on node reduction operations on the influence diagram. We show here that these two approaches are essentially the same, since they are explicitly or implicity building and operating on the same underlying graphical structures. In this paper we examine those graphical structures and show how this insight can lead to an improved class of directed reduction methods.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Modelling and Kron reduction of power flow networks in directed graphs
Electrical grids are large-sized complex systems that require strong computing power for monitoring and analysis. Kron reduction is a general reduction method in graph theory and is often used for electrical circuit simp…
Quadratic Decomposable Submodular Function Minimization
We introduce a new convex optimization problem, termed quadratic decomposable submodular function minimization. The problem is closely related to decomposable submodular function minimization and arises in many learning …
Structural Dimension Reduction in Bayesian Networks
This work introduces a novel technique, named structural dimension reduction, to collapse a Bayesian network onto a minimum and localized one while ensuring that probabilistic inferences between the original and reduced …
Structure-Aware Encodings of Argumentation Properties for Clique-width
Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently o…
Distributed Online Private Learning of Convex Nondecomposable Objectives
We deal with a general distributed constrained online learning problem with privacy over time-varying networks, where a class of nondecomposable objectives are considered. Under this setting, each node only controls a pa…