Last chapter's straight path only needed one Euler step because its velocity was constant — a convenient accident of using a perfectly straight line. Real diffusion trajectories curve. Can a model still jump straight to the endpoint from any point along a curved path, in one shot?
Drag anywhere. The second point never moves — every value of on this trajectory maps to the exact same endpoint, through one function call, no matter how far from you start.
A consistency model learns a function trained so that any two points on the same trajectory map to the same output — the endpoint. On this chapter's straight-line paths, that function has a closed form:
- — the consistency function: maps any point on a trajectory, at any time , straight to that trajectory's endpoint.
- — the point on the trajectory at time .
- — the trajectory's starting point (noise, at ).
- — the trajectory's endpoint (data, at ) that should output for every on this trajectory.
- — the time parameter identifying where along the trajectory the input point sits.
- Self-consistency holds for any t
The middle expression above holds for any — doesn't care how far along the trajectory it's asked to evaluate, it always outputs the endpoint.
- Curved trajectories have no closed form
Real consistency models are trained on the genuinely curved trajectories that diffusion models produce, where no such closed form exists.
- A distillation loss teaches the shortcut
A consistency-distillation loss explicitly penalizes disagreement between 's outputs at two nearby points on the same trajectory, teaching the shortcut a curved path doesn't hand you for free.
Five wildly different starting points along the same trajectory — five identical bars. That flatness is the trained property, not a coincidence of the numbers: a consistency model that got this wrong would show five different heights instead.
Trajectory , checked at two very different values of :
- t = 0.3
. .
- t = 0.8
. .
- Same trajectory, same answer
Two completely different inputs — and — produce the identical output. That's not a special property of or ; it holds for every on this trajectory, because both points sit on the same straight line to .
Find the candidate, among the three, whose consistency-function output is negative.
Sampling from a real consistency model costs one network evaluation instead of the dozens or hundreds a diffusion model's reverse process needs — the entire trajectory is collapsed into a single learned jump. The price is a genuinely harder training problem: teaching a network self-consistency along curved paths it doesn't get to see in closed form, unlike this chapter's straight lines. The next chapter leaves continuous generation behind entirely and asks what happens when a model's latent space isn't a smooth continuum at all, but a small, fixed vocabulary of learned codes.