non stationary reinforcement learning
play

Non-Stationary Reinforcement Learning Ruihao Zhu MIT IDSS Joint - PowerPoint PPT Presentation

Sep 26, 2022 •447 likes •1.01k views

Non-Stationary Reinforcement Learning Ruihao Zhu MIT IDSS Joint work with Wang Chi Cheung (NUS) and David Simchi-Levi (MIT) 1 / 18 Epidemic Control A DM iteratively: 1. Pick a measure to contain the virus. 2. See the corresponding outcome.

  1. Non-Stationary Reinforcement Learning Ruihao Zhu MIT IDSS Joint work with Wang Chi Cheung (NUS) and David Simchi-Levi (MIT) 1 / 18

  2. Epidemic Control A DM iteratively: 1. Pick a measure to contain the virus. 2. See the corresponding outcome. Goal : Minimize the total infected cases. 2 / 18

  3. Epidemic Control A DM iteratively: 1. Pick a measure to contain the virus. 2. See the corresponding outcome. Goal : Minimize the total infected cases. Challenges: ◮ Uncertainty: effectiveness of each measure is unknown. ◮ Bandit feedback: no feedback for un-chosen measures. ◮ Non-stationarity: virus might mutate throughout. 2 / 18

  4. Epidemic Control The DM’s action could have long-term impact . ◮ Quarantine lockdown stem the spread of virus to elsewhere, but also delayed key supplies from getting in. 3 / 18

  5. Model Model epidemic control by a Markov decision process (MDP) (Nowzari et al. 15, Kiss et al. 17) . For each time step t = 1 , . . . , T , ◮ Observe the current state s t = { 1 , 2 } , and receive a reward. For example r (1) = 1 and r (2) = 0 . ◮ Pick an action a t ∈ { B , G } , and transition to the next state s t +1 ∼ p t ( ·| s t , a t ) (unknown). 4 / 18

  6. Model Model epidemic control by a Markov decision process (MDP) (Nowzari et al. 15, Kiss et al. 17) . For each time step t = 1 , . . . , T , ◮ Observe the current state s t = { 1 , 2 } , and receive a reward. For example r (1) = 1 and r (2) = 0 . ◮ Pick an action a t ∈ { B , G } , and transition to the next state s t +1 ∼ p t ( ·| s t , a t ) (unknown). 4 / 18

  7. Model Model epidemic control by a Markov decision process (MDP) (Nowzari et al. 15, Kiss et al. 17) . For each time step t = 1 , . . . , T , ◮ Observe the current state s t = { 1 , 2 } , and receive a reward. For example r (1) = 1 and r (2) = 0 . ◮ Pick an action a t ∈ { B , G } , and transition to the next state s t +1 ∼ p t ( ·| s t , a t ) (unknown). 4 / 18

  8. Model cont’d ◮ Task: Design a reward-maximizing policy π. For every time step t : π t : { 1 , 2 } → { B , G } ◮ Dynamic regret (Besbes et al. 15) :   �� T � � T  − E dym-reg T = E t =1 r ( s t ( π ∗ )) t =1 r ( s t ( π )) . ���� knows p t ’s ◮ Variation budget: � p 1 − p 2 � + � p 2 − p 3 � + . . . + � p T − 1 − p T � ≤ B p . 5 / 18

  9. Model cont’d ◮ Task: Design a reward-maximizing policy π. For every time step t : π t : { 1 , 2 } → { B , G } ◮ Dynamic regret (Besbes et al. 15) :   �� T � � T  − E dym-reg T = E t =1 r ( s t ( π ∗ )) t =1 r ( s t ( π )) . ���� knows p t ’s ◮ Variation budget: � p 1 − p 2 � + � p 2 − p 3 � + . . . + � p T − 1 − p T � ≤ B p . 5 / 18

  10. Model cont’d ◮ Task: Design a reward-maximizing policy π. For every time step t : π t : { 1 , 2 } → { B , G } ◮ Dynamic regret (Besbes et al. 15) :   �� T � � T  − E dym-reg T = E t =1 r ( s t ( π ∗ )) t =1 r ( s t ( π )) . ���� knows p t ’s ◮ Variation budget: � p 1 − p 2 � + � p 2 − p 3 � + . . . + � p T − 1 − p T � ≤ B p . 5 / 18

  11. Diameter of a MDP cont’d ◮ If the DM leaves state 1, she has to come back to state 1 to collect samples. 6 / 18

  12. Diameter of a MDP cont’d ◮ If the DM leaves state 1, she has to come back to state 1 to collect samples. ◮ The longer it takes to commute between states, the harder the learning process. 6 / 18

  13. Diameter of a MDP cont’d ◮ If the DM leaves state 1, she has to come back to state 1 to collect samples. ◮ The longer it takes to commute between states, the harder the learning process. Definition ( (Jaksch et al. 10) Informal) Diameter = max { E [min. time(1 → 2)] , E [min. time(2 → 1)] } 6 / 18

  14. Diameter of a MDP cont’d ◮ If the DM leaves state 1, she has to come back to state 1 to collect samples. ◮ The longer it takes to commute between states, the harder the learning process. Definition ( (Jaksch et al. 10) Informal) Diameter = max { E [min. time(1 → 2)] , E [min. time(2 → 1)] } Example. Diameter = max { 1 / 0 . 8 , 1 / 0 . 1 } = 10 . 6 / 18

  15. Existing Works Stationary Non-stationary Multi-armed bandit OFU* Forgetting + OFU † Reinforcement learning OFU ‡ ? (Forgetting + OFU) * Auer et al. 03 † Besbes et al. 14, Cheung et al. 19 ‡ Jaksch et al. 10, Agrawal and Jia 20 7 / 18

  16. UCB for Stationary RL 1. Suppose at time t , N t (1 , B ) = 10 : 5 × (1 , B ) → 1 , 5 × (1 , B ) → 2 8 / 18

  17. UCB for Stationary RL 1. Suppose at time t , N t (1 , B ) = 10 : 5 × (1 , B ) → 1 , 5 × (1 , B ) → 2 N t (2 , B ) = 10 : 5 × (2 , B ) → 1 , 5 × (2 , B ) → 2 8 / 18

  18. UCB for Stationary RL 1. Suppose at time t , N t (1 , B ) = 10 : 5 × (1 , B ) → 1 , 5 × (1 , B ) → 2 N t (2 , B ) = 10 : 5 × (2 , B ) → 1 , 5 × (2 , B ) → 2 Empirical state transition distribution: 8 / 18

  19. UCB for Stationary RL 1. Suppose at time t , N t (1 , B ) = 10 : 5 × (1 , B ) → 1 , 5 × (1 , B ) → 2 N t (2 , B ) = 10 : 5 × (2 , B ) → 1 , 5 × (2 , B ) → 2 Empirical state transition distribution: 2. Confidence intervals: √ � ˆ p t ( ·| 1 , B ) − p ( ·| 1 , B ) � ≤ c t (1 , B ) := C / 10 √ � ˆ p t ( ·| 2 , B ) − p ( ·| 2 , B ) � ≤ c t (2 , B ) := C / 10 8 / 18

  20. UCB for Stationary RL 3. UCB of reward: find the ˚ p that maximizes Pr(visiting state 1) within the confidence interval. 4. Execute the optimal policy w.r.t. the UCB until some termination criteria are met. 9 / 18

  21. UCB for Stationary RL 3. UCB of reward: find the ˚ p that maximizes Pr(visiting state 1) within the confidence interval. 4. Execute the optimal policy w.r.t. the UCB until some termination criteria are met. 9 / 18

  22. UCB for RL cont’d Regret analysis: ◮ LCB of diameter: find the ˚ p that maximizes Pr(commuting) within the confidence interval. �� � ◮ Regret ∝ LCB × ( s , a ) c t ( s , a ) . ◮ Under stationarity, LCB of diameter ≤ Diameter( p ) . Theorem Denote D := Diameter ( p ) , the regret of the UCB algorithm is √ O ( D T ) . ◮ Summary: UCB of reward + LCB of diameter ⇒ low regret. 10 / 18

  23. UCB for RL cont’d Regret analysis: ◮ LCB of diameter: find the ˚ p that maximizes Pr(commuting) within the confidence interval. �� � ◮ Regret ∝ LCB × ( s , a ) c t ( s , a ) . ◮ Under stationarity, LCB of diameter ≤ Diameter( p ) . Theorem Denote D := Diameter ( p ) , the regret of the UCB algorithm is √ O ( D T ) . ◮ Summary: UCB of reward + LCB of diameter ⇒ low regret. 10 / 18

  24. UCB for RL cont’d Regret analysis: ◮ LCB of diameter: find the ˚ p that maximizes Pr(commuting) within the confidence interval. �� � ◮ Regret ∝ LCB × ( s , a ) c t ( s , a ) . ◮ Under stationarity, LCB of diameter ≤ Diameter( p ) . Theorem Denote D := Diameter ( p ) , the regret of the UCB algorithm is √ O ( D T ) . ◮ Summary: UCB of reward + LCB of diameter ⇒ low regret. 10 / 18

  25. UCB for RL cont’d Regret analysis: ◮ LCB of diameter: find the ˚ p that maximizes Pr(commuting) within the confidence interval. �� � ◮ Regret ∝ LCB × ( s , a ) c t ( s , a ) . ◮ Under stationarity, LCB of diameter ≤ Diameter( p ) . Theorem Denote D := Diameter ( p ) , the regret of the UCB algorithm is √ O ( D T ) . ◮ Summary: UCB of reward + LCB of diameter ⇒ low regret. 10 / 18

  26. UCB for RL cont’d Regret analysis: ◮ LCB of diameter: find the ˚ p that maximizes Pr(commuting) within the confidence interval. �� � ◮ Regret ∝ LCB × ( s , a ) c t ( s , a ) . ◮ Under stationarity, LCB of diameter ≤ Diameter( p ) . Theorem Denote D := Diameter ( p ) , the regret of the UCB algorithm is √ O ( D T ) . ◮ Summary: UCB of reward + LCB of diameter ⇒ low regret. 10 / 18

  27. SWUCB for RL According to (Cheung et al. 19) : ◮ SWUCB for RL: UCB for RL with W most recent samples. 11 / 18

  28. SWUCB for RL According to (Cheung et al. 19) : ◮ SWUCB for RL: UCB for RL with W most recent samples. ◮ The perils of drift: Under non-stationarity, LCB of diameter ≫ Diameter( p s ) for all s ∈ [ T ] . 11 / 18

  29. Perils of Non-Stationarity in RL Non-stationarity: The DM faces time-varying environment. 12 / 18

  30. Perils of Non-Stationarity in RL Non-stationarity: The DM faces time-varying environment. Bandit feedback: The DM is not seeing everything. 12 / 18

  31. Perils of Non-Stationarity in RL Non-stationarity: The DM faces time-varying environment. Bandit feedback: The DM is not seeing everything. Collected data: { (1 , B ) → 1 , (2 , B ) → 2 } 12 / 18

  32. Perils of Non-Stationarity in RL Non-stationarity: The DM faces time-varying environment. Bandit feedback: The DM is not seeing everything. Collected data: { (1 , B ) → 1 , (2 , B ) → 2 } Empirical state transition ˆ p t : 12 / 18

  33. Perils of Non-Stationarity in RL Non-stationarity: The DM faces time-varying environment. Bandit feedback: The DM is not seeing everything. Collected data: { (1 , B ) → 1 , (2 , B ) → 2 } Empirical state transition ˆ p t : Diameter explodes! 12 / 18

