Transcription of Ryan M. Rifkin - mit.edu
{{id}} {{{paragraph}}}
Regularized Least Squares Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007. R. Rifkin Regularized Least Squares Basics: Data Data points S = {(X1 , Y1 ), .. , (Xn , Yn )}. We let X simultaneously refer to the set {X1 , .. , Xn } and to the n by d matrix whose ith row is Xit . R. Rifkin Regularized Least Squares Basics: RKHS, Kernel RKHS H with a positive semidefinite kernel function k : linear: k (Xi , Xj ) = Xit Xj polynomial: k (Xi , Xj ) = (Xit Xj + 1)d ! ||Xi Xj ||2.
Summary So Far If we can (directly) solve one RLS problem on our data, we can find a good value of λ using LOO optimization at essentially the same cost.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}