Log In Sign Up

MESA: Maximum Entropy by Simulated Annealing

by   Gerhard Paaß, et al.

Probabilistic reasoning systems combine different probabilistic rules and probabilistic facts to arrive at the desired probability values of consequences. In this paper we describe the MESA-algorithm (Maximum Entropy by Simulated Annealing) that derives a joint distribution of variables or propositions. It takes into account the reliability of probability values and can resolve conflicts between contradictory statements. The joint distribution is represented in terms of marginal distributions and therefore allows to process large inference networks and to determine desired probability values with high precision. The procedure derives a maximum entropy distribution subject to the given constraints. It can be applied to inference networks of arbitrary topology and may be extended into a number of directions.


page 1

page 2

page 3

page 4

page 5

page 6

page 7


Credal Networks under Maximum Entropy

We apply the principle of maximum entropy to select a unique joint proba...

Probabilistic Deduction: an Approach to Probabilistic Structured Argumentation

This paper introduces Probabilistic Deduction (PD) as an approach to pro...

Integrating Probabilistic Rules into Neural Networks: A Stochastic EM Learning Algorithm

The EM-algorithm is a general procedure to get maximum likelihood estima...

A Probabilistic Algorithm for Calculating Structure: Borrowing from Simulated Annealing

We have developed a general Bayesian algorithm for determining the coord...

Reconciling econometrics with continuous maximum-entropy models

In the study of economic networks, econometric approaches interpret the ...

The Optimal 'AND'

The joint distribution P(X,Y) cannot be determined from its marginals P(...

A simulated annealing procedure based on the ABC Shadow algorithm for statistical inference of point processes

Recently a new algorithm for sampling posteriors of unnormalised probabi...