机器学习与数据科学博士生系列论坛（第八十期）—— Bandit with Knapsacks
报告人： 孙谌劼（北京大学）
时间：2024-11-28 16:00-17:00
地点：腾讯会议 568-7810-5726
Abstract:
Multi-armed bandit problems are the predominant theoretical model of exploration-exploitation tradeoffs in learning. A new variant of this model, called bandits with knapsacks, combines bandit learning with aspects of stochastic integer programming. In this model, the learner is constrained by budget limits, in addition to the customary limitation on the time horizon, which is more applicable to real-world scenarios.
In this talk, I will introduce the setup of the model, and existing algorithms that approach the theoretical optimum in both stochastic and adversarial settings. The discussion is based on the works of Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins (JACM 2018), as well as Immorlica et al. (JACM 2022).
About the Speaker:
论坛每次邀请一位博士生就某个前沿课题做较为系统深入的介绍，主题包括但不限于机器学习、高维统计学、运筹优化和理论计算机科学。
Your participation is warmly welcomed!
欢迎扫码关注北大统计科学中心公众号，了解更多讲座信息!
