University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Bandit Optimisation with Large Strategy Sets: Theory and 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

Bandit Optimisation with Large Strategy Sets: Theory and Applications

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Stochastic Processes in Communication Sciences

In this talk, we report recent results on bandit optimisation problems with large strategy (or decision) sets. These problems naturally arise in many contemporary applications found in communication networks, e-commerce, and recommendation systems. We address both stochastic or adversarial settings, depending on the way rewards obtained under various strategies are generated. We provide lower bounds on regret, which provide fundamental performance limits that any online algorithm cannot beat, and develop algorithms that approach these limits. Results are applied to resource allocation in wireless networks, and recommendation systems.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Hybrid: in-person in Cambridge & streaming online, via YouTube Webinar & LT2, Computer Laboratory, William Gates Building. BioAnth Lecture Theatre (Room 41), Division of Biological Anthropology, Pembroke Street, Cambridge, CB2 3QG

Other talks

Differences between Robin and Neumann eigenvalues Title to be confirmed: CMS TBC From Plate to Brain: Global Diet, Cognitive Function and Neuroimaging in Diverse Populations Title to be confirmed Title to be confirmed
 

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