What does Maximum-Entropy Demand Reconstruction conclude, in numbers, about “Closing the Loop: Cold-Start Demand for a New Product, the Maximum-Entropy Demand Reconstructor and a Pre-Registered Plan of Refutation”?
Answer: Chapter 8 gives the cold-start loop for new products, the distilled Maximum-Entropy Demand Reconstructor and a pre-registered plan of refutation, in which detecting an exceedance share of 0.20 in the calibration test needs 86 new products. Boxes separate published evidence, runnable Python (20 programs), classical sources and hypotheses.
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: 0.20, 86
| A. items needed to test P90 calibration (null share 0.10) | |
| true share 0.05 | 239 items |
| true share 0.15 | 316 items |
| true share 0.20 | 86 items |
| true share 0.25 | 41 items |
| B. items needed for a paired regret comparison | |
| effect size 0.2 | 199 items |
| effect size 0.3 | 90 items |
| effect size 0.5 | 34 items |
| effect size 0.8 | 15 items |
| C. rule of thumb from p51 and p52: below about 30 orders use | |
| max-ent from mean and bounds; from about 50 orders the | |
| sample's own percentile wins on these illustrative truths |
Show the full program
# Chapter 8. p82: how many items and orders a fair test needs.
# Model: two pre-registered tests, normal approximations, two-sided
# alpha 0.05 and power 0.80. A. Calibration: if the maximum-entropy
# P90 is honest, a share 0.10 of new items sell above it; how many
# items detect a true share of p1? B. Paired comparison of profit
# regret between max-ent and normal ordering across items, effect size
# d = mean difference / sd of differences. C. Orders needed before the
# sample's own P90 beats max-ent, read off p51 and p52 (illustrative).
import math
from statistics import NormalDist
Z = NormalDist()
def n_prop(p0, p1, alpha=0.05, power=0.80):
za, zb = Z.inv_cdf(1 - alpha / 2), Z.inv_cdf(power)
num = za * math.sqrt(p0 * (1 - p0)) + zb * math.sqrt(p1 * (1 - p1))
return math.ceil((num / (p1 - p0)) ** 2)
def n_paired(d, alpha=0.05, power=0.80):
za, zb = Z.inv_cdf(1 - alpha / 2), Z.inv_cdf(power)
return math.ceil(((za + zb) / d) ** 2 + za * za / 2)
if __name__ == "__main__":
print("A. items needed to test P90 calibration (null share 0.10)")
for p1 in (0.05, 0.15, 0.20, 0.25):
print(" true share {:.2f}: {:>5} items".format(p1, n_prop(0.10, p1)))
print("B. items needed for a paired regret comparison")
for d in (0.2, 0.3, 0.5, 0.8):
print(" effect size {:.1f}: {:>5} items".format(d, n_paired(d)))
print("C. rule of thumb from p51 and p52: below about 30 orders use")
print(" max-ent from mean and bounds; from about 50 orders the")
print(" sample's own percentile wins on these illustrative truths")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 8: Closing the Loop: Cold-Start Demand for a New Product, the Maximum-Entropy Demand Reconstructor and a Pre-Registered Plan of Refutation. 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 3 · The Cost of the Normal and Uniform Shortcuts: Quantiles, Log Loss and the Minimax
- 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