Statistics 613 Homework 0: Beta Distribution and Identifiability of Parametrization - Prof, Assignments of Statistics

The instructions and problems for homework 0 of statistics 613: intermediate theory of statistics. The homework covers topics such as the acceptance/rejection method for generating beta distributed random numbers, identifiability of parametrization in statistical models, and specific examples of single index models, regression models with collinearity, and factor analysis. Students are required to submit their solutions in class and create a webpage linking to their work.

Typology: Assignments

Pre 2010

Uploaded on 02/10/2009

koofers-user-zhi
koofers-user-zhi 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Stat613: Intermediate Theory of Statistics
Homework 0 (8/27/07)
Instructor: Jianhua Huang Students: Student A
TA: Seokho Lee Student B
Welcome to Statistics 613! This homework helps you warm up. Please submit your solution in class on
Friday, August 31. Please also create a web page that links to your solutions.
Thanks!
–Jianhua Huang
Problem 1.
Acceptance/Rejection Method
Consider the generation of a xBeta(α, β ) quantity with density f(x|α, β) = kα,β xα1(1 x)β1I(x
[0,1]), α, β > 0. When α, β 1, xcan be generated by the following algorithm: (i) generate u1and u2
independently from a U[0,1] distribution; (ii) set v1=u1
1,v2=u1
2and w=v1+v2; (iii) if w > 1, then
go back to step i, otherwise set x=v1/w.
(a) Certify yourself of the correctness of the algorithm by writing a R program, drawing a sample of size
10,000 and plotting the resulting histogram along with the Beta(α, β) density function for several choices
of α,β.
(b) If xG(α, 1), yG(β, 1) and xand yare independent variables, show that x/(x+y)Beta(α, β).
Here we use G(α, β) to denote the Gamma distribution with density f(x;α, β) = βαxα1eβx /Γ(α), x > 0.
(c) Prove that the algorithm indeed generates a Beta(α, β) random number.
Solution
Give you solution here.
Problem 2.
Identifiability of Parametrization
A statistical model XP(x, θ) is called identifiable if and only if P(x, θ) = P(x, θ0) implies that θ=θ0
or, equivalently, if and only if θ6=θ0implies that P(x, θ)6=P(x, θ0). Identifiability means that the model
parameters are totally determined by the observed data. Only when the model is identifiable, interpretation
of the model parameters is meaningful. If a model is not identified, it can be made identifiable by imposing
constraints on the model parameter θ.
The notation used above is generic. The Xcould represent a random variable, a vector, or even more
complicated object. Similarly, the θcould be a number, a vector, or a function, or more complicated object.
Discuss if the following models are identifiable. If not, suggest a re-parameterization to make the model
identifiable.
(a) Single index model. Suppose we have data (Xi, Yi) independent identically distributed as (X, Y ). The
1
pf2

Partial preview of the text

Download Statistics 613 Homework 0: Beta Distribution and Identifiability of Parametrization - Prof and more Assignments Statistics in PDF only on Docsity!

Stat613: Intermediate Theory of Statistics

Homework 0 (8/27/07)

Instructor: Jianhua Huang Students: Student A TA: Seokho Lee Student B

Welcome to Statistics 613! This homework helps you warm up. Please submit your solution in class on Friday, August 31. Please also create a web page that links to your solutions.

Thanks!

–Jianhua Huang

Problem 1.

Acceptance/Rejection Method

Consider the generation of a x ∼ Beta(α, β) quantity with density f (x|α, β) = kα,β xα−^1 (1 − x)β−^1 I(x ∈ [0, 1]), α, β > 0. When α, β ≤ 1, x can be generated by the following algorithm: (i) generate u 1 and u 2

independently from a U [0, 1] distribution; (ii) set v 1 = u^11 /α , v 2 = u^12 /β and w = v 1 + v 2 ; (iii) if w > 1, then go back to step i, otherwise set x = v 1 /w.

(a) Certify yourself of the correctness of the algorithm by writing a R program, drawing a sample of size 10 , 000 and plotting the resulting histogram along with the Beta(α, β) density function for several choices of α, β.

(b) If x ∼ G(α, 1), y ∼ G(β, 1) and x and y are independent variables, show that x/(x + y) ∼ Beta(α, β). Here we use G(α, β) to denote the Gamma distribution with density f (x; α, β) = βαxα−^1 e−βx/Γ(α), x > 0.

(c) Prove that the algorithm indeed generates a Beta(α, β) random number.

Solution

Give you solution here.

Problem 2.

Identifiability of Parametrization

A statistical model X ∼ P (x, θ) is called identifiable if and only if P (x, θ) = P (x, θ′) implies that θ = θ′ or, equivalently, if and only if θ 6 = θ′^ implies that P (x, θ) 6 = P (x, θ′). Identifiability means that the model parameters are totally determined by the observed data. Only when the model is identifiable, interpretation of the model parameters is meaningful. If a model is not identified, it can be made identifiable by imposing constraints on the model parameter θ.

The notation used above is generic. The X could represent a random variable, a vector, or even more complicated object. Similarly, the θ could be a number, a vector, or a function, or more complicated object.

Discuss if the following models are identifiable. If not, suggest a re-parameterization to make the model identifiable.

(a) Single index model. Suppose we have data (Xi, Yi) independent identically distributed as (X, Y ). The

2 Homework 0

(X, Y ) ∈ Rd^ × R satisfies Y = f (XT^ β) + ,  ∼ N (0, σ^2 ) (1)

(b) Regression model with collinearity. Suppose the data (X, Y), with X a n × p matrix and Y a n-vector, are from the following model: Y = Xβ + , E() = 0 ¯

The rank of the X matrix satisfies rank(X) = r < p.

(c) Factor analysis. Let Y be a random vector in Rd. Consider the model

Y = Fα + ,  ∼ N (0, σ^2 I), (3)

where F is a d × k unknown matrix and α is a k dimensional zero mean Normal random vector. The data are i.i.d. copies of Y. Usually k is much smaller than d so this model is useful for dimension reduction.

Solution

Give you solution here.