Recommend

DualDICE Behavior-Agnostic Estimation of Discounted Stationary Distribution Corrections Ofir

DualDICE Behavior-Agnostic Estimation of Discounted Stationary Distribution Corrections Ofir

DualDICE Behavior-Agnostic Estimation of Discounted Stationary Distribution Corrections Ofir Nachum ,* Yinlam Chow,* Bo Dai, Lihong Li Google Research *Equal contribution Reinforcement Learning Reinforcement Learning A policy acts on an

577 views • 33 slides
RL Overview of topics About Reinforcement Learning The Reinforcement Learning Problem

RL Overview of topics About Reinforcement Learning The Reinforcement Learning Problem

Introduction to Reinforcement Learning RL Overview of topics About Reinforcement Learning The Reinforcement Learning Problem Inside an RL agent Temporal difference learning Many faces of Reinforcement Learning What is

551 views • 35 slides
Reinforcement Learning Reinforcement Learning Reinforcement Learning in a nutshell g Imagine

Reinforcement Learning Reinforcement Learning Reinforcement Learning in a nutshell g Imagine

Reinforcement Learning Reinforcement Learning Reinforcement Learning in a nutshell g Imagine playing a new game whose rules you dont know; after a hundred or so moves your don t know; after a hundred or so moves, your opponent announces, You

