University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Generalisation in neural networks

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Generalisation in neural networks

Download to your calendar using vCal

If you have a question about this talk, please contact Robert Pinsler .

It is not very well understood at the moment why large neural networks with more parameters than training data generalise well from training data to test data. This talk explores the main hurdles and potential future avenues to improve our understanding of these models. In particular, we are going to look at a few approaches from Statistical Learning Theory to prove generalisation properties of neural networks. First, we examine a more traditional approach to that bounds the capacity of learning models (VC dimension) followed by a review of the more recent approaches that utilise information theory to prove generalisation.

This talk is part of the Machine Learning Reading Group @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge University Friends of MSF Cavendish Edwards room Donald McIntyre Building, Faculty of Education, 184 Hills Road, room 2S8

Other talks

Title to be confirmed: CMS Title to be confirmed Studying viruses to understand what makes pandemic viruses special and how innate immunity works The spread of environmental cost-benefit analysis in UK government, c.1966-1995: representing the public in the Anthropocene Directing Disturbance: Three Theatremakers in Discussion Morning Break
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity