Linear Models Flashcards

1
Q

Recall the standard linear regression model, define any terms and indices

A

yi=B0+B1xi1+B2xi2+…+Bkxik+ei

yi is the ith response

xij is the ith value of the jth regressor

k is the number of regressors (k+1=p parameters)

B0 is the y-intercept

Bj is coefficient associated with the jth regressor

ei is an error term, usually assumed iid random with mean 0 and variance sig^2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Matrix form of regression model and what are any assumptions made (OLS assumptions)?

A

y = XB + e

E[e]=0

var(e)=sig2 I

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

OLS estimate of B variance and expected value

A

Bhat = (X’X)-1X’Y

Var(Bhat)= sig2(X’X)-1

E(Bhat)=B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What does OLS estimate, Bhat, do?

A

Minimizes the sum of squared residuals (in matrix form: SSres= [y-yhat]’ [y-yhat])

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

SSres in quadratic form (Y’AY where A is symmetric)

A

Y’[I - X(X’X)-1X’]Y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Global F-test

A

H0: B1=B2=…=Bk=0

Ha: Bj ≠ 0

Test statistic is MSreg / MSres ~ F

Where MSreg = SSreg / k

SSreg = SUM (yhati - ybar)2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Write SSreg in terms of matrix notation

A

SSreg = Y’ [X(X’X)-1X’ - 1(1’1)-11’]Y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Describe a cell means model

A

yij= ui + eij

yij is the jth observation for the ith group

i=1,2,…,t

j=1,2,…,ni

ui is the true mean for the ith group

eij is the error term

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

For a cell means model, define y, M, and u

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the incidence matrix and what is uhat, M’M, (M’M)-1?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Less than Full Rank ANOVA Model (overly paramterized)

A

Where the row length of X is larger than the column length

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Difference between overly parameterized and fully parameterized

A

Overly paramterized models have columns in the X matrix which are linear combinations of the first column (ie not orthogonal)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

For less than full rank anova model, what happens to Bhat?

A

Since Bhat= (X’X)-1X’Y it cannot be estimated because X’X does not have an inverse. But, X’X does have generalized inverses which have to be solved that way

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Consequences of Less than Full rank ANOVA models

A

Generalized inverses are not unique

There are no unique estimates for B

Serious limitations on what we can estimate and test

Usual focus: contrasts (pairwise comparisons, factorial effects)

Things of critical importance: eigenvalues and rank of matrices (provides degrees of freedom)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

If A and B are nxn square matrices then det[AB]=

A

det[A]det[B}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

If A is nxn then det[A]=0 iff

A

A is singular

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

The rank of A is…

A

the greatest number of linearly independent columns (or rows) of A. (Linear dependence implies that at least one column (or row) of A can be written as a linear combination of the other columns (or rows) )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

If A and B are non-singular, then for any matix C

C, AC, CB, ACB

A

all have the same rank

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

If A is an mxn matrix of rank r, then there exist non-singular matrices P and Q such that PAQ is one of the following:

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

The rank of AB cannot

A

exceed the rank of either A or B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

If A is a nxn matrix then det[A]=0 iff

A

the rank of A is less than n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

The matrix of a quadratic form can always

A

be chosen to be symmetric

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

A and B are said to be congruent matrices iff

A

there exists a non-singular matrix, C, such that

B=C’AC

We say C is the congruent transformation of A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Let A be an nxn symmetric matrix of rank r. There exists a non-singular matrix C such that

A

C’AC=D

where D is a diagonal matrix with exactly r non-sero diagonal elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

If A and B are congruent matrices, then

A

they have the same rank

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

Let C be an mxn matrix with rank r then the ranks of C’C and CC’

A

are also r

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

Let A be an nxn matrix. There will always exist

A

n eigenvalues that satisfy

det[A-LI]=0

where L is a diagonal matrix of the n eigenvalues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Let A be an nxn symmetric matrix. The rank of A

A

