![]() |
#1
|
|||
|
|||
![]() |
#2
|
||||
|
||||
![]() Quote:
![]()
__________________
Where everyone thinks alike, no one thinks very much |
#3
|
|||
|
|||
![]() |
#4
|
||||
|
||||
![]() Quote:
![]() ![]() ![]() ![]() ![]()
__________________
Where everyone thinks alike, no one thinks very much |
#5
|
|||
|
|||
![]() |
#6
|
||||
|
||||
![]()
__________________
Where everyone thinks alike, no one thinks very much |
#7
|
|||
|
|||
![]()
I am confused. Are we supposed to rederive the result of Slide 11?
|
#8
|
||||
|
||||
![]()
No rederivation needed. You can always use the results given in the lectures.
__________________
Where everyone thinks alike, no one thinks very much |
#9
|
|||
|
|||
![]()
My answers for any value of K are order(s) of magnitude higher that the options.
w_reg = (Z^\top Z + λI)^-1 Z^T y As a Python noob, perhaps someone can confirm that I need the linalg.inv of the first term in parentheses, because we cannot use the pinv method when the weight term is present. thanks. Last edited by Kekeli; 05-13-2013 at 06:04 AM. Reason: Realized the upper bound isn't the issue |
#10
|
|||
|
|||
![]()
Kekeli:
I don't know about Python, but in R I was using the "chol2inv" function of the "Matrix" library to find the matrix inverse. It turns out this wasn't the right tool for the job. I ended up using "solve" from the base package to find the inverse. So in R, I used the following functions: |
![]() |
Thread Tools | |
Display Modes | |
|
|