University of Cambridge > > Isaac Newton Institute Seminar Series > Bandit Optimisation with Large Strategy Sets: Theory and Applications

Bandit Optimisation with Large Strategy Sets: Theory and Applications

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity