YoVDO

Bandits - Kevin Jamieson - University of Washington

Offered By: Paul G. Allen School via YouTube

Tags

Machine Learning Courses Algorithm Design Courses Central Limit Theorem Courses Drug Discovery Courses Bandit Algorithms Courses Thompson Sampling Courses

Course Description

Overview

Explore the fundamentals of bandit algorithms in this comprehensive lecture from the University of Washington. Delve into the future of machine learning and discover how bandit algorithms are applied in various real-world scenarios, including drug development, Google Maps optimization, and content recommendation systems. Learn about stochastic models, Thompson sampling, and regret minimization techniques. Gain insights into key concepts such as sublinear regret, sub-Gaussian distributions, and the Central Limit Theorem. Enhance your understanding of this crucial area of machine learning and its practical applications in decision-making processes.

Syllabus

Introduction
The Future of Machine Learning
Bandits
Drug Makers
Google Maps
Content Recommendation
Stochastic Model
Thompson
Regret minimization
Regret
Sublinear Regret
Sub Gaussian
Central Limit Theorem


Taught by

Paul G. Allen School

Related Courses

Natural Language Processing
Columbia University via Coursera
Intro to Algorithms
Udacity
Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX