Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Risk Minimization from Adaptively Collected Data

Description

This lecture covers risk minimization from adaptively collected data with guarantees for policy learning, focusing on adaptive experiments, sequential observations, and the importance of exploration strategies. The instructor discusses the key concepts, such as E-greedy exploration, martingale difference sequence, and the theoretical foundations behind policy learning.

Official source

Related concepts (24)

Reinforcement learning

Reinforcement learning (RL) is an area of machine learning concerned with how intelligent agents ought to take actions in an environment in order to maximize the notion of cumulative reward. Reinforcement learning is one of three basic machine learning paradigms, alongside supervised learning and unsupervised learning. Reinforcement learning differs from supervised learning in not needing labelled input/output pairs to be presented, and in not needing sub-optimal actions to be explicitly corrected.

Sequential analysis

In statistics, sequential analysis or sequential hypothesis testing is statistical analysis where the sample size is not fixed in advance. Instead data are evaluated as they are collected, and further sampling is stopped in accordance with a pre-defined stopping rule as soon as significant results are observed. Thus a conclusion may sometimes be reached at a much earlier stage than would be possible with more classical hypothesis testing or estimation, at consequently lower financial and/or human cost.

Q-learning

Q-learning is a model-free reinforcement learning algorithm to learn the value of an action in a particular state. It does not require a model of the environment (hence "model-free"), and it can handle problems with stochastic transitions and rewards without requiring adaptations. For any finite Markov decision process (FMDP), Q-learning finds an optimal policy in the sense of maximizing the expected value of the total reward over any and all successive steps, starting from the current state.

Temporal difference learning

Temporal difference (TD) learning refers to a class of model-free reinforcement learning methods which learn by bootstrapping from the current estimate of the value function. These methods sample from the environment, like Monte Carlo methods, and perform updates based on current estimates, like dynamic programming methods. While Monte Carlo methods only adjust their estimates once the final outcome is known, TD methods adjust predictions to match later, more accurate, predictions about the future before the final outcome is known.

CUSUM

In statistical quality control, the CUsUM (or cumulative sum control chart) is a sequential analysis technique developed by E. S. Page of the University of Cambridge. It is typically used for monitoring change detection. CUSUM was announced in Biometrika, in 1954, a few years after the publication of Wald's sequential probability ratio test (SPRT). E. S. Page referred to a "quality number" , by which he meant a parameter of the probability distribution; for example, the mean.

Related lectures (29)

Reinforcement Learning: Q-Learning

Covers Q-Learning in reinforcement learning, exploring action values, policies, and the societal impact of algorithms.

Reinforcement Learning: TD Learning and SARSA Variants

Discusses reinforcement learning, focusing on temporal difference learning and SARSA algorithm variations.

TD Learning: Temporal Difference Learning

Covers Temporal Difference Learning, V-values, state-values, and TD methods in reinforcement learning.

Reinforcement Learning: SARSA Algorithm

Explores the SARSA algorithm for reinforcement learning, focusing on updating Q-values and the importance of exploration in learning by rewards.

Reinforcement Learning: Reward-based Learning