University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > GP-BUCB for Spinal Cord Injury Therapy: Batch Active Learning with Applications

  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

GP-BUCB for Spinal Cord Injury Therapy: Batch Active Learning with Applications

Download to your calendar using vCal

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

Can one parallelize complex exploration—exploitation tradeoffs? As an example, consider the problem of optimal high-throughput experimental design, where we wish to sequentially design batches of experiments in order to simultaneously learn a surrogate function mapping stimulus to response and identify the maximum of the function. We formalize the task as a multi-armed bandit problem, where the unknown payoff function is sampled from a Gaussian process (GP), and instead of a single arm, in each round we pull a batch of several arms in parallel. We develop GP-BUCB, a principled algorithm for choosing batches, based on the GP-UCB algorithm for sequential GP optimization. We prove a surprising result; as compared to the sequential approach, the cumulative regret of the parallel algorithm only increases by a constant factor independent of the batch size B. Our results provide rigorous theoretical support for exploiting parallelism in Bayesian global optimization. We demonstrate the effectiveness of our approach on two real-world applications.

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

NanoScience Seminar CJBS Events Academic Freedoms Research Network

Other talks

Title to be confirmed Title to be confirmed Fairy Tales Shape modes of CP^1 vortices Human monogamy in mammalian context Using numerical simulations for solving spectral geometry problems
 

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