Two models that satisfy the hypotheses of the general results #
The general results of Sections 1 to 3 of the paper and of Section S2.1 assume the standing
assumption of Section 2 (Setting), and the results on finite sample spaces assume, moreover, that
π³ is finite. Two models satisfy these hypotheses.
- The Gaussian location model of Section 4, with the numΓ©raires of Proposition 2
(
setting_gaussNumeraire_mixAlt), to which Proposition 1 applies (gauss_minimaxRegret_le_log_succ). - A model of coin tosses on
π³ = Bool, with the simple null of independent fair coins and the alternative of independent coins with probability1/4oftrue. An e-variable at horizontis constant on the cylinders of the firstttosses, which have probability2^{-t}under the null (coinNull_pathCylinder), so that it is at most2^t(le_two_pow_of_isEVariable_coin) and the optimal e-power is at mostt log 2(finiteOptimalEPower_coin). With the likelihood ratiosdQ_t/dP_tas numΓ©raires (setting_coin), the claim of Section 1 on simple nulls givesΞ_T = 0(coin_minimaxRegret_eq_zero), and Proposition S1 and the claim of Section S2.1 apply (coin_exists_isEProcess_versions,coin_exists_maximin,coin_minimaxRegret_eq_iInf_bounded).
The Gaussian location model #
A model of coin tosses #
The probability 1/2 of true of a fair coin.
Equations
Instances For
The probability 1/4 of true of the coins of the alternative.
Instances For
The distribution of independent fair coins, the simple null of the coin model.
Equations
Instances For
The distribution of independent coins with probability 1/4 of true, the alternative of
the coin model.
Equations
Instances For
The numΓ©raires of the coin model: the likelihood ratios dQ_t/dP_t at X^t.
Equations
- LogOptimal.Examples.coinNumeraire t x = (LogOptimal.marginal LogOptimal.Examples.coinAlt t).rnDeriv (LogOptimal.marginal LogOptimal.Examples.coinNull t) fun (i : Fin t) => x βi
Instances For
The null of the coin model is a probability measure.
The alternative of the coin model is a probability measure.
theorem
LogOptimal.Examples.coin_exists_isEProcess_versions
(T : β)
:
β (Es' : β β (β β Bool) β ENNReal),
(β t β€ T, Measurable (Es' t) β§ Es' t =α΅[coinAlt] coinNumeraire t) β§ IsEProcess {coinNull} fun (t : β) => Es' (min t T)
theorem
LogOptimal.Examples.coin_exists_maximin
(T : β)
:
β ΞΎ β probVectors T,
minimaxRegret {coinNull} coinAlt coinNumeraire T = β¨
(E : β β (β β Bool) β ENNReal),
β¨
(_ : IsEProcess {coinNull} E), β t : Fin (T + 1), β(ΞΎ t) * regret coinAlt (coinNumeraire βt) (E βt)
theorem
LogOptimal.Examples.coin_minimaxRegret_eq_iInf_bounded
(T : β)
:
minimaxRegret {coinNull} coinAlt coinNumeraire T = β¨
(E : β β (β β Bool) β ENNReal),
β¨
(_ :
IsEProcess {coinNull} E β§ (β (t : β), E t = E (min t T)) β§ β (C : NNReal), β (t : β) (x : β β Bool), E t x β€ βC),
β¨ (t : β), β¨ (_ : t β€ T), regret coinAlt (coinNumeraire t) (E t)