Sökning: "PAC-Bayes"
Hittade 3 avhandlingar innehållade ordet PAC-Bayes.
1. Towards practical and provable domain adaptation
Sammanfattning : One of the most central questions in statistical modeling is how well a model will generalize. Absent strong assumptions we find that this question is difficult to answer in a meaningful way. In this work we seek to increase our understanding of the domain adaptation setting through two different lenses. LÄS MER
2. Guaranteeing Generalization via Measures of Information
Sammanfattning : During the past decade, machine learning techniques have achieved impressive results in a number of domains. Many of the success stories have made use of deep neural networks, a class of functions that boasts high complexity. Classical results that mathematically guarantee that a learning algorithm generalizes, i.e. LÄS MER
3. Information-Theoretic Generalization Bounds: Tightness and Expressiveness
Sammanfattning : Machine learning has achieved impressive feats in numerous domains, largely driven by the emergence of deep neural networks. Due to the high complexity of these models, classical bounds on the generalization error---that is, the difference between training and test performance---fail to explain this success. LÄS MER