Oracle PAC
1. Learning unions of intervals. Give a PAC-learning algorithm for the
concept class C3 formed by unions of three closed intervals, that is
[a, b] ∪ [c, d] ∪ [e, f], with a, b, c, d, e, f ∈ R. You should carefully describe and justify your algorithm. Extend your result to derive a PAClearning algorithm for the concept class Cp formed by unions of p ≥ 1
closed intervals, thus [a1, b1] ∪ · · · ∪ [ap, bp], with ak, bk ∈ R for k ∈ [p].
What are the time and sample complexities of your algorithm as a
function of p?
DETAILED ASSIGNMENT
