Documentation

TestingLowerBounds.Testing.Binary

Simple Bayesian binary hypothesis testing #

Main definitions #

Main statements #

The loss of the simple binary hypothesis testing problem: ℓ(y, z) = 𝕀{y ≠ z}.

Equations
Instances For
    noncomputable def ProbabilityTheory.binaryGenBayesEstimator {𝒳 : Type u_1} {m𝒳 : MeasurableSpace 𝒳} (μ ν : MeasureTheory.Measure 𝒳) (π : MeasureTheory.Measure Bool) :
    𝒳 → Bool

    The function x ↦ 𝕀{π₀ * ∂μ/∂(boolKernel μ ν ∘ₘ π) x ≤ π₁ * ∂ν/∂(boolKernel μ ν ∘ₘ π) x}. It is an argmin estimator for the simple binary hypothesis testing problem.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      theorem ProbabilityTheory.bayesRisk_boolKernel_eq_lintegral_iInf {𝒳 : Type u_1} {m𝒳 : MeasurableSpace 𝒳} {𝒴 : Type u_3} [MeasurableSpace 𝒴] {ℓ : Bool → 𝒴 → ENNReal} (hℓ : Measurable (Function.uncurry ℓ)) (μ ν : MeasureTheory.Measure 𝒳) [MeasureTheory.IsFiniteMeasure μ] [MeasureTheory.IsFiniteMeasure ν] (π : MeasureTheory.Measure Bool) [MeasureTheory.IsFiniteMeasure π] (h : HasArgminEstimator ℓ (Kernel.boolKernel μ ν) π) :
      bayesRisk ℓ (Kernel.boolKernel μ ν) π = ∫⁻ (x : 𝒳), ⨅ (y : 𝒴), π {true} * ν.rnDeriv (π.bind ⇑(Kernel.boolKernel μ ν)) x * ℓ true y + π {false} * μ.rnDeriv (π.bind ⇑(Kernel.boolKernel μ ν)) x * ℓ false y ∂π.bind ⇑(Kernel.boolKernel μ ν)

      The Bayes risk for a prior π of an estimation problem with parameter space Bool and data generating kernel boolKernel μ ν, when it admits an argmin estimator.

      noncomputable def ProbabilityTheory.bayesBinaryRisk {𝒳 : Type u_1} {m𝒳 : MeasurableSpace 𝒳} (μ ν : MeasureTheory.Measure 𝒳) (π : MeasureTheory.Measure Bool) :

      The Bayes risk of simple binary hypothesis testing with respect to a prior.

      Equations
      Instances For
        theorem ProbabilityTheory.bayesBinaryRisk_eq {𝒳 : Type u_1} {m𝒳 : MeasurableSpace 𝒳} (μ ν : MeasureTheory.Measure 𝒳) (π : MeasureTheory.Measure Bool) :
        bayesBinaryRisk μ ν π = ⨅ (κ : Kernel 𝒳 Bool), ⨅ (_ : IsMarkovKernel κ), π {true} * (ν.bind ⇑κ) {false} + π {false} * (μ.bind ⇑κ) {true}
        theorem ProbabilityTheory.bayesBinaryRisk_smul_smul {𝒳 : Type u_1} {m𝒳 : MeasurableSpace 𝒳} (μ ν : MeasureTheory.Measure 𝒳) (π : MeasureTheory.Measure Bool) (a b : ENNReal) :
        bayesBinaryRisk (a • μ) (b • ν) π = bayesBinaryRisk μ ν (π.withDensity fun (x : Bool) => bif x then b else a)

        B (a•μ, b•ν; π) = B (μ, ν; (a*π₀, b*π₁)).

        theorem ProbabilityTheory.bayesBinaryRisk_le_bayesBinaryRisk_comp {𝒳 : Type u_1} {𝒳' : Type u_2} {m𝒳 : MeasurableSpace 𝒳} {m𝒳' : MeasurableSpace 𝒳'} (μ ν : MeasureTheory.Measure 𝒳) (π : MeasureTheory.Measure Bool) (η : Kernel 𝒳 𝒳') [IsMarkovKernel η] :
        bayesBinaryRisk μ ν π ≤ bayesBinaryRisk (μ.bind ⇑η) (ν.bind ⇑η) π

        Data processing inequality for the Bayes binary risk.

        @[simp]
        theorem ProbabilityTheory.bayesBinaryRisk_zero_prior {𝒳 : Type u_1} {m𝒳 : MeasurableSpace 𝒳} {μ ν : MeasureTheory.Measure 𝒳} :
        bayesBinaryRisk μ ν 0 = 0