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

https://mediaspace.epfl.ch/media/0_o819t86u

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Analysis of algorithms

Computer engineering

Computer security: Pseudorandomness

Statistics

Data collection: Experiment

Related lectures (47)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.