| |
Dec 15, 2025
|
|
|
|
|
EECS 211: Bandit Algorithms
Units: 4
Seeks to address the exploration-vs-exploitation dilemma, where one can decide between exploring new options for potentially better rewards and sticking with the best ones she has found. Due to the universal presence of the dilemma, bandit algorithms have various applications, such as online advertising, recommendation systems, auctions, etc. Covers fundamental algorithms in various settings, including stochastic, adversarial, and contextual settings.
Course Details
Repeats Allowed for Credit: 0
Laboratory included
Normal Letter Grade only
Requisites and Restrictions
Instructor Permission Required: No
Students are expected to have basic knowledge of algorithms, programming, and probability and statistics
View course scheduling information
Add to My Catalog (opens a new window)
|
|