is the number of non-sero eigenvalues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

Let A be an nxn matrix. A has at least one zero eigenvalue iff

A

A is singular

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

Let A be an nxn matrix. The determinant of A is the

A

product of eigenvalues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

Let A be an nxn matrix and let C be any nxn non-singular matrix then

A, C-1AC, CAC-1

A

all have the same number of eigenvalues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

Let A be an nxn real matrix. A necessary and sufficient condition that there exist a nonzero y that satisfies Ay=ey

A

is that e be an eigenvalue of A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

Let P be an nxn matrix. P is called orthonormal iff

A

P-1=P’ and therefore PP’=P’P=I

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

Let A be an nxn matrix, and let P be an nxn orthonormal matrix, then

A

det[A]=det[P’AP]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

Let x and y be nx1 vectors. x and y are called orthogonal if

A

x’y=0 or y’x=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

Let A be a mxn matrix and B be an nxp matrix. A and B are said to be orthogonal if

A

AB=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
37
Q

Let A be nxn symmetric matrix. There exists an orthonormal matrix P such that

A

P’AP=D where D is a diagonal matrix whose diagonal elements are the eigenvalues of A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
38
Q

Let A be an mxn matrix with rank r>0. There exist matrices AL (mxr with rank r) and AR (rxn with rank r) such that

A

A=ALAR

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
39
Q

Define column and row space

A

Column space of a matrix A is the set of vectors that can be generated as linear combinations of the columns of A.

Row space of a matrix A is the set of vectors that can be generated as linear combinations of the rows of A.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
40
Q

Let A be an nxn matrix. A is called positive semidefinite if

A

a) A=A’ (A is symmetric)
b) y’Ay ≥ 0 for all y
c) There exists at least one y ≠ 0 such that y’Ay=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
41
Q

If A, an nxn matrix, is positive semidefinite then (3 things)

A

1) The rank of A is less than n
2) The eigenvalues of A are greater than or equal to 0
3) If P is an nxn non-singular matrix then P’AP is also positive semidefinite

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
42
Q

Let A be an nxn matrix. A is positive definite if

A

a) A=A’ (A is symmetric)
b) y’Ay > 0 for all y≠0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
43
Q

If A is positive definite then (3 things)

A

1) The rank of A is n
2) All of the eigenvalues of A are greater than 0
3) Let P be an nxn non-singular matrix. P’AP is also positive definite

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
44
Q

A matrix is called non-negative definite if it is

A

either positive definite or positive semidefinite

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
45
Q

Let C be an mxn matrix with rank r. C’C and CC’ are

A

both non-negative definite.

C’C or CC’ are positive definite iff they have full rank

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
46
Q

Let A be an nxn symmetric non-negative definite matrix. There exists some nxn matrix B such that

A

B’B=A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
47
Q

Let A and B be nxn symmetric matrices. If A is positive definite, then there exists a non-singular matrix Q such that Q’AQ= ____ and Q’BQ=____

A

Q’AQ=I and Q’BQ=D where D is a diagonal matrix whose diagonal elements are the roots of det[B-lambdaA]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
48
Q

If A and B are both non-negative definite, then there exists a matrix Q such that both Q’AQ and Q’BQ are

A

diagonal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
49
Q

Let A be a nxn non-singular matrix partitioned into

A=[A11 A12

A21 A22]

where both A11 and A22 are square and non-singular and let A-1=C

What is C?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
50
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
51
Q

Let A be an nxnx matrix. We call A idempotent if

A

AA=A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
52
Q

If A is an nxn idempotent matrix with rank n, then A=

A

I

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
53
Q

If A is an nxn idempotent matrix of rank less than n, then A is

A

positive semidefinite

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
54
Q

If A is an idempotent matrix with rank r, then it has

A

r non-zero eigenvalues, each equal to 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
55
Q

Let A be an nxn (symmetric) idempotent matrix then

