The Exact KL Radius of Two Bernoulli Products on Three Bits
Authors/Creators
Description
Anonymous, AI-assisted, unrefereed computer-assisted theorem candidate addressing AIM-PROBABILITY-0002. The claimed exact maximum forward-Kullback-Leibler error of the closed RBM(3,1) model, equivalently a mixture of two Bernoulli products on three bits, is -3/4 log(2 sqrt(3)-3) nats (approximately 0.830615532444 bits), attained only by the two uniform parity targets.
The package contains the 11-page manuscript, analytic lower bound and continuous support/channel reduction, six exact convex-cover certificates with 16,600 leaves and 93,792 vertex conditions, a standard-library verifier, adversarial tests, a rational target-to-feasible-witness interface, and an elementary nonsharp conditioning upper bound for specified higher-dimensional product-mixture budgets. It also includes the review response and five producer-coordinated internal editorial reports. The exact Stage-1 review target is preserved as a separate ZIP. SHA256SUMS.txt binds the three substantive assets.
The constant and conditioning principle have explicitly cited prior antecedents. Finite diagnostics, producer replay, CI and internal model review are not unaffiliated mathematical validation. No general optimal-projection algorithm, higher-dimensional sharpness, general larger-RBM equivalence, exhaustive novelty, formal verification, external peer review or four-star impact is claimed.
Original manuscript, certificate data and editorial material: CC0. Original executable code: MIT, as specified in LICENSE-CODE. Third-party papers, supplied-review text and other NOASSERTION material are not redistributed. Publisher: Evidence Press.
Notes
Files
rbm31-exact-kl-radius-0.1.0-candidate.pdf
Additional details
Related works
- Is identical to
- https://github.com/ipitchford/rbm31-exact-kl-radius/releases/tag/v0.1.0-candidate (URL)
- Is supplement to
- https://evidencepress.org/releases/rbm31-exact-kl-radius/ (URL)