
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Professor: Huang; Class: STAT METHODOLOGY I; Subject: STATISTICS; University: Texas A&M University; Term: Unknown 1989;
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Stat610: Intermediate Theory of Statistics
Instructor: Jianhua Huang Editor: Jose Montes Valarde TA: Seokho Lee
Problem A1.
Let pθ,η (x) (viewed as a probability density) be a parametric model, where θ is the parameter of interest and η is a nuisance parameter. When η is not free, but is a function of θ, we say that we have a submodel of the original model. This submodel can be denoted as pθ,η(θ)(x). Compute the (expected) Fisher information of θ in this submodel. Find a η(θ) that minimizes the Fisher information in the submodel among all possible functions η(θ). The corresponding submodel is called the hardest submodel. Can you relate the Fisher information in the submodel to that in the original model?
Solve the problem first by assuming θ and η are one-dimensional. Then extend your results to multi- dimensional case.