EpistemicPhysics
Survey · Statistics

The hidden springs of a belief

Find Gaussian springs inside a Beta belief, then listen with complex rotating arrows.

· 17 min read · 2 interactive demos

Imagine opening a weather sensor and finding a spring inside. Open the spring, and you find a cloud of smaller springs. Turn on the radio, and the cloud starts drawing circles.

That is approximately our itinerary. A Beta belief about a probability can become a hyperbolic landscape, a collection of hidden Gaussian wells, and a complex pattern of rotating arrows. These are exact changes of mathematical viewpoint. Epistemic Physics invites us to ask what we could build by moving between them.

Our sensor answers one question: will a seed germinate? The unknown success probability is p. Supporting and opposing trials have produced a Beta distribution,

p∼Beta⁡(α,β),α=Y+12,β=N+12.

Here Y counts germinations, N counts failures, and the starting halves give a total prior amount of one. We could use other positive shapes; this starting point makes the before-and-after experiments particularly clear.

Keep the whole uncertain p with us. We are about to change the coordinate of every possible probability, rather than replace the distribution with one summary number.

Stretch probability into a landscape

Probability lives between zero and one. Rapidity stretches that interval onto the whole real line:

r=12log⁡p1−p,p=1+tanh⁡r2.

The logarithm is natural, and tanh is the hyperbolic tangent. A probability of one half becomes r=0. Probabilities approaching one travel arbitrarily far right; probabilities approaching zero travel arbitrarily far left.

Define the shape amount A=α+β and polarity P=α−β. The density in this new coordinate is

fr(r)=21−AB(α,β)exp⁡(Pr)cosh−A⁡r.

The Beta function B supplies normalization. The hyperbolic cosine is cosh⁡r=(er+e−r)/2. To obtain this density, multiply the Beta density by the change-of-coordinate factor dp/dr=2p(1−p). That extra factor is why the exponent contains A, including the prior amount.

A useful landscape is the potential, the negative logarithm of density with an irrelevant constant removed:

V(r)=Alog⁡cosh⁡r−Pr.

Low ground has high density. Its minimum occurs at

r∗=12log⁡αβ.

This is the mode of the density in rapidity. Mapping it back gives the Beta mean α/A. Density modes depend on the coordinate used to measure density; the mean of random rapidity is another quantity again.

Near the minimum, the landscape looks like a spring’s bowl. Far away, it behaves differently. Its slope and curvature are

V′(r)=Atanh⁡r−P,V″(r)=Asech2⁡r,

where sech⁡r=1/cosh⁡r. Curvature measures how quickly the slope changes. An ordinary quadratic spring grows progressively steeper. Here the rightward slope approaches 2β, while the leftward slope approaches −2α.

Choose to read −V′ as a restoring force, and we have a force that saturates. Close to the favored state, the belief responds elastically; far away, the force approaches a fixed magnitude. The two tails separately remember the opposing and supporting shape amounts.

Open the trapdoor beneath the bowl

The Pólya-Gamma identity introduces a positive hidden variable ω:

cosh−A⁡r=Eω∼PG⁡(A,0)[e−2ωr2].

The symbol E means an average, and PG names the Pólya-Gamma distribution. The identity converts the hyperbolic factor into an average of quadratic exponential factors. It underlies the Bayesian logistic inference method of Polson, Scott, and Windle.

Now include the tilt Pr and complete the square:

Pr−2ωr2=−2ω(r−P4ω)2+P28ω.

Hold ω fixed and the rapidity distribution becomes Gaussian, the familiar bell curve:

r∣ω∼N(P4ω,14ω).

The vertical bar means “given.” The two arguments of N are its mean and variance. The spring’s precision, the reciprocal of variance, is 4ω. Increasing it narrows the bell and pulls its center toward zero when P stays fixed.

There is a lovely bookkeeping detail inside that completed square. The normalized Gaussian contributes a factor π/(2ω)exp⁡(P2/(8ω)) when integrated over r. Consequently, the hidden variable’s marginal weight in this joint construction is

q(ω)∝PG⁡(ω;A,0)×π2ωexp⁡(P28ω).

Here PG⁡(ω;A,0) denotes a density evaluated at ω. These are the weights for mixing normalized Gaussian bells. The simpler raw Pólya-Gamma weights average the unnormalized exponential factors in the identity above.

The other conditional distribution is especially convenient:

ω∣r∼PG⁡(A,2r).

An alternating calculation can therefore refresh the hidden spring given rapidity, then refresh rapidity given the spring. A complicated marginal curve becomes two manageable conditional steps.

