Use the Gaussian likelihood Gibbs annealing target relative to , with . Completing the normal square and recognizing an inverse-gamma kernel give
The shape is , because the probability density function in is . The base measure matters: inserting a prior factor would change this shape.
Integrating out contributes a factor proportional to , so the marginal is . Thus the joint target is proper for . Choose a decreasing sequence tending to zero and a finite starting value . At iteration , sample from the first conditional using , then sample from the second using . This is an explicit annealing algorithm entirely using Gibbs sampling, with all its inverse-gamma moments finite for the convergence proof.
For minimization of an energy , simulated annealing at temperature targets the Boltzmann distribution relative to a specified parameter reference measure. With proposal distribution , accept with
At each temperature run the chain long enough to explore that law, then cool and retain the best state seen. For symmetric proposals every improvement is accepted, while a worsening move is accepted with probability . Equilibrium laws concentrate near global minima when their normalizing integrals are finite and the minima are suitably isolated. A particular rapid cooling schedule does not automatically inherit this guarantee.
Likelihood maximization uses energy , not . The source's later wording “ equal to the log-likelihood” conflicts with its preceding minimization convention. The intended maximum-likelihood Boltzmann distribution is proportional to . With the opposite sign, likelihood maxima would be disfavored; for binomial data with both successes and failures the density often would not even be integrable near the endpoints as decreases.
For the maximum-likelihood estimates, write , and . In the binomial distribution model with known positive integer , the log-likelihood is
Differentiating gives , hence . The second derivative is negative in the interior. If or , the maximum is at the corresponding endpoint. This model requires integer observations in ; otherwise its likelihood is zero.
For the normal distribution model write . Its log-likelihood is
For fixed , the unique maximizing mean is . Substituting it and differentiating in gives , so, assuming ,
If , the normal density likelihood grows without bound as with ; there is no finite interior maximum or ordinary finite AIC for that fit.
For Gaussian likelihood Gibbs annealing, use relative to . Completing the square and identifying an inverse-gamma distribution gives the Gibbs sampler conditionals
Integrating out contributes a factor proportional to , so the marginal is . The joint target is proper for when ; starting the Lebesgue-based annealing above this range would require a proper reference factor or bounded parameter domain. For sufficiently small , its moments satisfy
Thus equilibrium draws concentrate at as .
There is also a direct convergence proof for the actual successive Gibbs sampler updates here. Choose deterministic with , start at a finite deterministic , draw from the first conditional using , then draw from the second using . Conditional normal moments give and . The permitted inverse-gamma moments therefore yield
The coefficient on the preceding first moment is at most , and that on the preceding second moment is at most . The remaining coefficients are uniformly bounded, so both moment sequences are bounded by iteration. Since , the recursions then give and . Also . Hence
This proves convergence in mean square, and thus in probability, to the normal maximum-likelihood estimates for this explicit cooling/update scheme, rather than merely assuming equilibration.
For binomial likelihood-power annealing, normalizing on gives
Its mean is , and its variance is
The mean tends to and the variance tends to zero, proving concentration at the binomial maximum-likelihood estimate, including the endpoint cases. Independent exact draws from these beta laws are a simple annealing implementation within this model.
For model selection, the Akaike information criterion is with and . Thus
Use the endpoint convention . For a trans-dimensional annealing for penalized likelihood construction, target the disjoint model spaces with unnormalized densities
relative to and , respectively. The energies are half the unoptimized AIC, ; their joint minimizer is the fitted model with smaller AIC. Keep constants such as and the normal density normalization, which do not cancel across models. The within-model conditional draws are unchanged by these constant penalties.
Here is a complete dimension-changing proposal. Select a binomial-to-normal move with probability and a normal-to-binomial move with probability , both fixed; other steps can use the within-model updates. From , draw with density and set
This bijection from onto has inverse , . Its absolute Jacobian determinant is . The Binomial-normal reversible-jump annealing acceptance ratio is therefore
For a reverse proposal from , compute and deterministically and accept with
These ratios are reciprocal at inverse states and enforce detailed balance on the dimension-matched augmented spaces. They specify the proposal density, model-selection probabilities and Jacobian explicitly. The map is a valid example, not a claim of optimal mixing. Positive-temperature beta draws stay in the open interval even when the limiting estimate is an endpoint. At each temperature ensure adequate model switching; retain the best fitted penalized likelihood encountered. If minima tie, limiting concentration need not choose a unique model.
There is a material measurement qualification. A binomial probability mass and an unrounded normal density use different observation reference measures. Their raw AIC values are not an invariant, scientifically calibrated comparison of the same recorded data. The expressions and jump algorithm above implement the formal density comparison suggested by the question, with its units fixed. For integer-recorded measurements, a compatible normal model instead assigns probabilities , suitably adjusting boundaries or truncation if required. Then both models describe the same recorded outcomes relative to counting measure. Use those masses in the normal likelihood and the same reversible-jump formula; its simple normal MLE and conjugate Gibbs updates will generally no longer apply. This observation-model correction cannot be silently combined with the continuous-normal formulas.
For minimizing an energy , simulated annealing at temperature uses the Boltzmann distribution . At each temperature run a Metropolis–Hastings algorithm or Gibbs transition preserving that law, then reduce . With a symmetric proposal, accept with probability : downhill moves are accepted and uphill moves remain possible. Keep the best state encountered. As temperature decreases, equilibrium mass favors global minima, provided the target is proper and the relevant concentration hypotheses hold. An arbitrary finite cooling run does not by itself prove global convergence.
Let , and . For the Poisson distribution model the observations must be nonnegative integers. Its log-likelihood is
For , differentiation gives and . If , the likelihood is decreasing and the maximizer is the boundary value zero. For the normal distribution model write , giving
For each , this is maximized at , and differentiating there gives . Hence
The normal variance estimate has denominator , not . A finite positive normal maximum requires ; if all observations coincide, the likelihood is unbounded as . The normal annealing calculation below assumes .
To maximize likelihood, choose the energy , so the annealing law is , not . This sign is important in the Poisson request: literally inserting a positive log-likelihood into a minimizing Boltzmann law would give a nonnormalizable probability density function growing like at infinity. We use likelihood-power annealing with the maximizing sign.
For the normal distribution model, take base measure . The joint annealing probability density function is
Completing the square gives the Gibbs sampling conditional for . Matching the conditional probability density function to the supplied inverse-gamma distribution convention gives
Integrating out contributes a factor , so the marginal law is
Thus this joint Boltzmann law is proper for . Its variance marginal and the normal conditional both concentrate at the stated estimates as . For example, for its marginal mean and variance are
Also .
There is a direct convergence proof for the actual changing-temperature Gibbs algorithm, beyond convergence of its equilibrium probability densities. Start at a finite deterministic , choose deterministic with , draw conditional on , then draw conditional on using the two boxed distributions. Conditional normal moments give
The inverse-gamma distribution first and second moments consequently yield
and
In the first recursion the coefficient of the preceding mean is at most ; in the second the coefficient of the preceding second moment is at most . The means therefore stay bounded, and then so do the second moments. Letting in these formulas gives and . Together with , this proves
This Gaussian likelihood Gibbs annealing convergence uses the explicit conditional structure and does not assume that one Gibbs sampling sweep is an exact equilibrium draw.
For the Poisson distribution model, the likelihood-power law with respect to has the normalized probability density function
so
The mean tends to and the variance to zero, proving convergence to a point mass at the Poisson maximum-likelihood estimate, including the zero-boundary case.
The Akaike information criterion is , counting one parameter for Poisson and two for normal. With and , the two forms are
and
Choose the smaller criterion. Likelihood constants that differ between models, including the factorial and terms, cannot be discarded.
For a fully specified trans-dimensional annealing for penalized likelihood, let or and define
Use the combined target, relative to counting measure on models and Lebesgue measure on their parameters,
where are fixed reference weights. For and both model components are integrable. The factor is a convenient temperature convention keeping the within-model laws exactly those already derived. The extra factor makes the zero-temperature objective AIC rather than unpenalized likelihood.
Use, for example, probability for a model-change attempt in either model and probability for a within-model update. Within the Poisson distribution model draw a fresh gamma value from its boxed law; within the normal distribution model perform the boxed Gibbs sampling sweep. For a Poisson-to-normal proposal, draw with a fixed , and set
The inverse normal-to-Poisson proposal is with reverse auxiliary . This dimension matching uses one auxiliary variable to augment the one-dimensional Poisson parameter space. The absolute Jacobian determinant is
If the forward model-jump selection probability is and the reverse probability is , the reversible-jump Markov chain Monte Carlo acceptance ratio is
Accept with probability . For the reverse move compute and use
For the suggested equal selection probabilities, and those factors cancel. The probability density function must still be included, despite symmetry of its normal distribution: it is an auxiliary draw in only the forward dimension-increasing proposal. Pairing a move with its inverse makes the accepted forward and reverse probability flows equal after the change of variables, proving detailed balance for each fixed-temperature model-switch kernel.
Cool through proper temperatures, allow enough model and parameter exploration at each stage, and retain the smallest observed . The minima of the two energies are exactly the two AIC values above. Low-temperature equilibrium mass concentrates on the better criterion and its fitted parameters; if they tie, the minimizing set contains both models. Unlike the direct normal Gibbs argument, this multimodel exploration claim needs an appropriate cooling/mixing justification and is not guaranteed by an arbitrary short run.
Finally, an exact statistical comparison must put both likelihoods on the same observable and reference-measure convention. A Poisson distribution model is a probability mass function on counts, whereas the displayed normal distribution model is a continuous probability density function. The formulas above are the question's formal Gaussian working-likelihood comparison. A coherent exact normal approximation for count observations can instead use probabilities of rounding intervals; that changes its likelihood and generally loses the simple analytic normal estimates. This distinction matters when interpreting the numerical AIC difference, while leaving the dimension-matching and annealing construction applicable to properly specified likelihoods.