Optimal Learning from the Doob-Dynkin lemma
Taraldsen, Gunnar
Original · EN
The Doob-Dynkin Lemma gives conditions on two functions X and Y that ensure existence of a function ϕ so that X = ϕ ∘ Y. This communication proves different versions of the Doob-Dynkin Lemma, and shows how it is related to optimal statistical learning algorithms. Keywords and phrases: Improper prior, Descriptive set theory, Conditional Monte Carlo, Fiducial, Machine learning, Complex data.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.