Covariance domination conjecture for the uniform prior over the ℓ1 ball
Let be the ball, let be the posterior density under the uniform prior on , and write for the covariance matrix of the uniform distribution on . For a direction , let . Covariance domination conjecture. The posterior covariance is dominated by the prior covariance,
Equivalently, for every direction ,
The authors present this as the uniform-prior analogue of their contraction result, but leave it for future work because the geometry of the convex constraint makes the one-dimensional marginals and their Hessians more complicated.
References
Primary source
Curtis McDonald and Andrew R Barron, “Log-Concave Coupling for Sampling Neural Net Posteriors”, arXiv:2407.18802 (2024).
Progress summary
A 2026 posted calculation claims the conjecture is false in every dimension from two upward, but no independent verification was found.
McDonald and Barron introduced this covariance-domination conjecture for the uniform prior on the unit ball as a future problem in their 2024 paper. It asserts that conditioning on the auxiliary data cannot increase posterior variance in any direction.
Posted attempt
A reader-written calculation claims a complete counterexample: for every dimension , a permitted one-observation construction makes a transverse posterior variance strictly exceed its uniform-prior value. It also claims the analogous auxiliary assertion in the authors’ 2026 follow-up fails under all its stated hypotheses, but the argument has not been independently verified.
Current status (as of August 2026): The conjecture has no verified resolution; an unverified posted calculation claims a counterexample in every dimension , leaving the mathematical claim unsettled.
Sources
Solutions 1
CounterexampleThis solution needs a summarySee full solution
Counterexample in every dimension. Let , and let be uniform on . For , the exact marginal density and transverse conditional second moments are
In particular,
In Conjecture 1 of the original source, take any , one observation, and its allowed parameters
Direct substitution into source equations (6)–(7) gives the reverse conditional density
Both and strictly decrease on . The strict covariance identity
for an independent copy therefore gives, for every ,
Thus the asserted covariance domination fails strictly in every dimension . All stated source restrictions hold, including . For , an exact alternating-series certificate even yields
The failure persists with a full-rank design and a strictly concave conditional log density: taking two observations , residuals , and the same gives density proportional to
with transverse variance at least .
The latest published, truncated version also fails under its full hypotheses. The authors retain the analogous auxiliary assertion as equation (4.44) of their 2026 published follow-up, but its reverse conditional now has an additional truncation-normalization factor. To account for that factor and satisfy every hypothesis of its Theorem 1, choose
Then , , and . The required size restrictions hold:
and .
The truncation region is for some . For , put
Differentiating the Gaussian integral gives
the final strict sign follows by pairing with . Writing , the joint conditional density after integrating transverse coordinates is proportional to
Hence the first neuron's marginal, relative to its uniform prior, is weighted by
Convolution preserves the class of even functions decreasing on , as follows immediately from the layer-cake representation by centered intervals. Since is strictly decreasing there, so is . Applying the same strict slice-covariance argument above shows
Consequently, the latest published equation (4.44) fails even under every stated size and truncation hypothesis.
A separate variance error. Both papers print for a signed uniform coordinate. That expression is instead ; the correct signed variance is , also implied by the published paper's own Appendix equation (7.54).
These counterexamples refute the auxiliary covariance-domination assertions, not the main theorem of the later paper, which uses a different bound.
Sources: original Conjecture 1; final published article, equation (4.44).