MATH 414 Lecture 4

From Notes
Jump to navigation Jump to search

« previous | Wednesday, January 22, 2014 | next »


Least Squares

Given time t, we can measure samples of a function y(t) as points yk for k=1,2,.

Suppose we want to find a linear regression y=at+b for parameters a and b that minimizes the following sum of squares:

k=0n1(yk(ak+b))2

Case

Let us define y=at+b1, where t=0,1,2,,n1 and 1=1,1,,1.

Then k=0n1(yn(ak+b))=(yDy)T(yDy)=yDy2, where yD is our vector of samples.


Let W:=Span{1,t} be a vector space of all possible regressions for y. For some unit vector w^W, we can find a vector tw^ such that tw^=yy0.

Therefore we can find a minimum value for t in yD(y0+tw^)2:

yD(y0+tw^)=yD(y0+tw^),yD(y0+tw^)==t22tyDy0,w^

We find the minimum of this function at t=0, so we find that yDy0,w^=0 and furthermore yDy0,y=0 for all yW.


Punchline

Theorem. Let V be an inner product space and let WV be a subspace of V. Also, let v be any vector in V. Then, w0 minimizes vw over all wW if and only if vw0W.

Proof. Follows mutatis mutandis [1] from the special case illustrated above.

quod erat demonstrandum


Finding w0

How do we find w0 (or in the special case y0)?

w0 is the orthogonal projection of v onto the vector space W.

Let {e^1,e^2,,e^n} be an orthonormal basis for W. Then

projW(v)=k=1nv,e^ke^k


Footnotes

  1. mutatis mutandis = "change for change"