Solving Ramified Optimal Transport Problem in the Bayesian Influence Diagram Framework (original) (raw)
Related papers
Stochastic Techniques in Influence Diagrams for Learning Bayesian Network Structure
Lecture Notes in Computer Science, 2012
The problem of learning Bayesian network structure is well known to be NP-hard. It is therefore very important to develop efficient approximation techniques. We introduce an algorithm that within the framework of influence diagrams translates the structure learning problem into the strategy optimisation problem, for which we apply the Chen's self-annealing stochastic optimisation algorithm. The effectiveness of our method has been tested on computer-generated examples.
2021
We research relations between optimal transport theory, OTT, and the innovative methodology of approximate Bayesian computation, ABC, possibly connected to relevant metrics defined on probability measures. Those of ABC are computational methods based on Bayesian statistics and applicable to a given generative model to estimate its a posteriori distribution in case the likelihood function is intractable. The idea is therefore to simulate sets of synthetic data from the model with respect to assigned parameters and, rather than comparing prospects of these data with the corresponding observed values as typically ABC requires, to employ just a distance between a chosen distribution associated to the synthetic data and another of the observed values. Such methods have become increasingly popular especially thanks to the various fields of applicability which go from finance to biological science, and yet an ABC methodology relying on OTT as the one we’re trying to develop was born specif...
An optimization-based approach for the design of Bayesian networks
Mathematical and Computer Modelling, 2008
Bayesian networks model conditional dependencies among the domain variables, and provide a way to deduce their interrelationships as well as a method for the classification of new instances. One of the most challenging problems in using Bayesian networks, in the absence of a domain expert who can dictate the model, is inducing the structure of the network from a large, multivariate data set. We propose a new methodology for the design of the structure of a Bayesian network based on concepts of graph theory and nonlinear integer optimization techniques.
Solving Influence Diagrams with Simple Propagation
Advances in Artificial Intelligence, 2019
Recently, Simple Propagation was introduced as an algorithm for belief update in Bayesian networks using message passing in a junction tree. The algorithm differs from other message passing algorithms such as Lazy Propagation in the message construction process. The message construction process in Simple Propagation identifies relevant potentials and variables to eliminate using the one-in, one-out-principle. This paper introduces Simple Propagation as a solution algorithm for influence diagrams with discrete variables. The one-in, one-out-principle is not directly applicable to influence diagrams. Hence, the principle is extended to cope with decision variables, utility functions, and precedence constraints to solve influence diagrams. Simple Propagation is demonstrated on an extensive example and a number of useful and interesting properties of the algorithm are described.
C.: A junction tree propagation algorithm for bayesian networks with second-order uncertainties
2006
Bayesian networks (BNs) have been widely used as a model for knowledge representation and probabilistic inferences. However, the single probability representation of conditional dependencies has been proven to be overconstrained in realistic applications. Many efforts have proposed to represent the dependencies using probability intervals instead of single probabilities. In this paper, we move one step further and adopt a probability distribution schema. This results in a higher order representation of uncertainties in a BN. We formulate probabilistic inferences in this context and then propose a mean/covariance propagation algorithm based on the well-known junction tree propagation for standard BNs [1]. For algorithm validation, we develop a two-layered Markov likelihood weighting approach that handles high-order uncertainties and provides “ground-truth ” solutions to inferences, albeit very slowly. Our experiments show that the mean/covariance propagation algorithm can efficiently...
A Junction Tree Propagation Algorithm for Bayesian Networks with Second-Order Uncertainties
2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), 2006
Bayesian networks (BNs) have been widely used as a model for knowledge representation and probabilistic inferences. However, the single probability representation of conditional dependencies has been proven to be overconstrained in realistic applications. Many efforts have proposed to represent the dependencies using probability intervals instead of single probabilities. In this paper, we move one step further and adopt a probability distribution schema. This results in a higher order representation of uncertainties in a BN. We formulate probabilistic inferences in this context and then propose a mean/covariance propagation algorithm based on the well-known junction tree propagation for standard BNs [1]. For algorithm validation, we develop a two-layered Markov likelihood weighting approach that handles high-order uncertainties and provides "ground-truth" solutions to inferences, albeit very slowly. Our experiments show that the mean/covariance propagation algorithm can efficiently produce high-quality solutions that compare favorably to results obtained through painstaking sampling.
Integrating Bayesian networks and decision trees in a sequential rule-based transportation model
European Journal of Operational Research, 2006
Several activity-based transportation models are now becoming operational and are entering the stage of application for the modelling of travel demand. Some of these models use decision rules to support its decision making instead of principles of utility maximization. Decision rules can be derived from different modelling approaches. In a previous study, it was shown that Bayesian networks outperform decision trees and that they are better suited to capture the complexity of the underlying decision-making. However, one of the disadvantages is that Bayesian networks are somewhat limited in terms of interpretation and efficiency when rules are derived from the network, while rules derived from decision trees in general have a simple and direct interpretation. Therefore, in this study, the idea of combining decision trees and Bayesian networks was explored in order to maintain the potential advantages of both techniques. The paper reports the findings of a methodological study that was conducted in the context of Albatross, which is a sequential rule based model of activity scheduling behaviour. The results of this study suggest that integrated Bayesian networks and decision trees can be used for modelling the different choice facets of Albatross with better predictive power than CHAID decision trees. Another conclusion is that there are initial indications that the new way of integrating decision trees and Bayesian networks has produced a decision tree that is structurally more stable.
A Depth-First Search Algorithm for Optimal Triangulation of Bayesian Network
2012
Finding the triangulation of a Bayesian network with minimum total table size reduces the computational cost for probabilistic reasoning in the Bayesian network. This task can be done by conducting a search in the space of all possible elimination orders of the Bayesian network. However, such a search is known to be NP-hard. To relax this problem, Ottosen and Vomlel (2010b) proposed a depth-first branch and bound algorithm, which reduces the computational complexity from Θ(β ·| V|!) to O(β ·| V|!), where β describes the overhead computation per node in the search space, and where |V|! is the search space size. Nevertheless, this algorithm entails a heavy computational cost. To mitigate this problem, this paper presents a proposal of an extended algorithm with the following features: (1) Reduction of the search space to O ((|V|-1)!) using Dirac’s theorem, and (2) reduction of the computational cost β per node. Some simulation experiments show that the proposed method is consistently ...
Optimal Paths in Probabilistic Networks
Journal of Mathematical Sciences, 2004
The random graph theory was initially proposed by P. Erdős and A. Rényi in the 1950s-1960s. More recently, B. Bollobás presented the first systematic and extensive treatment of results in the theory of random graphs. Associating to each edge of a random graph a real random variable, we obtain a probabilistic network. The determination of an optimal path between two nodes in a probabilistic network was first studied by H. Frank in 1969. Since then few theoretical results have become known, even though there is a recognizable applicability of this type of network to real problems, namely, to social and telecommunication networks. The mathematical model proposed in this paper maximizes the expected value of a utility function over a directed random network, where the costs related to the arcs are real random variables following Gaussian distributions. We consider the linear, quadratic, and exponential cases, presenting a theoretical formulation based on multi-criteria models as well as the resulting algorithms and computational tests.
Fully Probabilistic Design for Optimal Transport
arXiv (Cornell University), 2022
The goal of this paper is to introduce a new theoretical framework for Optimal Transport (OT), using the terminology and techniques of Fully Probabilistic Design (FPD). Optimal Transport is the canonical method for comparing probability measures and has been successfully applied in a wide range of areas (computer vision Rubner et al. [2004], computer graphics Solomon et al. [2015], natural language processing Kusner et al. [2015], etc.). However, we argue that the current OT framework suffers from two shortcomings: first, it is hard to induce generic constraints and probabilistic knowledge in the OT problem; second, the current formalism does not address the question of uncertainty in the marginals, lacking therefore the mechanisms to design robust solutions. By viewing the OT problem as the optimal design of a probability density function with marginal constraints, we prove that OT is an instance of the more generic FPD framework. In this new setting, we can furnish the OT framework with the necessary mechanisms for processing probabilistic constraints and deriving uncertainty quantifiers, hence establishing a new extended framework, called FPD-OT. Our main contribution in this paper is to establish the connection between OT and FPD, providing new theoretical insights for both. This will lay the foundations for the application of FPD-OT in a subsequent work, notably in processing more sophisticated knowledge constraints, as well as in designing robust solutions in the case of uncertain marginals.