University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Bayesian optimization / Gaussian Process Bandits

  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

Bayesian optimization / Gaussian Process Bandits

Download to your calendar using vCal

If you have a question about this talk, please contact Elre Oldewage .

Sequential optimization is one of the fastest growing areas of machine learning. In this presentation we deep dive into sequential optimization based on Gaussian process models (aka Bayesian optimization). We will take a look at the analysis of popular algorithms such as UCB and Thompson sampling and wrap up with an overview of recent results and open problems.

Recommended reading:

Srinivas et al. 2010 (https://arxiv.org/abs/0912.3995), recipient of ICML 2020 Test of Time award Chowdhury and Gopalan 2017 (https://arxiv.org/abs/1704.00445) Vakili et al. 2020 (https://arxiv.org/abs/2009.06966) Wilson et al. 2020 (https://arxiv.org/abs/2002.09309)

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

MRC Cognition & Brain Sciences Unit, 15 Chaucer Road, Cambridge CB2 7EF Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ, DMB, Room 1S7 Average on weekdays: 8922.55697446 kWh

Other talks

The Neurophenomenology of Surrender: Agency, Renewal, and Social Engagement in Speaking in Tongues Neutrality and The Atoll Verified Hypervisor Title tbc Shape modes of CP^1 vortices Title to be confirmed Am I a Member? Auditing Private Machine Learning
 

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