511 views • 30 slides
Reinforcement Learning You can think of supervised learning as the teacher providing answers

Reinforcement Learning You can think of supervised learning as the teacher providing answers

Reinforcement Learning You can think of supervised learning as the teacher providing answers (the class labels) Reinforcement learning: In reinforcement learning, the agent learns Markov Decision Processes based on a punishment/reward

89 views • 6 slides
Examples of Reinforcement Learning Robocup Soccer Teams Stone & Veloso, Reidmiller et al.

Examples of Reinforcement Learning Robocup Soccer Teams Stone & Veloso, Reidmiller et al.

Reinforcement Learning Slides by Rich Sutton Mods by Dan Lizotte Refer to Reinforcement Learning: An Introduction by Sutton and Barto Alpaydin Chapter 16 Up until now we have been Supervised Learning Classifying, mostly

891 views • 31 slides
Subgoals in Hierarchical Reinforcement Learning Tianren Tang Tian Tan Shangqi Guo Xiaolin Hu

Subgoals in Hierarchical Reinforcement Learning Tianren Tang Tian Tan Shangqi Guo Xiaolin Hu

Generating Adjacency-Constrained Subgoals in Hierarchical Reinforcement Learning Tianren Tang Tian Tan Shangqi Guo Xiaolin Hu Feng Chen Background Goal-Conditional HRL High policy suffers from non-stationary problem From MARL's

