Tempered transitions
Algorithms AIMech:TemperedTransitions DRAFT
Aliases: Neal tempered transitions
A Markov chain Monte Carlo transition algorithm that proposes a new target state through a prescribed outward and return sequence of mutually reversed kernels for auxiliary distributions, then accepts or rejects the endpoint using density ratios evaluated along the complete path.
Identity Notes & Concept Scope
Compared tempered transitions against all442 pinned AIO and700 native identities; no normalized match. Ignored- and hidden-inclusive searches of three full checkouts returned312,116,115 lines in24 unique content groups, all classified as the pending cohort or newly written AIS record/report, primary-source notes and queries. The23 new groups were read in full; the shared cohort line was retained from the earlier assessment. Semantic assessment covered103 AIO and307 native definitions: all103 and306 preceding rows verified unchanged, plus the new AIS row and maintained record read and its three corrections reassessed. Ten complete AIO contexts and five full native neighbors assessed. This identity is the full up/down Metropolis transition on one target state. It differs from weighted one-way AIS estimates, replica exchanges in parallel tempering, a temperature-index random walk in simulated tempering, annealing optimization, and tempered Hamiltonian trajectory modifications.
Claims & Grounded Evidence
6 Claims
Mechanism
#auxiliary-kernel-pairs
In the maintained regular case, choose a target p_0 and proper positive auxiliary densities p_1,...,p_n on a common state space, with n>=1. For every i, supply kernels U_i and D_i satisfying p_i(x)U_i(x,y)=p_i(y)D_i(y,x). They are mutual reversals under p_i and both preserve that distribution. If the same kernel is used in both directions, it must satisfy detailed balance. A composition of individually reversible updates can be paired with those updates in reverse order; invariance alone does not justify using an arbitrary nonreversible scan identically in both directions.
Mechanism
#path-and-acceptance
From u_0=x, apply U_1,...,U_n to produce u_1,...,u_n. Set v_n=u_n and apply D_n,...,D_1 to produce v_(n−1),...,v_0. Accept candidate v_0 with probability min(1, product over i=1,...,n of [p_i(u_(i−1))/p_(i−1)(u_(i−1))]*[p_(i−1)(v_(i−1))/p_i(v_(i−1))]); on rejection retain x. Each intermediate density occurs equally in numerator and denominator, so arbitrary positive normalizing factors cancel. There are 2n base-kernel applications, including both U_n and D_n at the outermost distribution.
Limitation
#invariance-and-exploration
Detailed balance follows by pairing each accepted complete path with its reversed path. The resulting kernel preserves p_0, but this alone does not ensure irreducibility, rapid mixing, independent samples or an exact p_0 draw from arbitrary initialization. High acceptance need not mean exploration: a three-state outward deterministic cycle followed by its reverse can return to the starting state with acceptance one on every attempt. Auxiliary distributions need not equilibrate at each visit for path balance, but inadequate movement and overlap can still make sampling ineffective.
Scope
#finite-path-balance-checks
A curator enumeration uses three states, unnormalized target (1,2,7), intermediate weights (1,2,3), outer weights (1,1,1), and exact refresh kernels. Summing all outward/return paths with the full acceptance rule gives a transition satisfying detailed balance. Independently scaling the three density vectors by 7,11 and13 leaves that transition unchanged. In this example, an endpoint-only acceptance surrogate sends the target to (1/20,11/60,23/30), which is incorrect. A separate example using the same invariant nonreversible cycle both ways sends target (1/10,1/5,7/10) to (1/10,3/10,3/5), also incorrect. Seventy-two additional finite kernel cases satisfy detailed balance when paired with their proper reversals. These checks establish finite examples and failures, not a universal mixing or implementation guarantee.
Scope
#temperature-and-method-boundaries
Canonical distributions proportional to exp(−beta_i*E) are one auxiliary-family choice; a numerical temperature ladder is not essential to the general construction, and proper auxiliary distributions still must exist. Tempered transitions moves outward and back systematically, whereas simulated tempering includes a temperature index in its state and parallel tempering exchanges configurations across replicas. The source’s Gaussian spacing/dimension comparisons assume strong equilibration conditions, and its synthetic multimodal example does not establish universal superiority. Tempered Hamiltonian trajectories and overrelaxed variants are separate extensions rather than required steps.
Scope
#later-normalizer-extension
The 1994 comparison table’s lack of a tempered-transition normalizer estimate is not a timeless limitation. The later AIS report derives backward path weights whose mean estimates Z_n/Z_0 when target-chain sampling meets the required stationarity or convergence conditions. That estimator uses both accepted and rejected transitions; a reverse-chain combination and intermediate normalizer estimates are also discussed. This is an additional estimator, not the acceptance rule, and its uncertainty must account for chain autocorrelation and potentially severe weight variance.
⚠️ Curated Limitations & Negative Results
- The maintained regular case uses positive proper densities on a common state space. More general zero-support or constrained-state extensions need explicit measure/support handling.
- The complete path, kernel pairing and rejected state retention are essential. A heuristic outward/return annealing schedule without this correction is not automatically target preserving.
- The original 1994 report was read through OCR because its text encoding is garbled; core equations and figures/table were checked visually. Other displays remain OCR-only, and revised 1996 journal bytes were not inspected.
- The AIS source is a separately inspected 1998 report. Its later normalizer estimator is kept distinct from the original transition identity.
- No author software, floating-point reversibility audit, model training or benchmark replication was performed. DRAFT remains.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:MarkovChain
Markov Chain
|
related_match | Tempered transitions constructs a Markov kernel preserving a specified target distribution by an up/down path and acceptance test. This procedure is related to the AIO process/model; it is not asserted to be equivalent to that class or to inherit its Network parent or hidden-layer relation. |
Evidence Sources & Primary Literature
2 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
neal1994tempered
|
Radford M. Neal
|
author technical report
full_text
|
ID: University of Toronto Statistics Technical Report 9421
sha256:b91a045d73dd…
|
neal1998ais
|
Radford M. Neal
|
primary paper
full_text
|
ID: arxiv:physics/9803008v2
sha256:6ae14b83d623…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-14T19:47:07Z
Updated: 2026-10-14T19:47:07Z
Source File:
data/curated/TemperedTransitions.yaml