Learning.detEnvironment
This page has the declaration's own card below, then its dependency graph, then a card for each dependency (type dependencies first, then the rest of the transitive closure). For a theorem, the graph and the dependency cards only follow its statement's dependencies (its proof is replaced by sorry, so what it proves doesn't depend on how); for everything else, both the type and the body/value are followed, since their content is part of what later declarations build on.
detEnvironmentπ
Learning.detEnvironmentA deterministic environment, where the feedback is given by evaluating fixed measurable functions.
Learning.detEnvironment.{u_1, u_2} {π : Type u_1} {π¨ : Type u_2} {mπ : MeasurableSpace π} {mπ¨ : MeasurableSpace π¨} (f0 : π β π¨) (hf0 : Measurable f0) (f : (n : β) β (β₯(Finset.Iic n) β π Γ π¨) Γ π β π¨) (hf : β (n : β), Measurable (f n)) : Environment π π¨Learning.detEnvironment.{u_1, u_2} {π : Type u_1} {π¨ : Type u_2} {mπ : MeasurableSpace π} {mπ¨ : MeasurableSpace π¨} (f0 : π β π¨) (hf0 : Measurable f0) (f : (n : β) β (β₯(Finset.Iic n) β π Γ π¨) Γ π β π¨) (hf : β (n : β), Measurable (f n)) : Environment π π¨
Code
noncomputable def detEnvironment
(f0 : π β π¨) (hf0 : Measurable f0)
(f : (n : β) β ((Iic n β π Γ π¨) Γ π) β π¨) (hf : β n, Measurable (f n)) :
Environment π π¨ where
feedback n := (Kernel.deterministic (f n) (hf n))
Ξ½0 := Kernel.deterministic f0 hf0Type uses (1)
Used by (3)
Actions: Source Β· Open Issue
Dependency graph
Type dependencies (1)
Environmentπ
Learning.EnvironmentA stochastic environment.
Learning.Environment.{u_4, u_5} (π : Type u_4) (π¨ : Type u_5) [MeasurableSpace π] [MeasurableSpace π¨] : Type (max u_4 u_5)Learning.Environment.{u_4, u_5} (π : Type u_4) (π¨ : Type u_5) [MeasurableSpace π] [MeasurableSpace π¨] : Type (max u_4 u_5)
Code
structure Environment (π π¨ : Type*) [MeasurableSpace π] [MeasurableSpace π¨] where /-- Distribution of the next observation as function of the past history. -/ feedback : (n : β) β Kernel ((Iic n β π Γ π¨) Γ π) π¨ /-- The feedback kernels are Markov kernels. -/ [h_feedback : β n, IsMarkovKernel (feedback n)] /-- Distribution of the first observation given the first action. -/ Ξ½0 : Kernel π π¨ /-- The initial observation kernel is a Markov kernel. -/ [hp0 : IsMarkovKernel Ξ½0]
Actions: Source Β· Open Issue