Learning.Algorithm
A stochastic, sequential algorithm.
Learning.Algorithm.{u_4, u_5} (π : Type u_4) (π¨ : Type u_5) [MeasurableSpace π] [MeasurableSpace π¨] : Type (max u_4 u_5)Learning.Algorithm.{u_4, u_5} (π : Type u_4) (π¨ : Type u_5) [MeasurableSpace π] [MeasurableSpace π¨] : Type (max u_4 u_5)
Code
structure Algorithm (π π¨ : Type*) [MeasurableSpace π] [MeasurableSpace π¨] where
/-- Policy or sampling rule: distribution of the next action. -/
policy : (n : β) β Kernel (Iic n β π Γ π¨) π
/-- The policy is a Markov kernel. -/
[h_policy : β n, IsMarkovKernel (policy n)]
/-- Distribution of the first action. -/
p0 : Measure π
/-- The first action distribution is a probability measure. -/
[hp0 : IsProbabilityMeasure p0]Actions: Source Β· Open Issue
Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23), the 2th recorded change.
Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file Β· open it in the Lean web editor.
Dependency graph
Nothing to draw. Its statement rests on no other declaration in this project, and names nothing from a package left unaudited β so the graph is this declaration alone. That is the answer, not a missing picture.
Audit surface: 0 project declarations, 19 external constants
β Proved: no sorry anywhere in its closure
This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.