Compressed Sensing and L1 Minimisation: Sparse Mystery-Shopper Probes and the Exact Recovery of Competitors' Hidden-Discount Matrices: chapter answers
The trade assumes that learning which of a rival's items carry a hidden discount at checkout, one not printed on the label, and how large each is, requires quoting every item in a full census, since sampling yields at best an average. This book uses compressed sensing to refute the premise of that view. As long as hidden discounts are sparse, putting items into random carts and reading only the checkout totals needs a number of quotes roughly proportional to the number of discounts times the logarithm of the ratio of items to discounts, far fewer than the items themselves, and L1 minimisation…
DOI pending · monograph page goes live after publication · 5DL-B-242 · 中文版
- Chapter 1 · No Full Census Needed: Basket Quotes, Sparse Hidden Discounts and Exact L1 Recovery
Chapter 1 checks and corrects the sources of the founding claim and uses an exact simplex method in fractions to recover 3 hidden discounts among 40 items from 12 basket quotes, while least squares smears them over the… - Chapter 2 · L1 as a Linear Program: the Two-Phase Simplex, Dual Certificates and a Design Check for Probes
Chapter 2 writes L1 as a two-phase simplex, treats degeneracy and perturbation, issues certificates of uniqueness, and gives a design check for baskets: zero and identical columns pull the recovery share of three-cell s… - Chapter 3 · The Price of Greed: Orthogonal Matching Pursuit, Coherence and Worst-Case Guarantees
Chapter 3 compares orthogonal matching pursuit: on one hundred items L1 reaches ninety percent success with 22 quotes, nonnegative OMP with 26 and plain OMP with 34, while worst-case coherence guarantees are nearly usel… - Chapter 4 · The Phase Diagram: Probe Share, Sparsity and the Value of Knowing the Sign
Chapter 4 draws the phase diagram of zero-one baskets and prices the knowledge that there are discounts only. - Chapter 5 · Rounding, Anniversary Coupons and Hold-Out Quotes: from Exact to Stable Recovery
Chapter 5 handles rounding, anniversary coupons and threshold rules: with rounding to ten fen the equality model is mostly infeasible, while the robust model still finds every support with a worst error of 0.03 yuan, an… - Chapter 6 · The Hidden-Discount Matrix: Joint Sparsity across Public Conditions, and Basket Size
Discounts under several public conditions form a matrix side by side, and the discounted items are largely the same across conditions; this is joint sparsity. Program p61 showed that joint information lets the greedy SO… - Chapter 7 · Classical Sources East and West: Foreknowledge in Sunzi's "Use of Spies" and Shannon's Count of Samples
Chapter 7 examines Sunzi's "foreknowledge must be obtained from people" and Shannon's count of samples: in an illustrative account analogy loses 59400 yuan, a census costs 57600 yuan and sparse probes 12960 yuan, and ea… - Chapter 8 · Closing the Loop: a Monthly Mystery-Shopper Probe Schedule, a Compliance Checklist and a Pre-Registered Test
Chapter 8 gives a six-step monthly probe procedure, a seven-item compliance checklist, the Sparse Probe Reconstructor and a pre-registered test. Marked boxes separate published evidence, runnable Python calculations (18…
Illustrative model calculation, not a live quote