Predict before touching: move far into a tail. Will the full landscape’s curvature equal the average precision of the hidden springs found there? Pin that mean spring and compare the two wells.

Open the hyperbolic well

Fit a spring to the bend

The sky well gets softer away from its middle. Choose a gold spring that follows its local bend at the rose probe. Then compare that fitted spring with the hidden conditional spring.

Pick a spring from the rack. Gold will touch the same point with the same slope; its precision controls the bend.

potential height0612-303rapidity r
Full Beta rapidity potentialLocal trial springMovable rapidity probe
Inspect curvatures, free controls, and the hidden recipe

α = 2.5, β = 2.5, including one Jeffreys half-count per channel.

Probe rapidity r
1.50
Sky curvature at r
0.904
Mean precision given r
3.017
Gold Gaussian center
0.000

At r = 1.50, the full well has curvature 0.904. The hidden spring has mean precision 3.017 when conditioned on that r. Changing a hidden variable and bending the complete curve are different operations.

Watch the infinite spring recipe converge

Multiplying the first N Gamma factors gives an upper bound for the hyperbolic factor. A bound on the remaining factors gives the lower end.

Lower bound
1.3747e-2
Exact hyperbolic factor
1.3881e-2
Upper bound
1.6003e-2
V(r)=Alog⁡cosh⁡r−Pr,r∣ω∼N(P4ω,14ω)

Open the hidden-spring experiment in the playground.

Why hiding the springs makes the landscape softer

The average hidden precision at a specified rapidity is

4E[ω∣r]=Atanh⁡rr,

with value A at r=0. Compare it with the full curvature Asech2⁡r. Both agree at the origin; they separate as we move away.

We can explain the difference exactly. Differentiate the conditional mean while remembering that the spring weights themselves change with r:

ddrE[ω∣r]=−4rVar⁡(ω∣r),V″(r)=4E[ω∣r]−16r2Var⁡(ω∣r).

The variance measures the spread of possible hidden stiffnesses. Its contribution subtracts from the average precision.

Picture testing a mattress while its internal springs can rearrange. Holding the arrangement fixed measures one stiffness. Allowing the arrangement to respond makes the mattress softer. Here that rearrangement is a change in which hidden values receive weight when we condition on a different rapidity.

For A=7 and r=2, the mean hidden precision is about 3.374, while the marginal curvature is about 0.495. Their difference records substantial freedom beneath the surface.

This suggests an EP interpretation worth pursuing: a belief’s malleability may partly reflect unresolved internal arrangements. Even when each conditional mechanism is simple, averaging over possible mechanisms can produce a flexible macroscopic response.

Give neighboring beliefs connecting springs

Suppose two gardens have related growing conditions. Each has a rapidity r1 or r2 describing uncertain germination probability. Choose a coupling that favors similar rapidities:

Vpair=V1(r1)+V2(r2)+λ2(r1−r2)2.

The coupling strength λ≥0 controls how strongly the gardens inform one another. This is a chosen statistical model of their relationship. Separate trial lineages still record which observations belong to each garden.

After introducing one hidden spring per garden, the equations for the conditional mean become

(4ω1+λ)r1−λr2=P1,−λr1+(4ω2+λ)r2=P2.

Two coupled linear equations! The full conditional distribution is a two-dimensional Gaussian. The diagonal terms resist motion; the off-diagonal terms transmit it between gardens.

Now imagine a continent of sensors, a tissue of cells, or a scientific community whose local models exchange information. Local Beta-shaped landscapes could become a network of fluctuating quadratic constraints. The computational engine would repeatedly solve Gaussian problems while allowing the hidden stiffnesses to change.

A particularly inviting experiment would compare fixed coupling with learned coupling: let two regions share information until their outcomes suggest different environments. The network could discover where a common explanation remains useful and where it should split.

Listen with an imaginary antenna

We have inspected uncertainty by opening a hidden coordinate. Another approach leaves the distribution intact and asks how it responds to a rotating probe.

Attach to each possible rapidity a unit arrow,

eikr=cos⁡(kr)+isin⁡(kr).

The real number k is a frequency measured in radians per unit rapidity. The imaginary unit i, with i2=−1, labels the perpendicular direction of the drawing plane. Averaging the arrows gives the characteristic function,

ϕ(k)=E[eikr].

Its real part is the average cosine, its imaginary part the average sine. At k=0, every arrow points right, so ϕ(0)=1. Increasing the frequency makes nearby possibilities point in increasingly different directions. Cancellation shortens their average.

The entire function ϕ, across all frequencies, determines the distribution. One chosen frequency acts like a particular listening channel.

For a Beta belief, substitute r=12log⁡[p/(1−p)]:

