Difference between revisions of "GeneralizedIterativeScaling"
Line 17: | Line 17: | ||
where <math>I</math> is an index set; the probability distribution over which has to be determined, <math>p</math> is a probability distribution and <math>\pi</math> is a subprobability function (adds to 1 but <math>\pi_i \neq 0</math> for any <math>i</math>); <math>b_{si} \neq 0</math> is constant. | where <math>I</math> is an index set; the probability distribution over which has to be determined, <math>p</math> is a probability distribution and <math>\pi</math> is a subprobability function (adds to 1 but <math>\pi_i \neq 0</math> for any <math>i</math>); <math>b_{si} \neq 0</math> is constant. | ||
− | Since <math>\log(\frac{p_i}{\pi_i}</math> is linear in <math>\mu</math> and </math>\mu_i</math>, <math>p</math> belongs to the log linear family. | + | Since <math>\log left(\frac{p_i}{\pi_i} \right)</math> is linear in <math>\mu</math> and </math>\mu_i</math>, <math>p</math> belongs to the log linear family. |
== Existence of a solution == | == Existence of a solution == |
Revision as of 10:39, 27 September 2011
This is one of the earliest methods used for inference in log-linear models. Though more sophisticated and faster methods have evolved, this method provides an insight in log linear models.
What problem does it address
The objective of this method is to find a probability function of the form
satisfying the constraints
where is an index set; the probability distribution over which has to be determined, is a probability distribution and is a subprobability function (adds to 1 but for any ); is constant.
Since Failed to parse (syntax error): {\displaystyle \log left(\frac{p_i}{\pi_i} \right)} is linear in and </math>\mu_i</math>, belongs to the log linear family.
Existence of a solution
If of form (1) exists satisfying (2), then it minimizes and is unique. Since are constant; it essentially boils down to the following statement.
Maximum entropy
If there exists a positive probability function of the form
satisfying (2), then it maximizes the entropy
This statement is equivalent to saying that if there are a set of features whose expected value is known, then the probability distribution (if there exists one) that maximizes the entropy (makes minimum assumptions) is of the form (1).
Algorithm
Given that constraints (2) is satisfied by atleast one sub-probability function (this condition is also known as consistency of constraints), then (1) and (2) can be expressed as
Define
Iterate
where