User:Mxxun/sandbox/Complete class theorem
 | This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft. Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
In Bayesian statistics and decision theory, the complete class theorems establish properties of certain classes of decision rules: that a class does not miss any strict improvements (i.e. that it is complete), or that any complete class can be approximated by a known family of rules.
Setting and statement
[edit]Proof
[edit]Variants
[edit]Notes
[edit]References
[edit]- Lehmann, E. L.; Casella, G. (1998). Theory of Point Estimation (2nd ed.). Springer. pp. 376–383. ISBN 0-387-98502-6.
- Ferguson, Thomas S. (1967). Mathematical Statistics: A Decision Theoretic Approach. Academic Press. pp. 58–87. ISBN 978-1-4832-0780-3.
External links
[edit]Category:Bayesian statistics Category:Theorems in statistics Category:Optimal decisions