Question: ( 2 ' ) Review lecture slides to get familiar with denotations of empirical risk function hat ( R ) , pop - ulation risk

(2') Review lecture slides to get familiar with denotations of empirical risk function hat(R), pop-
ulation risk function R, Bayes optimal hypothesis h_(Bayes ), in-class optimal hypothesis h^(*), and
Empirical-Risk-Minimizer (ERM) hypothesis h_(ERM ). Let hat(h) be your hypothesis, and the risk
decomposition provides us with an excellent tool to analyze the performance of hat(h).
Here is the simple proof of upper bound of E[R(hat(h))]-R(h_(Bayes )) :
E[R(hat(h))]-R(h_(Bayes))
=E[R(hat(h))]-E[hat(R)(hat(h))]+E[hat(R)(hat(h))]-E[(hat(R))(h_(ERM))]+E[(hat(R))(h_(ERM))]-E[(hat(R))(h^(*))]+E[(hat(R))(h^(*))]-R(h_(Bayes ))
=E[R(hat(h))-hat(R)(hat(h))]+E[(hat(R))((hat(h)))-(hat(R))(h_(ERM))]+E[(hat(R))(h_(ERM))-(hat(R))(h^(*))]+E[(hat(R))(h^(*))]-R(h_(Bayes ))
=E[R(hat(h))-hat(R)(hat(h))]+E[(hat(R))((hat(h)))-(hat(R))(h_(ERM))]+E[(hat(R))(h_(ERM))-(hat(R))(h^(*))]+R(h^(*))-R(h_(Bayes ))
=ubrace(E[R((hat(h)))-(hat(R))((hat(h)))]ubrace)_(generalization error )+ubrace(E[(hat(R))((hat(h)))-(hat(R))(h_(ERM))]ubrace)_(optimization error )+ubrace(R(h^(*))-R(h_(Bayes ))ubrace)_(approximation error ).
(a)(0.5^(')) Prove that E[(hat(R))(h^(*))]=R(h^(*)).
(b)(0.5') Why can we drop E[(hat(R))(h_(ERM))-(hat(R))(h^(*))] to make last line be an upper bound of the
previous term?
(c)(1') Approximation error describes the ability of your hypothesis class H approximating
the Bayes optimal hypothesis h_(Bayes ). Consider a regression problem on curve fitting.
Suppose the data points are generated by a quadratic function and your hypothesis
class is the quadratic function class, what's the approximation error in this case? What
happens to approximation error if you change your hypothesis class to be the linear
function class?
( 2 ' ) Review lecture slides to get familiar

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!