ملف الباحث
Tim van Erven
ورقة واحدة في مجموعة PaperMetrix
المنشورات
أوراق هذا المؤلف
-
Generalization Guarantees via Algorithm-dependent Rademacher Complexity
2023 · arXiv (Cornell University)
Algorithm- and data-dependent generalization bounds are required to explain the generalization behavior of modern machine learning algorithms. In this context, there exists information theoretic generalization bounds that involve (various forms of) mutual information, as well …