Homepage Solution manuals Kevin P. Murphy Machine Learning: a Probabilistic Perspective Exercise 4.15 - Sequential(recursive) updating of covariance matrix

Exercise 4.15 - Sequential(recursive) updating of covariance matrix

Answers

For question (a), note that:

n 𝐂 n + 1 ( n 1 ) 𝐂 n = i = 1 n + 1 ( 𝐱 i 𝐦 n + 1 ) ( 𝐱 i 𝐦 n + 1 ) T i = 1 n ( 𝐱 i 𝐦 n ) ( 𝐱 i 𝐦 n ) T .

Making use of:

𝐦 n + 1 = n 𝐦 n + 𝐱 n + 1 n + 1 ,

we have:

n 𝐂 n + 1 ( n 1 ) 𝐂 n = 𝐱 n + 1 𝐱 n + 1 T ( n + 1 ) 𝐦 n + 1 𝐦 n + 1 T + n 𝐦 n 𝐦 n T = n n + 1 ( 𝐱 n + 1 𝐦 n ) ( 𝐱 n + 1 𝐦 n ) T .

For question (b), the complexity is 𝒪 ( d 2 ) .

For question (c), plugging (4.281) directly into (4.279) yields (4.280).

For question (d), the complexity remains 𝒪 ( d 2 ) .

User profile picture
2021-03-24 13:42
Comments