What does Maximum-Entropy Demand Reconstruction conclude, in numbers, about “The Cost of the Normal and Uniform Shortcuts: Quantiles, Log Loss and the Minimax”?
Answer: Chapter 3 compares the three approaches under three rulers: across four illustrative truths the log loss of maximum entropy is constant at 7.080 bits and smallest in the worst case, yet the worst error of the 90th percentile is smaller for the normal shortcut, 18.8 against 23.5.
Scope of the numbers: The normal shortcut adds a symmetric shape and a standard deviation; under illustrative parameters, with a mean of 80 and a floor of 30, it puts 0.133 of its probability on impossible values, rising to 0.412 when the mean is 40. Accepting only the bounds and the mean, the maximum-entropy principle proposed by Jaynes in 1957 gives a truncated exponential distribution, with a 90th-percentile order of 146.0 for the illustrative dessert shop.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 18.8, 23.5, 90
| truth max-ent b(2,8.8) b(1.2,5.28) two-hump | |
| true P50 | 65.4 74.7 71.1 60.9 |
| true P90 | 146.0 122.5 134.9 156.5 |
| abs error of P50 | |
| max-ent | 0.0 9.3 5.7 4.5 worst 9.3 |
| normal | 14.6 5.3 8.9 19.1 worst 19.1 |
| uniform | 99.6 90.3 93.9 104.1 worst 104.1 |
| abs error of P90 | |
| max-ent | 0.0 23.5 11.2 10.5 worst 23.5 |
| normal | 8.4 15.1 2.8 18.8 worst 18.8 |
| uniform | 127.0 150.5 138.1 116.5 worst 150.5 |
Show the full program
# Chapter 3. p33: quantile errors of each forecast under each truth.
# Model: the four illustrative truths of p32 (all on [30, 300], mean
# 80). For each forecast we compare its P50 and P90 with the true ones;
# true quantiles come from bisection on a Simpson-rule distribution
# function (math.fsum). We report the worst absolute error across the
# four truths, the figure an owner who does not know the shape faces.
import math
from statistics import NormalDist
A, B, M = 30.0, 300.0, 80.0
L = B - A
FR = (M - A) / L
def simpson(f, lo, hi, n=2000):
h = (hi - lo) / n
terms = [f(lo), f(hi)]
terms += [4.0 * f(lo + i * h) for i in range(1, n, 2)]
terms += [2.0 * f(lo + i * h) for i in range(2, n, 2)]
return math.fsum(terms) * h / 3.0
def integ(f, n=2000, hi=B):
# x = A + v * v removes the kink of densities that start at A
g = lambda v: f(A + v * v) * 2.0 * v
return simpson(g, 0.0, math.sqrt(hi - A), n)
def te_mean(lam):
u = lam * L
if abs(u) < 1e-8:
return A + L / 2.0
return A + 1.0 / lam - L / math.expm1(u)
def solve(m):
lo, hi = -2.0, 2.0
for _ in range(80):
mid = (lo + hi) / 2.0
if te_mean(mid) > m:
lo = mid
else:
hi = mid
return (lo + hi) / 2.0
def te_pdf(lam):
return lambda x: lam * math.exp(-lam * (x - A)) / -math.expm1(-lam * L)
def te_q(lam, p):
return A - math.log1p(p * math.expm1(-lam * L)) / lam
def beta_pdf(u, al, be):
if u <= 0.0 or u >= 1.0:
return 0.0
lg = math.lgamma(al + be) - math.lgamma(al) - math.lgamma(be)
return math.exp(lg + (al - 1) * math.log(u) + (be - 1) * math.log1p(-u))
def beta_x(al, be):
return lambda x: beta_pdf((x - A) / L, al, be) / L
F2 = (FR - 0.75 * 0.1) / 0.25
MIX = ((0.75, 4.0, 36.0), (0.25, 8.0, 8.0 * (1 - F2) / F2))
def mix_pdf(x):
return math.fsum(w * beta_x(a, b)(x) for w, a, b in MIX)
def truths():
lam = solve(M)
return [("max-ent", te_pdf(lam)),
("b(2,8.8)", beta_x(2.0, 8.8)),
("b(1.2,5.28)", beta_x(1.2, 5.28)),
("two-hump", mix_pdf)]
def quantile(f, p):
lo, hi = A, B
for _ in range(40):
mid = (lo + hi) / 2.0
if integ(f, 400, mid) < p:
lo = mid
else:
hi = mid
return (lo + hi) / 2.0
if __name__ == "__main__":
lam = solve(M)
nd = NormalDist(M, L / 6.0)
ts = truths()
tq = {p: [quantile(t, p) for _, t in ts] for p in (0.5, 0.9)}
print(" truth " + "".join("{:>12}".format(n) for n, _ in ts))
for p in (0.5, 0.9):
print(" true P{:<2.0f} ".format(100 * p)
+ "".join("{:>12.1f}".format(v) for v in tq[p]))
fc = [("max-ent", lambda p: te_q(lam, p)),
("normal", nd.inv_cdf),
("uniform", lambda p: A + p * L)]
for p in (0.5, 0.9):
print("abs error of P{:.0f}".format(100 * p))
for name, q in fc:
err = [abs(q(p) - v) for v in tq[p]]
print(" {:<9}".format(name)
+ "".join("{:>12.1f}".format(e) for e in err)
+ " worst {:>5.1f}".format(max(err)))Single source and citation
Fan, Y. (2026). The Maximum-Entropy Principle and Demand Reconstruction from Missing Data: the Least-Biased Order-Value Distribution Given Only a Mean and Bounds (Version 1.0.0), Chapter 3: The Cost of the Normal and Uniform Shortcuts: Quantiles, Log Loss and the Minimax. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-301 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026301,
author = {Fan, Yafu},
title = {The Maximum-Entropy Principle and Demand Reconstruction from Missing Data: the Least-Biased Order-Value Distribution Given Only a Mean and Bounds},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Lagrange Multiplier of Maximum Entropy: the Truncated Exponential When Only a Mean and Bounds Are Known
- Chapter 2 · Discrete Maximum Entropy over Price Tiers: Wallis's Count, the Concentration Theorem and the Limits of Uniqueness
- Chapter 4 · Adding the Second Moment: the Truncated Normal Family, Convex Exponents and What One Standard Deviation Buys
- Chapter 5 · After the Sample Arrives: Plug-in Bias, the Second-Moment Trap and the Handover Point
- Chapter 6 · Stocking a New Product with the Newsvendor Model: Ordering at a Maximum-Entropy Quantile and Worst-Case Regret
- Chapter 7 · East and West in the Classics: "Knowing That One Does Not Know" in Laozi 71 and Laplace's Philosophical Essay on Probabilities
- Chapter 8 · Closing the Loop: Cold-Start Demand for a New Product, the Maximum-Entropy Demand Reconstructor and a Pre-Registered Plan of Refutation