University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Spectral 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

Spectral Learning

Download to your calendar using vCal

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

Over the past few years, “spectral methods” have been applied with great success to parameter estimation in latent variable models. For this talk, we will explain how spectral methods work in two models of wide interest: hidden Markov models (HMMs) and latent-variable probabilistic context-free grammars (LPCFGs). In the process, we will see that these methods rely only on linear and multilinear algebra, making them highly efficient. We will then go on to discuss what is perhaps their most significant edge: consistency guarantees that are conspicuously absent from classical estimation techniques like EM (though we will see that the story is more complicated than one might think). Finally, we will introduce the unified theoretical perspective on these algorithms that has recently emerged.

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

Old Kitchens, Trinity College Electrical Engineering SS03, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Dr Dinis Calado, Senior Group Leader, Immunity and Cancer Laboratory, the Francis Crick Institute Talk title TBC title abstract tbc Teams Announced Paediatric Medicine and Rheumatology Content, Caching and Kubernetes: Performance and User Experience in the Browser
 

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