exponentiatedPosterior is the paper's "exponentiated posterior distribution". The paper names
neither the normalized P(h)^r nor anything else here; exponentiatedPrior is our name, by
analogy.
The condition that P(d|h) be "either constant or zero across all hypotheses" is
ConstantOrZero, stated without the constant: two languages that both give a datum positive
probability give it the same.
The exponent is positive: at r = 0 the extended-real 0 ^ 0 = 1 would give positive weight to
languages that cannot produce the datum.
The paper assumes the chain on languages is ergodic. Invariance does not need it; uniqueness of
the stationary distribution does.
The distribution of meanings P is a parameter, uniform in the paper's Fig. 3 and Zipfian in its
Fig. 4. Both figures are simulations and are not formalized; Fig. 3's α and ε are not
reported.
The paper's condition that P(d|h) be "either constant or zero across all hypotheses": two
languages that both give a datum positive probability give it the same.
{H : Type u_1}{D : Type u_2}[MeasurableSpaceH][MeasurableSpaceD](κ : ProbabilityTheory.KernelHD) :
p. 5244, "systematically overrepresented": the stationary distribution proportional to
P(h)^r raises the prior odds between any two languages to the power r.
Methods, eqs. (6)–(10): if every datum is either impossible or equally likely under each
language, iterated learning with the exponentiated posterior has a stationary distribution
proportional to P(h)^r. The learner is the posterior under that distribution, so the result is
Griffiths & Kalish 2007's at a different prior.
The r = ∞ endpoint: if every datum is either impossible or equally likely under each
language, iterated learning by MAP estimation has the uniform distribution on the modes of the
prior as a stationary distribution. Two priors with the same modes, one weak and one strong, give
the same one.
A language assigns each of n meanings one of k classes. A learner sees m pairs of a meaning,
drawn from P, and the class produced for it, which is the language's class with probability
1 - ε and each other class with probability ε / (k - 1).
Methods: the noisy meaning-class model meets the condition of invariant_exponentiatedPosterior
exactly when there is no noise, when every class is produced with probability 1/k, or when the
language's own class is never produced.
The meaning-class model without noise: for every bias strength α, iterated learning by MAP
estimation has the uniform distribution on the fully regular languages as a stationary
distribution. Sampling learners keep the prior instead, which depends on α
(invariant_exponentiatedPosterior_one).