Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Algorithms to Live By: Optimal Stopping and Logarithmic Regret
Description
This lecture covers the concept of optimal stopping, explore/exploit trade-offs, sorting, caching, scheduling, Bayes' Rule, overfitting, randomness, networking, game theory, and computational kindness. It also delves into the logarithmic regret in bandit solutions, providing insights into randomized clinical trials, ethical considerations, and near-optimal strategies for treatment outcomes.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.