Lemma 6.4 — Recovering hidden bits from a randomized predictor
OpenCalibratedMA.Randomized.Supplement.lemma_6_4calibrationmultiaccuracyp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1sample-complexity
There are positive universal constants , with . For every integer , put , and . For , let have uniform contexts and Bernoulli means . Let be any admissible randomized predictor. The public decoder defined by nearest-baseline bins and the integrals of , with no labels or hidden bits as inputs, satisfies
The same decoder works for every hidden vector. This is the recovery statement used for the calibration component of Theorem 6.1.
Differences from the source:
- encoding: a finite discrete domain [R] → Fin R, with source coordinate i represented by i.val+1; reason: finite relabeling preserves every statistical experiment, test and error
- encoding: public points x_i=i/k and singleton identity test → a relabeled Fin k law and the actual test contextPoint i=(i.val+1)/k; reason: the labeled laws and published CMA are preserved by this bijection
- encoding: there is a label-free decoder and positive universal a,c → the displayed public decoder bitDecoder and witnesses with a≤1/4; reason: the proof explicitly constructs this decoder and chooses a≤1/4; there is no hidden-vector input
Preamble
import Mathlib import Definitions.Def_CalibratedMA_Randomized_Supplement_Hidden open MeasureTheory
Formal statement
namespace CalibratedMA.Randomized.Supplement
/-- Lemma 6.4, p.34, using the public decoder displayed immediately below the statement. -/
theorem lemma_6_4 :
∃ a c : ℝ, 0 < a ∧ a ≤ 1 / 4 ∧ 0 < c ∧
∀ k : ℕ, ∀ hk : 2 ≤ k, ∀ (Q : Fin k → Measure ℝ),
IsRandomizedPredictor Q → ∀ θ : Fin k → ℝ, (∀ i, IsBit (θ i)) →
CMA (offsetData baseline (a / (k : ℝ) ^ 2) θ) Q {contextPoint} ≤ c / (k : ℝ) ^ 2 →
(hamming (bitDecoder k (by omega) (a / (k : ℝ) ^ 2) Q) θ : ℝ) ≤ (k : ℝ) / 5 := by sorry
end CalibratedMA.Randomized.Supplement
Source
Jiuyao Lu, Georgy Noarov, Aaron Roth, Calibrated Multiaccuracy: Deterministic and Randomized Sample Complexity, STOC 2027 submission #900 (October 2026; title page November 2, 2026), p. 34, Lemma 6.4 (PDF pp. 36)