« first day (2871 days earlier)      last day (1548 days later) » 

11:24 AM
Maybe someone here will be interested in the following question.
1
Q: Convert a PAC-learning algorithm into another one which requires no knowledge of the parameter

j200932This is part of the exercise 2.13 in the book Foundations of Machine Learning (page 28). You can refer to chapter 2 for the notations. Consider a family of concept classes $\left\{\mathcal{C}_{s}\right\}_{s}$ where $\mathcal{C}_{s}$ is the set of concepts in $\mathcal{C}$ with size at most $s...

 
11:40 AM
Here's another question.
1
Q: How can we prove this inequality, related to the generalization error, without using the Rademacher complexity?

j200932This is an inequality on page 36 of the book Foundations of Machine Learning, but the author only states it without proof. $$ \mathbb{P}\left[\left|R(h)-\widehat{R}_{S}(h)\right|>\epsilon\right] \leq 4 \Pi_{\mathcal{H}}(2 m) \exp \left(-\frac{m \epsilon^{2}}{8}\right) $$ Here the growth function...

 

« first day (2871 days earlier)      last day (1548 days later) »