Question: b) Give a PAC-learning algorithm for the class H consisting of the set of axis-aligned- dimensional rectangles in R, that is H = {[a1, b1]

b) Give a PAC-learning algorithm for the class H consisting of the set of axis-aligned- dimensional rectangles in R, that is H = {[a1, b1] x x[an, ba]: ai, b & IR}. Prove that your algorithm satisfies the PAC conditions. How does the sample complexity vary as a function of n? [10 marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
