New answers tagged

1

The following answer is based on chapter 6/7 of the book ┬╗Understanding Machine Learning: From Theory to Algorithms┬ź, by Shalev-Shwartz and Ben-David (especially Example 7.1). It states that the class $\mathcal{H}$ of all polynomial classifiers over $\mathbb{R}$ is not PAC learnable ($\mathrm{VCdim}(\mathcal{H}) = \infty$). We might rewrite $\mathcal{H}$ as ...


Top 50 recent answers are included