Collaborative Top Distribution Identifications with Limited Interaction
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 25-minute IEEE conference talk on collaborative learning strategies for Multi-Armed Bandits (MAB) problems, focusing on top-m distribution identifications with limited interaction. Delve into the intricacies of the Top-m problem in MAB, examining the collaborative learning approach and its algorithm. Understand the key differences between Top-1 and Top-m scenarios, and learn about the reduction technique and error amplification in this context. Presented by Nikolai Karpov, Qin Zhang, and Yuan Zhou from Indiana University at Bloomington and the University of Illinois at Urbana-Champaign, this talk provides valuable insights into advanced MAB problem-solving techniques.
Syllabus
Intro
Top-m problem in Multi-Armed Bandits (MAB)
Collaborative Learning for MAB
Algorithm
Difference between Top-1 and Top-m Top-m
Reduction
Error amplification
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Inside TensorFlow - TF-AgentsTensorFlow via YouTube Provably Efficient Reinforcement Learning with Linear Function Approximation - Chi Jin
Institute for Advanced Study via YouTube Exploration with Limited Memory - Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
Association for Computing Machinery (ACM) via YouTube How Slot Machines Are Advancing the State of the Art in Computer Go AI
Churchill CompSci Talks via YouTube CS885: Multi-Armed Bandits
Pascal Poupart via YouTube