a) A’ is
b) Let P be an orthonormal matrix. P’AP is
c) Let P be an nxn non-singular matrix. PAP-1 is
d) I-A is

A

a) (symmetric) idempotent matrix
b) (symmetric) idempotent matrix.
c) idempotent
d) (symmetric) idempotent matrix

56
Q

The trace of an nxn matrix A is the

A

sum of the diagonal elements

57
Q

Let A be an mxn matrix and let B be an nxm matrix.

trace[AB]=

A

trace[BA]

58
Q

If A, B, C are conformable, then

trace[ABC]=

A

trace[CAB] = trace[BAC] = trace[BCA] = trace[CBA] = trace[ACB]

59
Q

Let A be an nxn matrix and let P be a non-singular nxn matrix.

trace[A] =

if P is orthonormal then

trace[A]

A

trace[P-1AP]

trace[P’AP]

60
Q

Let A be an nxn matrix with eigenvalues lam1, lam2, lam3, … , lamn

trace[A] =

A

SUM lami

61
Q

Let A and B be nxn matrices and let a and b be scalars.

trace[aA+bB] =

A

a trace[A] + b trace[B]

62
Q

Let A be an nxn matrix what does this say about the trace?

A

trace[A’] = trace[A]

63
Q

Show the general form to obtain a symmetric matrix

A
64
Q

A Moore-Penrose Inverse A+ for an mxn matrix A satisfies the following 4 conditions

A

1) AA+ is symmetric
2) A+A is symmetric
3) AA+A=A
4) A+AA+=A+

65
Q

Let X be an nxp matrix with rank p. Then X+=

A

(X’X)-1X’

66
Q

Let A be an mxn matrix. Then every matrix A has a Moore-Penrose inverse, and ______

A

it is unique

67
Q

(A’)+=

A

(A+)’

68
Q

The Moore-Penrose inverse of A+ is

A

A

69
Q

If the rank of A is r, then each of the following matrices also has rank r (in terms of Moore-Penroses)

A

A+

AA+

A+A

70
Q

If A is non-singular, then A+=

A

A-1

71
Q

If A is symmetric idempotent, then A+=

A

A

72
Q

The matrices AA+, A+A, I-AA+, I-A+A are all

A

symmetric idempotent

73
Q

For any matrix A, (A’A)+=

A

A+(A’)+

74
Q

Let P be an mxm orthonormal matrix. Let Q be an nxn orthonormal matrix, and let A be any mxn matrix. Then (PAQ)+=

A

Q’A+P’

75
Q

Let X=[X1 X2]

Then XX+X1=

A

X1

76
Q

Let A be an mxn matrix. A- is called a generalized inverse of A if

A

AA-A=A

Note, the Moore-Penrose inverse is also a generalized inverse

77
Q

Let X be an mxn matrix with rank r > 0. The following conditions hold for the generalized inverse

A
78
Q

What can be said about X(X’X)-X’

A

It is invariant to the choice of generalized inverse

79
Q

X(X’X)-X’=

A

XX+

80
Q

The following conditions hold for K=X(X’X)-X’

A
81
Q

If A is an nxn non-singular matrix, then the system Ax=y

A

has a unique solution

82
Q

The system Ax=y has a solution iff (2 answers)

A

y is in the column space of A

AA-y=y

83
Q

Let A be an mxn matrix. The system Ax=0 has a solution other than x=0 iff

A

the rank of A < n

84
Q

Let a and x be nx1 vectors. What are the derivatives with respect to x of

a’x, x’a, and x’x

A

a, a, and 2x

85
Q

Let A be an mxn matrix of constants and let x be an nx1 vector. Then the derivative of Ax with respect to x is

A

A

86
Q

What is the derivative with respect to x of x’Ax?

A

2Ax

87
Q

What is a stationary point, x0?

A

x0 is a solution to df(x)/dx = 0

Could be a min response, max response, or a saddle point

88
Q

What is the Hessian matrix and what information does it provide?

A

