Documentation

LogOptimalEProcesses.Examples.Models

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 #

theorem LogOptimal.Examples.gauss_minimaxRegret_le_log_succ {s ρ : ℝ} (hs : 0 < s) (hρ : 1 - s ^ 2 ≀ ρ ^ 2) (T : β„•) :
minimaxRegret gaussNull (mixAlt s ρ) (gaussNumeraire s) T ≀ ↑(Real.log (↑T + 1))

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.

    Equations
    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
          noncomputable def LogOptimal.Examples.coinNumeraire (t : β„•) (x : β„• β†’ Bool) :

          The numΓ©raires of the coin model: the likelihood ratios dQ_t/dP_t at X^t.

          Equations
          Instances For
            theorem LogOptimal.Examples.le_two_pow_of_isEVariable_coin {t : β„•} {E : (β„• β†’ Bool) β†’ ENNReal} (hE : IsEVariable {coinNull} t E) (x : β„• β†’ Bool) :
            E x ≀ 2 ^ t
            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)