eikr=pik/2(1−p)−ik/2,ϕ(k)=B(α+ik/2,β−ik/2)B(α,β).

The imaginary shifts follow directly from Euler’s Beta integral. The complex expression is the average of a probe over our ordinary positive distribution. Its two components encode how the arrows reinforce or cancel.

For the starting shapes α=β=1/2, something beautiful happens. The density and its frequency response have matching forms:

fr(r)=sech⁡rπ,ϕ(k)=sech(πk2).

The hyperbolic secant reappears after the Fourier transformation, with a different scale. The same curve speaks in two coordinate languages.

Predict before touching: balanced trials should gather rapidities closer to zero. At a fixed frequency, do the arrows cancel more or less? Then add mostly supporting trials. Finally, translate the entire distribution without changing its shape.

An ordinary probability, a complex probe

Listen to a belief with rotating arrows

Turn without shrinking. Translate the cloud until the teal arrow reaches the gold target. Keep its length.

Free exploration: trials, examples, and frequency

0 yes, 0 no; α = 0.5, β = 0.5. Trials update the underlying Beta belief. Translation d = 0.00 is then applied to its rapidity, moving the whole distribution without changing its shape.

Probe frequency k 1.00

-404

The density and its probes

arrows: angle krdensity0.00.2-606rapidity r

The average arrow

length ≤ 1ImReφ(k) = average of eⁱᵏʳ

Distance to target: 0.382. The gold ring is the target; teal is your average.

Rapidity densityUnit probesComplex averageAdjustable frequency
Translation controls, numbers, and the Fourier rule
Real part, average cosine
0.3985
Imaginary part, average sine
0.0000
Arrow length |φ(k)|
0.3985
Phase angle
0.0°

Opposite rapidities carry equal weight. Their sine parts cancel, leaving a real average. Translating the whole curve rotates its average through kd, while preserving the arrow length.

ϕ(k)=E[eikr],ϕr+d(k)=eikdϕr(k)

Open the rotating-arrow experiment in the playground.

At k=1, the starting distribution has arrow length about 0.399. After five yes and five no trials, it is about 0.951. After eight yes and two no trials, the complex average is approximately 0.718+0.585i. Learning has changed both the distribution’s spread and its directional position in rapidity.

A change of calibration rotates the answer

The translation experiment has an unexpectedly concrete interpretation. Independent positive Gamma amounts can generate a Beta share. A Gamma distribution has a positive shape and rate; at fixed shape, increasing the rate reduces the typical amount.

Let U+ and U− have shapes α,β and unit rates. Using positive rates λ+ and λ−, define differently calibrated amounts:

G+=U+λ+,G−=U−λ−.

The rapidity of their share G+/(G++G−) is

r=12log⁡G+G−=12log⁡U+U−+12log⁡λ−λ+⏟d.

Unequal Gamma rates become a simple rapidity translation d. Their normalized share generally leaves the ordinary Beta family, while its rapidity density keeps exactly the same shape, shifted sideways.

Every arrow gains the same extra angle kd:

ϕr+d(k)=eikdϕr(k).

The average rotates without changing length. A calibration shift and a change in the distribution’s spread therefore leave different spectral signatures. We could use that distinction to compare sensor recalibration with genuine learning about a probability.

What if the boosts themselves are uncertain?

Rapidity makes successive odds multipliers add. Suppose several independent uncertain rapidity increments R1,…,Rm accumulate:

Rtotal=R1+⋯+Rm.

Their characteristic functions multiply:

ϕtotal(k)=∏j=1mϕj(k).

Independence is the assumption that permits this factorization. With shared lineages, we would average the product of arrows using the joint distribution instead. When evidence takes different roads explores how to reconstruct that shared structure from the original observations.

Imagine an uncertain calibration travelling through several laboratories, or an uncertain sequence of changes of reference frame. Each stage adds a possible boost. The spectrum keeps track of the resulting cloud without reducing it to one trajectory.

At a small frequency, the arrow reveals familiar statistics:

ϕ(k)=1+ikE[R]−k22E[R2]+⋯.

The initial turn records mean rapidity; the initial decrease in its length records variance. Higher frequencies inspect finer structure.

We can now ask a larger question. Could an EP inference system switch representations according to the calculation it needs: trials for updating, hidden springs for coupling, rotating arrows for accumulating uncertain transformations? A sensor network could learn locally in Beta coordinates, negotiate shared conditions through Gaussian conditionals, and carry calibration uncertainty through spectral products. Every switch in that proposal has an explicit mathematical doorway. The adventure is deciding which combinations make a useful machine.

Follow this intoMathematics ↗