University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Unsupervised Representation Learning

  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

Unsupervised Representation Learning

Download to your calendar using vCal

If you have a question about this talk, please contact Konstantina Palla .

Being able to learn ‘good’ representations of data is, arguably, 90% of the hard work for machine learning tasks. We currently have an abundance of unlabelled data, with more being created every day. It is therefore imperative that we can design and train representation learning algorithms in an unsupervised setting.

In this tutorial style talk, we explore probabilistic and non- probabilistic approaches including Principal Component Analysis, Restricted Boltzman Machines and Autoencoders. We will also discuss the benefits of deep architectures, and how to go about training them.

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

Average on weekdays: 8923.26764706 kWh Webinar & LT2, Computer Laboratory, William Gates Building. Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

From Physics-informed Neural Networks to Numerically Verified Proofs in Geometric Analysis Precarity and the economy of makeshifts: A novel argument from the census of England, 1851-1911 Using A Function-Centric Lens to Re-consider Regularisation, Representation Transfer and Geometric Properties of Neural Networks FILM: One With The Whale Sheref Mansy, topic TBA Tea and Coffee Break
 

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