330 views • 13 slides
CS885 Reinforcement Learning Module 2: June 6, 2020 Maximum Entropy Reinforcement Learning

CS885 Reinforcement Learning Module 2: June 6, 2020 Maximum Entropy Reinforcement Learning

CS885 Reinforcement Learning Module 2: June 6, 2020 Maximum Entropy Reinforcement Learning Haarnoja, Tang et al. (2017) Reinforcement Learning with Deep Energy Based Policies, ICML . Haarnoja, Zhou et al. (2018) Soft Actor-Critic: Off-Policy

683 views • 24 slides
Reinforcement Learning Reinforcement Learning Now that you know a little about Optimal Control

Reinforcement Learning Reinforcement Learning Now that you know a little about Optimal Control

Reinforcement Learning Reinforcement Learning Now that you know a little about Optimal Control Theory, you actually have some knowledge in RL. RL shares the overall goal with OCT: solving for a control policy such that the cumulative cost

610 views • 22 slides
R i f R i f Reinforcement Learning III Reinforcement Learning III t L t L i i III III Dec

R i f R i f Reinforcement Learning III Reinforcement Learning III t L t L i i III III Dec

R i f R i f Reinforcement Learning III Reinforcement Learning III t L t L i i III III Dec 03 2008 1 Large State Spaces h When a problem has a large state space we can not longer represent the U or Q functions as explicit tables explicit

436 views • 18 slides
Reinforcement Learning CS 4100: Artificial Intelligence Reinforcement Learning II Still

Reinforcement Learning CS 4100: Artificial Intelligence Reinforcement Learning II Still

