Independent centered Laplace distributions for pixel intensities give the prior distribution
This prior favors small intensities through its sharp peak at zero, while its tails permit isolated appreciable pixels. Its negative log density is an L1 norm penalty, so with a Gaussian likelihood a maximum a posteriori estimate minimizes a sum of squared residuals plus that penalty. A draw from this continuous prior has no exactly zero coordinate with positive probability; sparsity of a maximizing estimate and concentration of prior mass near zero are different statements. The product prior also does not encode spatial contiguity. Inverse transform sampling produces each coordinate from an independent uniform distribution by for and otherwise, ignoring the probability-zero endpoints.
For a proper convex function with sequential lower semicontinuity , form with . The Moreau envelope theorem gives . If is integrable, it defines a smooth surrogate probability density function. Infimizing the logarithm of a probability density function with a positive quadratic penalty has the opposite sign and does not generally smooth it. For the Laplace distribution, that incorrect operation leaves , which is not differentiable at zero.
Recognize the integrand as a Gaussian scale mixture. If has the unit Rayleigh distribution and is an independent standard normal distribution variable, then the conditional density of given is . Multiplying by the radius density gives
Thus use for the independent radius and for the normal output of the Box-Muller transform:
The mixture argument also proves that integrates to one, by the Tonelli theorem. As a check, is exponential of rate , so the characteristic function of is . This is the Rayleigh-normal scale mixture, with Laplace distribution density .
Here and . The asset payoff has a centered Laplace distribution. Its moment-generating function is for , and diverges otherwise. Expected constant absolute risk aversion utility for a holding is
To maximize it, minimize the logarithm of the positive factor on . Its derivative is , and its second derivative is strictly positive. It diverges at the endpoints, so the unique critical point is the global optimizer:
At use the continuous limit . The other quadratic root is outside the finite-utility domain.
Let . Aggregate demand is . Unit positive supply requires and . Squaring and excluding gives
This negative price satisfies the unsquared equation and every individual finite-utility constraint. When , there is no finite clearing price. Indeed for every finite negative , with limit as . If this maximum limiting demand is below supply; if equal, demand only approaches one at an infinitely negative price. A formal positive solution obtained by squaring when violates the original demand equation.
Use the extended target probability density function
The desired stationary distribution for positions is ; the full position-momentum joint probability distribution is , not alone. Gaussian momentum refreshment preserves , since it redraws its momentum marginal distribution independently while keeping the position fixed.
Let and be the surrogate leapfrog integration map. The proposal in the paper is : its notation includes the final momentum flip. Reversibility gives , so . Both and preserve volume. Thus is an involutive Metropolis proposal, and the required acceptance probability is
Equivalently, in terms of the surrogate Hamiltonian ,
Only evaluations of the true target probability density function are needed at endpoints; the trajectory uses the surrogate gradient. Target and surrogate normalizing constants cancel.
For , the accepted flux satisfies
Changing variables has unit absolute Jacobian determinant, so this identity proves detailed balance for accepted moves. The rejection mass stays at the same point and is also reversible. The accept/reject step therefore preserves . Since momentum refreshment also preserves , their composition and either phase of the alternating process preserve . Projecting onto positions proves the position stationary distribution is exactly the original target. Stationarity alone does not establish uniqueness or convergence from every start; those require additional irreducible Markov chain and aperiodic Markov chain hypotheses.
There is a genuine defect in the printed smoothing claim. For the positive, nondifferentiable Laplace distribution on the real line, direct minimization gives, for every ,
For the minimizer is ; for it is ; at zero both signs minimize. Hence normalization leaves , still nondifferentiable at zero. The displayed construction does not in general produce the asserted smooth surrogate. For example, the also nondifferentiable target makes that infimum for every , since the negative quartic term dominates the quadratic penalty. The invariance proof above is valid conditional on actually having a usable smooth surrogate, as the subsequent algorithm assumes.
A corrected sufficient construction is Moreau smoothing of a negative log-density. For a proper convex function with sequential lower semicontinuity , set
The Moreau envelope is differentiable, with ; require to be integrable to normalize it. The signs differ from the printed formula. For the Laplace distribution, this gives
a genuinely differentiable potential with integrable exponential tails. Using that surrogate with the boxed acceptance probability still targets the original Laplace distribution.
A simple choice is an independent Laplace distribution at each pixel, giving a Laplace prior for sparse images:
Its negative log density penalizes the L1 norm. Relative to a normal distribution, it combines a sharp peak at zero with heavier tails, allowing most pixels to lie near the background level while a few have appreciable intensity. Quantitatively, , so the expected number of appreciable pixels is . Choosing large makes this small. This is a simple sparsity model: it does not enforce that nearby active pixels form connected objects, nor does its continuous density give exact zero pixels positive probability. Additional spatial modelling would be needed to insist on contiguous shapes.
To sample, draw independent and use inverse transform sampling:
The endpoint events have probability zero and can be assigned arbitrary finite values. To justify the rule, the cumulative distribution function of a centered Laplace distribution is
The displayed rule is , so . Independence of random variables then gives the stated product prior distribution.
The noise has the product Laplace distribution density
which is normalized because . By translation invariance of Lebesgue measure, the conditional law of has density
Hence an associated likelihood function is
The map is measurable because is measurable and vector subtraction is continuous. Composition with the continuous norm and exponential functions proves that is jointly measurable.