Documentation

LeanMachineLearning.SequentialLearning.Algorithms.RandomSampling.Basic

Random Sampling #

Implementation of the Random Sampling algorithm, which samples from a fixed probability measure at each iteration.

Main definitions #

Main statements #

noncomputable def Learning.randomSampling {š“ž : Type u_1} {š“ : Type u_2} {š“Ø : Type u_3} {mš“ž : MeasurableSpace š“ž} {mš“ : MeasurableSpace š“} {mš“Ø : MeasurableSpace š“Ø} (μ : MeasureTheory.Measure š“) [MeasureTheory.IsProbabilityMeasure μ] :
Algorithm š“ž š“ š“Ø

The Random Sampling algorithm, which samples from a fixed probability measure at each iteration.

Equations
Instances For
    @[simp]
    theorem Learning.randomSampling_policy {š“ž : Type u_1} {š“ : Type u_2} {š“Ø : Type u_3} {mš“ž : MeasurableSpace š“ž} {mš“ : MeasurableSpace š“} {mš“Ø : MeasurableSpace š“Ø} (μ : MeasureTheory.Measure š“) [MeasureTheory.IsProbabilityMeasure μ] (xāœ : ā„•) :
    (randomSampling μ).policy xāœ = ProbabilityTheory.Kernel.const (Hist š“ž š“ š“Ø xāœ Ɨ š“ž) μ
    theorem Learning.randomSampling.hasLaw_action {š“ž : Type u_1} {š“ : Type u_2} {š“Ø : Type u_3} {Ī© : Type u_4} {mš“ž : MeasurableSpace š“ž} {mš“ : MeasurableSpace š“} {mš“Ø : MeasurableSpace š“Ø} {mĪ© : MeasurableSpace Ī©} {μ : MeasureTheory.Measure š“} [MeasureTheory.IsProbabilityMeasure μ] {P : MeasureTheory.Measure Ī©} [MeasureTheory.IsProbabilityMeasure P] {O : ā„• → Ī© → š“ž} {A : ā„• → Ī© → š“} {Y : ā„• → Ī© → š“Ø} {env : Environment š“ž š“ š“Ø} (h : IsAlgEnvSeq O A Y (randomSampling μ) env P) (n : ā„•) :

    Each action follows the distribution μ.

    theorem Learning.randomSampling.iIndep_action {š“ž : Type u_1} {š“ : Type u_2} {š“Ø : Type u_3} {Ī© : Type u_4} {mš“ž : MeasurableSpace š“ž} {mš“ : MeasurableSpace š“} {mš“Ø : MeasurableSpace š“Ø} {mĪ© : MeasurableSpace Ī©} {μ : MeasureTheory.Measure š“} [MeasureTheory.IsProbabilityMeasure μ] {P : MeasureTheory.Measure Ī©} [MeasureTheory.IsProbabilityMeasure P] {O : ā„• → Ī© → š“ž} {A : ā„• → Ī© → š“} {Y : ā„• → Ī© → š“Ø} {env : Environment š“ž š“ š“Ø} (h : IsAlgEnvSeq O A Y (randomSampling μ) env P) :

    Actions are mutually independent.