Reinforcement Learning CS 4100: Artificial Intelligence Reinforcement Learning II Still assume a Marko kov decision process (MDP): A se set o of st states s s S A se set o of a actions ( s (per st state) A A mo model

96 views • 5 slides
Reinforcement Learning UMaine COS 470/570 Introduction to AI Why reinforcement learning?

Reinforcement Learning UMaine COS 470/570 Introduction to AI Why reinforcement learning?

Reinforcement Learning<br/><br/> 4/25/19, 8*06 PM Reinforcement Learning<br/><br/> 4/25/19, 8*06 PM Reinforcement Learning UMaine COS 470/570 Introduction to AI Why reinforcement learning? Spring 2019 Created:

371 views • 15 slides
7. Motor Control and Reinforcement Learning Outline A. Action Selection and Reinforcement B.

7. Motor Control and Reinforcement Learning Outline A. Action Selection and Reinforcement B.

7. Motor Control and Reinforcement Learning Outline A. Action Selection and Reinforcement B. Temporal Difference Reinforcement Learning C. PVLV Model D. Cerebellum and Error-driven Learning 2/23/18 COSC 494/594 CCN 2 Sensory-Motor Loop

790 views • 56 slides
Deep Reinforcement Learning [Mastering the Game of Go with Deep Reinforcement Learning and Tree

Deep Reinforcement Learning [Mastering the Game of Go with Deep Reinforcement Learning and Tree

Deep Reinforcement Learning [Mastering the Game of Go with Deep Reinforcement Learning and Tree Search, Nature 2016] CS 486/686 University of Waterloo Lecture 21: July 12, 2017 Outline AlphaGo Supervised Learning of Policy Networks

541 views • 15 slides
Reinforcement Learning CS 4100: Artificial Intelligence Reinforcement Learning Ja Jan-Wi

Reinforcement Learning CS 4100: Artificial Intelligence Reinforcement Learning Ja Jan-Wi

Reinforcement Learning CS 4100: Artificial Intelligence Reinforcement Learning Ja Jan-Wi Willem van de Meent Northeastern University [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188

145 views • 10 slides
Reinforcement Learning AIMA Chapters: 21.1, 21.2, 21.3. Sutton and Barto, Reinforcement Learning:

Reinforcement Learning AIMA Chapters: 21.1, 21.2, 21.3. Sutton and Barto, Reinforcement Learning:

Reinforcement Learning Reinforcement Learning AIMA Chapters: 21.1, 21.2, 21.3. Sutton and Barto, Reinforcement Learning: an Introduction, 2nd Edition: Chapters 6 (6.1 6.5) Outline Reinforcement Learning Reinforcement Learning: the

587 views • 27 slides
Module 11 Introduction to Reinforcement Learning CS 886 Sequential Decision Making and

Module 11 Introduction to Reinforcement Learning CS 886 Sequential Decision Making and

Module 11 Introduction to Reinforcement Learning CS 886 Sequential Decision Making and Reinforcement Learning University of Waterloo Machine Learning Supervised Learning Teacher tells learner what to remember Reinforcement Learning

401 views • 29 slides
1 Pure Reinforcement Learning vs. Reinforcement Learning Monte-Carlo Planning No knowledge

1 Pure Reinforcement Learning vs. Reinforcement Learning Monte-Carlo Planning No knowledge

CSE 573: Artificial Intelligence Todo Reinforcement Learning Add simulations from 473 Dan Weld Add UCB bound (cut bolzman & constant epsilon Add snazzy videos (pendulum, zico kolter See http://www See http://www-

462 views • 11 slides
Safe Reinforcement Learning Philip S. Thomas Stanford CS234: Reinforcement Learning, Guest

Safe Reinforcement Learning Philip S. Thomas Stanford CS234: Reinforcement Learning, Guest

Safe Reinforcement Learning Philip S. Thomas Stanford CS234: Reinforcement Learning, Guest Lecture May 24, 2017 Lecture overview What makes a reinforcement learning algorithm safe ? Notation Creating a safe reinforcement learning

1.42k views • 88 slides
Reinforcement Learning Framework Reinforcement Learning Rewards, Returns Lectures 4 and 5

Reinforcement Learning Framework Reinforcement Learning Rewards, Returns Lectures 4 and 5

1 Reinforcement Learning Framework Reinforcement Learning Rewards, Returns Lectures 4 and 5 Environment Dynamics Gillian Hayes Components of a Problem 18th January 2007 Values and Action Values, V and Q Optimal Policies

109 views • 7 slides
Introduction to Reinforcement Learning Bayesian Methods in Reinforcement Learning ICML 2007

Introduction to Reinforcement Learning Bayesian Methods in Reinforcement Learning ICML 2007

Introduction to Reinforcement Learning Bayesian Methods in Reinforcement Learning ICML 2007 sequential decision making under uncertainty ? How Can I ... ? Move around in the physical world (e.g. driving, navigation) Play and win a game

519 views • 21 slides
Neural Combinatorial Optimization With Reinforcement Learning CS885 Reinforcement Learning Paper

Neural Combinatorial Optimization With Reinforcement Learning CS885 Reinforcement Learning Paper

Neural Combinatorial Optimization With Reinforcement Learning CS885 Reinforcement Learning Paper by Bello, I., Pham, H., Le, Q. V., Norouzi, M., & Bengio, S. (2016) Presented by Yan Shi Outline 1. Introduction 2. Background 3. Algorithms

966 views • 27 slides
Todays Outline Reinforcement Learning Dan Weld Reinforcement Learning Q-value

Todays Outline Reinforcement Learning Dan Weld Reinforcement Learning Q-value

5/7/2012 CSE 473: Artificial Intelligence Todays Outline Reinforcement Learning Dan Weld Reinforcement Learning Q-value iteration Q-learning Exploration / exploitation Linear function approximation Linear function

159 views • 12 slides
CSC2621 Topics in Robotics Reinforcement Learning in Robotics Week 11: Hierarchical Reinforcement

CSC2621 Topics in Robotics Reinforcement Learning in Robotics Week 11: Hierarchical Reinforcement

CSC2621 Topics in Robotics Reinforcement Learning in Robotics Week 11: Hierarchical Reinforcement Learning Animesh Garg Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning Richard S. Sutton , Doina

2.18k views • 29 slides
Asynchronous RL CMU 10703 Katerina Fragkiadaki Non-stationary data problem for Deep RL

Asynchronous RL CMU 10703 Katerina Fragkiadaki Non-stationary data problem for Deep RL

Carnegie Mellon School of Computer Science Deep Reinforcement Learning and Control Asynchronous RL CMU 10703 Katerina Fragkiadaki Non-stationary data problem for Deep RL Stability of training neural networks requires the gradient updates

933 views • 69 slides

More recommend