summary:Efficient computational algorithms are what made graphical Markov models so popular and successful. Similar algorithms can also be developed for computation with compositional models, which form an alternative to graphical Markov models. In this paper we present a theoretical basis as well as a scheme of an algorithm enabling computation of marginals for multidimensional distributions represented in the form of compositional models
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Finite probability distributions and compositional data are mathematically similar, consisting of D-...
We propose to exploit three-valued abstraction to stochastic systems in a compositional way. This co...
summary:Efficient computational algorithms are what made graphical Markov models so popular and succ...
This paper deals with the problem of marginalization of multidimensional probability distributions r...
Because of computational problems, multidimensional probability distributions must be approximated ...
In the framework of models generated by compositional expressions, we solve two topical marginalizat...
The thesis considers a representation of a discrete multidimensional probability distribution using ...
summary:Compositional models are used to construct probability distributions from lower-order probab...
Diaconis-Sturmfels developed an algorithm for sampling from conditional distributions for a statisti...
A joint distribution of two discrete random variables with finite support can be displayed as a two ...
We present a new family of models that is based on graphs that may have undirected, directed and bid...
The Diaconis-Sturmfels algorithm is a method for sampling from conditional distributions, based on t...
In this thesis, we give a new class of outer bounds on the marginal polytope, and propose a cutting-...
The Diaconis-Sturmfels algorithm is a method for sampling from conditional distributions, based on t...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Finite probability distributions and compositional data are mathematically similar, consisting of D-...
We propose to exploit three-valued abstraction to stochastic systems in a compositional way. This co...
summary:Efficient computational algorithms are what made graphical Markov models so popular and succ...
This paper deals with the problem of marginalization of multidimensional probability distributions r...
Because of computational problems, multidimensional probability distributions must be approximated ...
In the framework of models generated by compositional expressions, we solve two topical marginalizat...
The thesis considers a representation of a discrete multidimensional probability distribution using ...
summary:Compositional models are used to construct probability distributions from lower-order probab...
Diaconis-Sturmfels developed an algorithm for sampling from conditional distributions for a statisti...
A joint distribution of two discrete random variables with finite support can be displayed as a two ...
We present a new family of models that is based on graphs that may have undirected, directed and bid...
The Diaconis-Sturmfels algorithm is a method for sampling from conditional distributions, based on t...
In this thesis, we give a new class of outer bounds on the marginal polytope, and propose a cutting-...
The Diaconis-Sturmfels algorithm is a method for sampling from conditional distributions, based on t...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Finite probability distributions and compositional data are mathematically similar, consisting of D-...
We propose to exploit three-valued abstraction to stochastic systems in a compositional way. This co...