Akshat Valse

Stochastic foundations of machine learning · Iowa State University

note
Posted
July 30, 2026

← All notes

Effective diffusivity in a periodic potential

How fast does a Langevin sampler actually explore a rough landscape? In one periodic dimension the answer is exact, 1/I₀(β)², which makes it a benchmark a sampler either reproduces or fails.

Effective diffusivity is the rate at which a diffusion actually covers ground in a landscape with barriers, as opposed to the rate it would cover ground with the barriers removed. It is the quantity that governs how quickly stochastic gradient Langevin dynamics explores a loss surface, how quickly an annealed sampler traverses a multimodal target at a given noise level, and how much of a sampler’s nominal step size survives the roughness of what it is stepping through. In general it is not computable.

In one periodic dimension it is, and the exception earns a page, because it is one of the few places where a sampler can be audited against an identity instead of against a longer run of itself.

Setting and assumptions

Let be -periodic and let . Consider the overdamped Langevin diffusion

with deterministic or with any law having finite second moment. Write and let be the projected process, a diffusion on the torus with generator

Because is compact and is uniformly elliptic with smooth coefficients, has a unique invariant probability measure, and it is the Gibbs measure

The quantity of interest is the effective diffusivity

Note that itself is not projected: displacement accumulates, and that is what diffuses.

The corrector

The drift has mean zero under :

by periodicity. This is exactly the solvability condition for the cell problem, so by the Fredholm alternative for on there is a , unique up to an additive constant, with

Apply Itô’s formula to and use :

Substituting back into gives the martingale decomposition

The first term is bounded uniformly in , because is continuous on a compact space; it contributes nothing at order . The second is a martingale whose quadratic variation is , and the ergodic theorem for gives times that converging a.s. to . Hence

Two things follow before is even solved for. The formula is a variance, so automatically, and the same decomposition gives a central limit theorem, , which says more than a statement about second moments would.

Solving the cell problem

In one dimension the cell problem integrates. Write as

and multiply through by . Using , the left-hand side collapses to and the right-hand side to , so

for a constant . The constant is fixed by requiring to be periodic, i.e. :

writing . Substituting into the variance formula, with ,

which is the Lifson–Jackson formula. By Jensen’s inequality , with equality only for constant : a periodic potential can only slow diffusion down, never speed it up. That is not obvious a priori, since the drift does not always oppose the motion, and it makes a useful sanity check on any implementation.

The cosine potential

Take , so . Then

the modified Bessel function of the first kind; the two signs agree because maps one integrand to the other. With ,

At , from the series ,

so a cosine barrier of height at unit temperature costs about of the free diffusivity.

The cold limit is Arrhenius, as it must be. From as ,

where is exactly the barrier height of between its minimum and maximum. The formula reproduces Kramers’ law without being told about it.

Checking a simulation against it

This is the payoff. Discretize with Euler–Maruyama at step , run independent replicas with drawn from the periodized Gibbs measure, and form the mean-squared-displacement estimator

Using the displacement rather than matters at small : the variance estimator carries an offset from the spread of and diverges as , while the displacement estimator starts at , which is the correct short-time answer.

With , , , and standard errors from four disjoint replica groups:

s.e.rel. dev.
10.872620.02012
100.645240.02829
1000.607470.01687
10000.611760.01861
20000.621810.00984

The convergence is slow, and it is slow for a structural reason rather than a statistical one: the systematic part of decays on the barrier-crossing timescale, not like . At that timescale is short enough to reach in a browser tab. It would not be at , and any plot that looked this clean at would be evidence of a bug.

The figure on the research page runs this estimator live against the dashed reference .

Why the exact value earns its keep

Two uses, both about sampling rather than about physics.

First, as a test. Any implementation of a Langevin sampler, including the inner loop of an annealed or score-based one, can be pointed at and required to return . It is a stronger test than checking a marginal, because it depends on the sampler’s behavior over long trajectories instead of at stationarity, and it is where an integrator with a subtly wrong noise scaling shows up. A sampler that gets the invariant measure right and the diffusivity wrong has a bug in its time discretization.

Second, as a scale. The Arrhenius form D_{\mathrm{eff}} \sim 2\pi e^{-eta\Delta V} says the cost of roughness is exponential in the barrier and only linear in anything one might tune. That is the same arithmetic that makes tempering, annealing, and noise schedules necessary rather than optional: no step size buys back an exponential. The companion note on the Metropolis correction makes the same point from the other direction.

The sampler this note tests is in langevin-samplers.

References

  • S. Lifson and J. L. Jackson (1962). On the self-diffusion of ions in a polyelectrolyte solution. Journal of Chemical Physics 36(9), 2410–2414.
  • G. A. Pavliotis and A. M. Stuart (2008). Multiscale Methods: Averaging and Homogenization. Springer. Chapters 12–13 give the corrector argument in general dimension.
  • R. Zwanzig (1988). Diffusion in a rough potential. PNAS 85(7), 2029–2030.