It is a matrix of second derivatives. It describes the funciton in the neighborhood of the stationary point.

89
Q

Conditions for Ordinary Least Squares estimation of B

A
90
Q

How to decompose variance-covariance matrix (where it is known that the matrix is symmetric)

A
91
Q

What does the generalized least squares estimate of B do?

A
92
Q

What is the GLS estimate of B?

A
93
Q

What is var(a’y) and var(Ay)?

A
94
Q

What is E[y’Ay]?

A
95
Q
A
96
Q

What are possible approaches toward minimizing the variance matrix of Bhat? (sig2(X’X)-1)

A

1) min |sig2(X’X)-1| which minimizes the volume of the confidence ellipsoid of the estimated coefficients
2) min tr[sig2(X’X)-1] which would minimize the sum of the variances of the estimated coefficients

Both put an emphasis on eigenvalues

97
Q

Steps to show that an estimator is the best, linear, unbiased estimator

A
98
Q

Describe the density function for y, a px1 vector from the multivariate normal distribution

A
99
Q

If z is a nx1 univariate standard normal random variable then what can be said about z’z?

A

It is distributed chi-squared with n degrees of freedom

100
Q

What is the non-centrality parameter?

A
101
Q

Three things to consider if trying to show y’Ay follows a chi-squared and how to define non-centrality parameter

A
102
Q
A
103
Q

What test statistic should be used if Σ is known?

What test statistic should be used if σ2 is unknown but V is known, where σ2V=Σ?

A

Chi-squared

F-distribution

104
Q
A
105
Q

The classic ANOVA table

A

Source df MS E[MS] F lambda

106
Q
A
107
Q

Xc‘1=

var(e)=

Σ=

Σ-1=

A
108
Q

Define the cell means model

A
109
Q

Global F-test for cell means model

A
110
Q

ANOVA for cell means global F-test

A
111
Q

When using a contrast C for multiple comparison testing, what does the rank of C control?

A

The type I error rate for the set of comparisons

112
Q

Describe an identifiable parameter

A
113
Q

Describe an estimable funciton

A
114
Q
A
115
Q
A
116
Q

Let A be an mxn matrix. The system Ax=0 has a solution other than x=0 iff

A

the rank of A<n>
</n>

117
Q

Results of this

A
118
Q

All contrasts are _____

A

estimable functions

119
Q

What are the differences between pairwise comparisons for the cell means model and the effects model?

A
120
Q

For the generalized inverse case, test statistic given L’Bhat for an effects model

A

Where whatever is being tested is in the row space of X (L’=AX)

121
Q

Reasons the effects model is not very valuable from an analysis perspective

A

Resquires constraintes to be identifiable

Constraints ultimately must be linear combinations of the predicted values

Analysis must focus on estimable functions (contrasts are always estimable functions)

However, the effects model does generalize very nicely

122
Q

RBD Model and X matrix

A

X=[1 T M]

123
Q

Sets of Contrasts for RBD (to test treatments and blocks)

A
124
Q

Way to make orthogonality for X’X RBD

A
125
Q

ANOVA table for RBD.

Is there an appropriate test for fixed block effects?

A
126
Q

RCB model where interaction is important

A
127
Q

AB interaction contrasts for RBD interaction model

A
128
Q

Creating orthogonality for RBD interaction model

A
129
Q

ANOVA for RBD interaction model

A
130
Q

Interaction effect for RBD model and significance in relation to contrasts

A

If AB is significant, contrasts must focus on the comparing cell means

If AB is not significant, then contrasts would focus on the marginal means

131
Q

Model for one way random effects and variance of Y

A
132
Q

Main thing to test for random effects model

A
133
Q

ANOVA for one way random effects model

A
134
Q

For two way random effects model define distributions for A, B, AB

A
135
Q

ANOVA two way random effects model

A
136
Q

Distribution for SS of A, B, AB for mixed model

A
137
Q

ANOVA mixed model

A