Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Hamiltonian Monte Carlo

Definition

Assume AC. Let d≥1, let U:Rd→R be continuously differentiable, and suppose ZU:=∫Rde−U(q) dq∈(0,∞). The position target is the Borel probability with density π(q)=ZU−1e−U(q). Let M be a real symmetric positive-definite d×d mass matrix. Define the kinetic energy and Hamiltonian by K(p)=12pTM−1p,H(q,p)=U(q)+K(p). At each iteration, refresh the momentum independently from p∼Nd(0,M), the multivariate normal law of mean zero and covariance M (Multivariate normal law, including singular covariance). The corresponding Hamilton equations are q˙=M−1p,p˙=−∇U(q), where ∇U is the Euclidean gradient of the objective under the convention of The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case and the BCS-20 gradient-descent input contract Gradient descent.

For finite leapfrog integration, choose ϵ>0 and an integer L≥1, use the map from One-step leapfrog map as force and drift shears for L steps, and flip the final momentum. If z=(q,p), write (q~,p~)=ΦϵL(z) and define the flipped proposal z∗=(q~,−p~). The Metropolis acceptance probability is α(z,z∗)=min⁡{1,exp⁡(−H(z∗)+H(z))}. The general accepted-flow and rejected-self-transition convention is the Metropolis-Hastings procedure Metropolis–Hastings kernel.

Remarks

The finite leapfrog procedure is defined by finitely many evaluations of ∇U and does not require the Hamilton ODE to be complete. An exact-flow version requires U∈C2 and a complete Hamiltonian vector field; under AC, which supplies Countable Choice by AC supplies countable selections and prescribed serial paths, A complete Hamiltonian flow for a C2 potential preserves energy and phase volume proves its energy and volume properties.

Neal's high-dimensional scaling analysis uses a replicated independent-coordinate target of the form U(q)=∑iui(qi) (with the coordinate contributions independently replicated). This definition makes no scaling claim outside that regime.

Depends on

Used by

Dependency tree · two levels

52 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources