CS230: Lecture 9 Deep Reinforcement Learning
|
|
- Randall Gray
- 5 years ago
- Views:
Transcription
1 CS230: Lecture 9 Deep Reinforcement Learning Kian Katanforoosh Menti code:
2 Today s outline I. Motivation II. Recycling is good: an introduction to RL III. Deep Q-Learning IV. Application of Deep Q-Learning: Breakout (Atari) V. Tips to train Deep Q-Network VI. Advanced topics
3 I. Motivation AlphaGo Human Level Control through Deep Reinforcement Learning [Silver, Schrittwieser, Simonyan et al. (2017): Mastering the game of Go without human knowledge] [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
4 I. Motivation How would you solve Go with classic supervised learning? Input output class The move of the professional player issues: - Ground truth probably wrongly defined. - Two many states in this Game. - We will likely not generalize. Source: alphago-zero-learning-scratch/ Why RL? Examples of RL applications Delayed labels Robotics Games Advertisement Making sequences of decisions What is RL? Automatically learn to make good sequences of decision
5 Today s outline I. Motivation II. Recycling is good: an introduction to RL III. Deep Q-Networks IV. Application of Deep Q-Network: Breakout (Atari) V. Tips to train Deep Q-Network VI. Advanced topics
6 II. Recycling is good: an introduction to RL Problem statement State 1 State 2 (initial) State 3 State 4 State 5 Goal: maximize the return (rewards) START Number of states: 5 initial normal terminal Types of states: Define reward r in every state Agent s Possible actions: Additional rule: garbage collector coming in 3min, it takes Best strategy to follow if γ = 1 1min to move between states How to define the long-term return? Discounted return R = γ t r t = r 0 + γ r 1 + γ 2 r t=0
7 II. Recycling is good: an introduction to RL Problem statement What do we want to learn? State 1 State 2 (initial) State 3 State 4 State 5 START Define reward r in every state how good is it to take action 1 in state 2 Q-table Q = #actions Q 11 Q 12 Q 21 Q 22 Q 31 Q 32 Q 41 Q 42 Q 51 Q 52 #states S1 S2 S3 S4 S5 Assuming γ = 0.9 Discounted return R = How? γ t r = r + γ r + γ 2 r +... t t=0 S S1 S S2 S S3 S5
8 II. Recycling is good: an introduction to RL Problem statement What do we want to learn? State 1 State 2 (initial) State 3 State 4 State 5 START Define reward r in every state how good is it to take action 1 in state 2 Q-table Q = #actions Q 11 Q 12 Q 21 Q 22 Q 31 Q 32 Q 41 Q 42 Q 51 Q 52 #states S1 S2 S3 S4 S5 Assuming γ = 0.9 Discounted return R = How? γ t r = r + γ r + γ 2 r +... t t=0 S S1 S (= x 0.9) S2 S S3 S5
9 II. Recycling is good: an introduction to RL Problem statement What do we want to learn? State 1 State 2 (initial) State 3 State 4 State 5 START Define reward r in every state how good is it to take action 1 in state 2 Q-table Q = #actions Q 11 Q 12 Q 21 Q 22 Q 31 Q 32 Q 41 Q 42 Q 51 Q 52 #states S1 S2 S3 S4 S5 Assuming γ = 0.9 Discounted return R = How? γ t r = r + γ r + γ 2 r +... t t=0 S (= x 10) S1 S (= x 0.9) S2 S S3 S5
10 II. Recycling is good: an introduction to RL Problem statement What do we want to learn? State 1 State 2 (initial) State 3 State 4 State 5 START Define reward r in every state how good is it to take action 1 in state 2 Q-table Q = #actions Q 11 Q 12 Q 21 Q 22 Q 31 Q 32 Q 41 Q 42 Q 51 Q 52 #states S1 S2 S3 S4 S5 Assuming γ = 0.9 Discounted return R = How? γ t r = r + γ r + γ 2 r +... t t=0 S (= x 10) S1 S (= x 0.9) S2 S (= x 10) S3 S5
11 II. Recycling is good: an introduction to RL Problem statement What do we want to learn? State 1 State 2 (initial) State 3 State 4 State 5 START Define reward r in every state how good is it to take action 1 in state 2 Q-table Q = #actions Q 11 Q 12 Q 21 Q 22 Q 31 Q 32 Q 41 Q 42 Q 51 Q 52 #states S1 S2 S3 S4 S5 Discounted return R = Assuming γ = 0.9 How? (= x 9) γ t r = r + γ r + γ 2 r +... t t=0 S2 + 9 (= x 10) +2 S1 S (= x 0.9) S2 S (= x 10) S3 S5
12 II. Recycling is good: an introduction to RL Problem statement What do we want to learn? State 1 State 2 (initial) State 3 State 4 State 5 START Define reward r in every state how good is it to take action 1 in state 2 Q-table Q = #actions Q 11 Q 12 Q 21 Q 22 Q 31 Q 32 Q 41 Q 42 Q 51 Q 52 #states S1 S2 S3 S4 S5 Discounted return R = Assuming γ = 0.9 How? (= x 9) γ t r = r + γ r + γ 2 r +... t t=0 S2 + 9 (= x 10) +2 S1 S3 (= x 9) (= x 0.9) S2 S (= x 10) S3 S5
13 II. Recycling is good: an introduction to RL Problem statement What do we want to learn? State 1 State 2 (initial) State 3 State 4 State 5 START Define reward r in every state how good is it to take action 1 in state 2 Q-table Q = #actions #states S1 S2 S3 S4 S5 Discounted return R = Assuming γ = 0.9 How? (= x 9) γ t r = r + γ r + γ 2 r +... t t=0 S2 + 9 (= x 10) +2 S1 S3 (= x 9) (= x 0.9) S2 S (= x 10) S3 S5
14 II. Recycling is good: an introduction to RL Problem statement What do we want to learn? State 1 State 2 (initial) State 3 State 4 State 5 START Define reward r in every state how good is it to take action 1 in state 2 Q-table Q = #actions #states Bellman equation (optimality equation) Best strategy to follow if γ = 0.9 Q * (s,a) = r + γ max(q * (s',a')) a' When state and actions space are too big, this method has huge memory cost Policy π (s) = argmax a (Q * (s,a)) Function telling us our best strategy
15 What we ve learned so far: - Vocabulary: environment, agent, state, action, reward, total return, discount factor. - Q-table: matrix of entries representing how good is it to take action a in state s - Policy: function telling us what s the best strategy to adopt - Bellman equation satisfied by the optimal Q-table
16 Today s outline I. Motivation II. Recycling is good: an introduction to RL III. Deep Q-Learning IV. Application of Deep Q-Learning: Breakout (Atari) V. Tips to train Deep Q-Network VI. Advanced topics
17 III. Deep Q-Learning Main idea: find a Q-function to replace the Q-table Problem statement Neural Network State 1 State 2 (initial) State 3 State 4 State 5 START Q = Q-table #actions #states s = [1] a 1 a [1] 2 [1] a 3 [1] a 4 Then compute loss, backpropagate. a 1 [2] a 1 [3] [2] a 2 [3] a 1 [2] a 3 Q(s, ) Q(s, ) How to compute the loss?
18 III. Deep Q-Learning Q * (s,a) = r + γ max(q * (s',a')) a' 0 a 1 [1] s = a 2 [1] [1] a 3 [1] a 4 a 1 [2] a 2 [2] a 3 [2] a 1 [3] a 1 [3] Q(s, ) Q(s, ) Loss function L = ( y Q(s, )) 2 Target value Case: Q(s, ) > Q(s, ) Case: Q(s, ) < Q(s, ) Immediate reward for taking action in state s Discounted maximum future reward when you are in state s next [Francisco S. Melo: Convergence of Q-learning: a simple proof] y = r + γ max(q(s next,a')) a' Hold fixed for backprop y = r + γ max a' Immediate Reward for taking action in state s (Q(s next,a')) Hold fixed for backprop Discounted maximum future reward when you are in state s next
19 III. Deep Q-Learning 0 a 1 [1] s = a 2 [1] [1] a 3 [1] a 4 a 1 [2] a 2 [2] a 3 [2] a 1 [3] a 1 [3] Q(s, ) Q(s, ) Loss function (regression) L = ( y Q(s, )) 2 Target value Case: Q(s, ) > Q(s, ) Case: Q(s, ) < Q(s, ) y = r + γ max(q(s next,a')) a' y = r + γ max(q(s next,a')) a' Backpropagation L Compute and update W using stochastic gradient descent W
20 Recap DQN Implementation: - Initialize your Q-network parameters State 1 State 2 (initial) State 3 State 4 State 5 START - Loop over episodes: - Start from initial state s - Loop over time-steps: - Forward propagate s in the Q-network - Execute action a (that has the maximum Q(s,a) output of Q-network) - Observe reward r and next state s - Compute targets y by forward propagating state s in the Q-network, then compute loss. - Update parameters with gradient descent
21 Today s outline I. Motivation II. Recycling is good: an introduction to RL III. Deep Q-Networks IV. Application of Deep Q-Network: Breakout (Atari) V. Tips to train Deep Q-Network VI. Advanced topics
22 IV. Deep Q-Learning application: Breakout (Atari) Goal: play breakout, i.e. destroy all the bricks. Demo input of Q-network Output of Q-network Q-values s = Q(s, ) Q(s, ) Q(s, ) Would that work? [Video credits to Two minute papers: Google DeepMind's Deep Q-learning playing Atari Breakout [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
23 IV. Deep Q-Learning application: Breakout (Atari) Goal: play breakout, i.e. destroy all the bricks. Demo input of Q-network Output of Q-network Q-values s = Q(s, ) Q(s, ) Q(s, ) Preprocessing - Convert to grayscale What is done in preprocessing? φ(s) [Video credits to Two minute papers: Google DeepMind's Deep Q-learning playing Atari Breakout [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning] - Reduce dimensions (h,w) - History (4 frames)
24 IV. Deep Q-Learning application: Breakout (Atari) input of Q-network φ(s) = Deep Q-network architecture? Q(s, ) φ(s) CONV ReLU CONV ReLU CONV ReLU FC (RELU) FC (LINEAR) Q(s, ) Q(s, ) [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
25 Recap (+ preprocessing + terminal state) Some training challenges: DQN Implementation: - Initialize your Q-network parameters - Keep track of terminal step - Experience replay - Epsilon greedy action choice - Loop over episodes: - Start from initial state s - Loop over time-steps: φ(s) φ(s) (Exploration / Exploitation tradeoff) - Forward propagate s in the Q-network φ(s) - Execute action a (that has the maximum Q(s,a) output of Q-network) - Observe reward r and next state s - - Use s to create φ(s') φ(s') - Compute targets y by forward propagating state s in the Q-network, then compute loss. - Update parameters with gradient descent [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
26 Recap (+ preprocessing + terminal state) Some training challenges: DQN Implementation: - Initialize your Q-network parameters - Keep track of terminal step - Experience replay - Epsilon greedy action choice - Loop over episodes: - Start from initial state s - Loop over time-steps: φ(s) φ(s) (Exploration / Exploitation tradeoff) - Forward propagate s in the Q-network φ(s) - Execute action a (that has the maximum Q(s,a) output of Q-network) - Observe reward r and next state s - - Use s to create φ(s') φ(s') - Compute targets y by forward propagating state s in the Q-network, then compute loss. - Update parameters with gradient descent [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
27 Recap (+ preprocessing + terminal state) DQN Implementation: - Initialize your Q-network parameters Some training challenges: - Keep track of terminal step - Experience replay - Loop over episodes: - Start from initial state s φ(s) - Epsilon greedy action choice (Exploration / Exploitation tradeoff) - Create a boolean to detect terminal states: terminal = False - Loop over time-steps: φ(s) - Forward propagate s in the Q-network φ(s) if terminal = False : y = r + γ max(q(s',a')) a' if terminal = True : y = r (break) - Execute action a (that has the maximum Q(s,a) output of Q-network) - Observe reward r and next state s - Use s to create φ(s') φ(s') - Check if s is a terminal state. Compute targets y by forward propagating state s in the Q-network, then compute loss. - Update parameters with gradient descent [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
28 IV - DQN training challenges Experience replay 1 experience (leads to one iteration of gradient descent) Current method is to start from Experience Replay initial state s and follow: E1 E1 φ(s) a r φ(s') E2 E2 E1 E2 φ(s') a' r ' φ(s'') E3 E3 E3 φ(s'') a'' r '' φ(s''')... Replay memory (D) Training: E1 E2 E3 Training: E1 sample(e1, E2) sample(e1, E2, E3) sample(e1, E2, E3, E4) Can be used with mini batch gradient descent [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning] Advantages of experience replay?
29 Recap (+ experience replay) DQN Implementation: - Initialize your Q-network parameters - Initialize replay memory D - Loop over episodes: Some training challenges: - Keep track of terminal step - Experience replay - Epsilon greedy action choice - Start from initial state φ(s) (Exploration / Exploitation tradeoff) - Create a boolean to detect terminal states: terminal = False - Loop over time-steps: - Forward propagate in the Q-network - Execute action a (that has the maximum Q( φ(s),a) output of Q-network) - Observe reward r and next state s - Use s to create φ(s') φ(s) The transition resulting from this is added to D, and will not necessarily be used in this iteration s update! - Add experience (φ(s),a,r,φ(s')) to replay memory (D) Update using sampled transitions - Sample random mini-batch of transitions from D - Check if s is a terminal state. Compute targets y by forward propagating state φ(s') in the Q-network, then compute loss. - Update parameters with gradient descent [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
30 Exploration vs. Exploitation Terminal state S2 R = +0 Just after initializing the a 1 Q-network, we get: Initial state Terminal state Q(S1,a 1 ) = 0.5 a 2 S1 S3 R = +1 Q(S1,a 2 ) = 0.4 a 3 Q(S1,a 3 ) = 0.3 Terminal state S4 R = +1000
31 Exploration vs. Exploitation Terminal state a 1 a2 S2 R = +0 Just after initializing the Q-network, we get: Initial state Terminal state Q(S1,a 1 ) = S1 S3 R = +1 Q(S1,a 2 ) = 0.4 a 3 Q(S1,a 3 ) = 0.3 Terminal state S4 R = +1000
32 Exploration vs. Exploitation Terminal state a 1 a2 S2 R = +0 Just after initializing the Q-network, we get: Initial state Terminal state Q(S1,a 1 ) = S1 S3 R = +1 Q(S1,a 2 ) = a 3 Q(S1,a 3 ) = 0.3 Terminal state S4 R = +1000
33 Exploration vs. Exploitation Terminal state a 1 a2 S2 R = +0 Just after initializing the Q-network, we get: Initial state Terminal state Q(S1,a 1 ) = S1 S3 R = +1 Q(S1,a 2 ) = a 3 Q(S1,a 3 ) = 0.3 Terminal state S4 R = Will never be visited, because Q(S1,a3) < Q(S1,a2)
34 Recap (+ epsilon greedy action) DQN Implementation: - Initialize your Q-network parameters - Initialize replay memory D - Loop over episodes: - Start from initial state φ(s) - Create a boolean to detect terminal states: terminal = False - Loop over time-steps: - With probability epsilon, take random action a. - Otherwise: - Forward propagate φ(s) in the Q-network - Execute action a (that has the maximum Q( φ(s),a) output of Q-network). - Observe reward r and next state s - Use s to create φ(s') - Add experience (φ(s),a,r,φ(s')) to replay memory (D) - Sample random mini-batch of transitions from D - Check if s is a terminal state. Compute targets y by forward propagating state φ(s') in the Q-network, then compute loss. - Update parameters with gradient descent [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
35 Overall recap DQN Implementation: - Initialize your Q-network parameters - Initialize replay memory D - Loop over episodes: - Preprocessing - Detect terminal state - Experience replay - Start from initial state φ(s) - Epsilon greedy action - Create a boolean to detect terminal states: terminal = False - Loop over time-steps: - With probability epsilon, take random action a. - Otherwise: - Forward propagate φ(s) in the Q-network - Execute action a (that has the maximum Q( φ(s),a) output of Q-network). - Observe rewards r and next state s - Use s to create φ(s') - Add experience (φ(s),a,r,φ(s')) to replay memory (D) - Sample random mini-batch of transitions from D - Check if s is a terminal state. Compute targets y by forward propagating state φ(s') in the Q-network, then compute loss. - Update parameters with gradient descent [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
36 Results [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning] [Credits: DeepMind, DQN Breakout -
37 Difference between with and without human knowledge Imitation learning [Source: Bellemare et al. (2016): Unifying Count-Based Exploration and Intrinsic Motivation] [Ho et al. (2016): Generative Adversarial Imitation Learning]
38 Other Atari games Pong SeaQuest Space Invaders [Chia-Hsuan Lee, Atari Seaquest Double DQN Agent - watch?v=nirmkc5uvwu] [moooopan, Deep Q-Network Plays Atari 2600 Pong - v=p88r2_3ywpa] [DeepMind: DQN SPACE INVADERS [Mnih, Kavukcuoglu, Silver et al. (2015): Human Level Control through Deep Reinforcement Learning]
39 Today s outline I. Motivation II. Recycling is good: an introduction to RL III. Deep Q-Networks IV. Application of Deep Q-Network: Breakout (Atari) V. Tips to train Deep Q-Network VI. Advanced topics
40 VI - Advanced topics Alpha Go [DeepMind Blog] [Silver, Schrittwieser, Simonyan et al. (2017): Mastering the game of Go without human knowledge]
41 VI - Advanced topics Policy Gradient Methods PPO TRPO [Open AI Blog] [TRPO] [Schulman et al. (2017): Trust Region Policy Optimization] [Schulman et al. (2017): Proximal Policy Optimization]
42 VI - Advanced topics Competitive self-play [Bansal et al. (2017): Emergent Complexity via multi-agent competition] [OpenAI Blog: Competitive self-play]
43 VI - Advanced topics Meta learning [Finn et al. (2017): Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks]
44 VI - Advanced topics Exploration in Reinforcement Learning [Bellemare et al. (2017):Unifying Count-Based Exploration and Intrinsic Motivation]
45 VI - Advanced topics Imitation learning [Ho et al. (2016): Generative Adversarial Imitation Learning]
46 Announcements For Wednesday 12/05, 11am: No assignment this week, but work on your projects and meet your mentors! This Friday: TA Sections: reading research papers.
47 VI - Advanced topics Imitation learning [Source: Bellemare et al. (2016): Unifying Count-Based Exploration and Intrinsic Motivation] [Ho et al. (2016): Generative Adversarial Imitation Learning]
48 VI - Advanced topics Auxiliary task
Deep Reinforcement Learning SISL. Jeremy Morton (jmorton2) November 7, Stanford Intelligent Systems Laboratory
Deep Reinforcement Learning Jeremy Morton (jmorton2) November 7, 2016 SISL Stanford Intelligent Systems Laboratory Overview 2 1 Motivation 2 Neural Networks 3 Deep Reinforcement Learning 4 Deep Learning
More informationApproximate Q-Learning. Dan Weld / University of Washington
Approximate Q-Learning Dan Weld / University of Washington [Many slides taken from Dan Klein and Pieter Abbeel / CS188 Intro to AI at UC Berkeley materials available at http://ai.berkeley.edu.] Q Learning
More informationCSC321 Lecture 22: Q-Learning
CSC321 Lecture 22: Q-Learning Roger Grosse Roger Grosse CSC321 Lecture 22: Q-Learning 1 / 21 Overview Second of 3 lectures on reinforcement learning Last time: policy gradient (e.g. REINFORCE) Optimize
More informationREINFORCEMENT LEARNING
REINFORCEMENT LEARNING Larry Page: Where s Google going next? DeepMind's DQN playing Breakout Contents Introduction to Reinforcement Learning Deep Q-Learning INTRODUCTION TO REINFORCEMENT LEARNING Contents
More informationReinforcement Learning Part 2
Reinforcement Learning Part 2 Dipendra Misra Cornell University dkm@cs.cornell.edu https://dipendramisra.wordpress.com/ From previous tutorial Reinforcement Learning Exploration No supervision Agent-Reward-Environment
More informationIntroduction to Reinforcement Learning
CSCI-699: Advanced Topics in Deep Learning 01/16/2019 Nitin Kamra Spring 2019 Introduction to Reinforcement Learning 1 What is Reinforcement Learning? So far we have seen unsupervised and supervised learning.
More informationReinforcement Learning. Yishay Mansour Tel-Aviv University
Reinforcement Learning Yishay Mansour Tel-Aviv University 1 Reinforcement Learning: Course Information Classes: Wednesday Lecture 10-13 Yishay Mansour Recitations:14-15/15-16 Eliya Nachmani Adam Polyak
More informationINF 5860 Machine learning for image classification. Lecture 14: Reinforcement learning May 9, 2018
Machine learning for image classification Lecture 14: Reinforcement learning May 9, 2018 Page 3 Outline Motivation Introduction to reinforcement learning (RL) Value function based methods (Q-learning)
More information1 Introduction 2. 4 Q-Learning The Q-value The Temporal Difference The whole Q-Learning process... 5
Table of contents 1 Introduction 2 2 Markov Decision Processes 2 3 Future Cumulative Reward 3 4 Q-Learning 4 4.1 The Q-value.............................................. 4 4.2 The Temporal Difference.......................................
More informationHuman-level control through deep reinforcement. Liia Butler
Humanlevel control through deep reinforcement Liia Butler But first... A quote "The question of whether machines can think... is about as relevant as the question of whether submarines can swim" Edsger
More informationDeep Reinforcement Learning. STAT946 Deep Learning Guest Lecture by Pascal Poupart University of Waterloo October 19, 2017
Deep Reinforcement Learning STAT946 Deep Learning Guest Lecture by Pascal Poupart University of Waterloo October 19, 2017 Outline Introduction to Reinforcement Learning AlphaGo (Deep RL for Computer Go)
More informationDavid Silver, Google DeepMind
Tutorial: Deep Reinforcement Learning David Silver, Google DeepMind Outline Introduction to Deep Learning Introduction to Reinforcement Learning Value-Based Deep RL Policy-Based Deep RL Model-Based Deep
More informationIntroduction to Reinforcement Learning. CMPT 882 Mar. 18
Introduction to Reinforcement Learning CMPT 882 Mar. 18 Outline for the week Basic ideas in RL Value functions and value iteration Policy evaluation and policy improvement Model-free RL Monte-Carlo and
More informationLecture 1: March 7, 2018
Reinforcement Learning Spring Semester, 2017/8 Lecture 1: March 7, 2018 Lecturer: Yishay Mansour Scribe: ym DISCLAIMER: Based on Learning and Planning in Dynamical Systems by Shie Mannor c, all rights
More information(Deep) Reinforcement Learning
Martin Matyášek Artificial Intelligence Center Czech Technical University in Prague October 27, 2016 Martin Matyášek VPD, 2016 1 / 17 Reinforcement Learning in a picture R. S. Sutton and A. G. Barto 2015
More informationQ-Learning in Continuous State Action Spaces
Q-Learning in Continuous State Action Spaces Alex Irpan alexirpan@berkeley.edu December 5, 2015 Contents 1 Introduction 1 2 Background 1 3 Q-Learning 2 4 Q-Learning In Continuous Spaces 4 5 Experimental
More informationDueling Network Architectures for Deep Reinforcement Learning (ICML 2016)
Dueling Network Architectures for Deep Reinforcement Learning (ICML 2016) Yoonho Lee Department of Computer Science and Engineering Pohang University of Science and Technology October 11, 2016 Outline
More informationCS 570: Machine Learning Seminar. Fall 2016
CS 570: Machine Learning Seminar Fall 2016 Class Information Class web page: http://web.cecs.pdx.edu/~mm/mlseminar2016-2017/fall2016/ Class mailing list: cs570@cs.pdx.edu My office hours: T,Th, 2-3pm or
More informationDeep reinforcement learning. Dialogue Systems Group, Cambridge University Engineering Department
Deep reinforcement learning Milica Gašić Dialogue Systems Group, Cambridge University Engineering Department 1 / 25 In this lecture... Introduction to deep reinforcement learning Value-based Deep RL Deep
More informationReinforcement Learning
Reinforcement Learning Ron Parr CompSci 7 Department of Computer Science Duke University With thanks to Kris Hauser for some content RL Highlights Everybody likes to learn from experience Use ML techniques
More informationReinforcement Learning. Machine Learning, Fall 2010
Reinforcement Learning Machine Learning, Fall 2010 1 Administrativia This week: finish RL, most likely start graphical models LA2: due on Thursday LA3: comes out on Thursday TA Office hours: Today 1:30-2:30
More informationCMU Lecture 12: Reinforcement Learning. Teacher: Gianni A. Di Caro
CMU 15-781 Lecture 12: Reinforcement Learning Teacher: Gianni A. Di Caro REINFORCEMENT LEARNING Transition Model? State Action Reward model? Agent Goal: Maximize expected sum of future rewards 2 MDP PLANNING
More informationApproximation Methods in Reinforcement Learning
2018 CS420, Machine Learning, Lecture 12 Approximation Methods in Reinforcement Learning Weinan Zhang Shanghai Jiao Tong University http://wnzhang.net http://wnzhang.net/teaching/cs420/index.html Reinforcement
More information15-780: ReinforcementLearning
15-780: ReinforcementLearning J. Zico Kolter March 2, 2016 1 Outline Challenge of RL Model-based methods Model-free methods Exploration and exploitation 2 Outline Challenge of RL Model-based methods Model-free
More informationReinforcement Learning
Reinforcement Learning Function approximation Daniel Hennes 19.06.2017 University Stuttgart - IPVS - Machine Learning & Robotics 1 Today Eligibility traces n-step TD returns Forward and backward view Function
More informationReinforcement. Function Approximation. Learning with KATJA HOFMANN. Researcher, MSR Cambridge
Reinforcement Learning with Function Approximation KATJA HOFMANN Researcher, MSR Cambridge Representation and Generalization in RL Focus on training stability Learning generalizable value functions Navigating
More informationDeep Reinforcement Learning. Scratching the surface
Deep Reinforcement Learning Scratching the surface Deep Reinforcement Learning Scenario of Reinforcement Learning Observation State Agent Action Change the environment Don t do that Reward Environment
More informationCS599 Lecture 1 Introduction To RL
CS599 Lecture 1 Introduction To RL Reinforcement Learning Introduction Learning from rewards Policies Value Functions Rewards Models of the Environment Exploitation vs. Exploration Dynamic Programming
More informationLecture 25: Learning 4. Victor R. Lesser. CMPSCI 683 Fall 2010
Lecture 25: Learning 4 Victor R. Lesser CMPSCI 683 Fall 2010 Final Exam Information Final EXAM on Th 12/16 at 4:00pm in Lederle Grad Res Ctr Rm A301 2 Hours but obviously you can leave early! Open Book
More informationReview: TD-Learning. TD (SARSA) Learning for Q-values. Bellman Equations for Q-values. P (s, a, s )[R(s, a, s )+ Q (s, (s ))]
Review: TD-Learning function TD-Learning(mdp) returns a policy Class #: Reinforcement Learning, II 8s S, U(s) =0 set start-state s s 0 choose action a, using -greedy policy based on U(s) U(s) U(s)+ [r
More informationCS885 Reinforcement Learning Lecture 7a: May 23, 2018
CS885 Reinforcement Learning Lecture 7a: May 23, 2018 Policy Gradient Methods [SutBar] Sec. 13.1-13.3, 13.7 [SigBuf] Sec. 5.1-5.2, [RusNor] Sec. 21.5 CS885 Spring 2018 Pascal Poupart 1 Outline Stochastic
More informationMultiagent (Deep) Reinforcement Learning
Multiagent (Deep) Reinforcement Learning MARTIN PILÁT (MARTIN.PILAT@MFF.CUNI.CZ) Reinforcement learning The agent needs to learn to perform tasks in environment No prior knowledge about the effects of
More informationReinforcement Learning. Introduction
Reinforcement Learning Introduction Reinforcement Learning Agent interacts and learns from a stochastic environment Science of sequential decision making Many faces of reinforcement learning Optimal control
More informationReinforcement Learning
Reinforcement Learning Function approximation Mario Martin CS-UPC May 18, 2018 Mario Martin (CS-UPC) Reinforcement Learning May 18, 2018 / 65 Recap Algorithms: MonteCarlo methods for Policy Evaluation
More informationLecture 18: Reinforcement Learning Sanjeev Arora Elad Hazan
COS 402 Machine Learning and Artificial Intelligence Fall 2016 Lecture 18: Reinforcement Learning Sanjeev Arora Elad Hazan Some slides borrowed from Peter Bodik and David Silver Course progress Learning
More informationReinforcement Learning. George Konidaris
Reinforcement Learning George Konidaris gdk@cs.brown.edu Fall 2017 Machine Learning Subfield of AI concerned with learning from data. Broadly, using: Experience To Improve Performance On Some Task (Tom
More informationAdministration. CSCI567 Machine Learning (Fall 2018) Outline. Outline. HW5 is available, due on 11/18. Practice final will also be available soon.
Administration CSCI567 Machine Learning Fall 2018 Prof. Haipeng Luo U of Southern California Nov 7, 2018 HW5 is available, due on 11/18. Practice final will also be available soon. Remaining weeks: 11/14,
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Reinforcement Learning Instructor: Fabrice Popineau [These slides adapted from Stuart Russell, Dan Klein and Pieter Abbeel @ai.berkeley.edu] Reinforcement Learning Double
More informationLearning Control for Air Hockey Striking using Deep Reinforcement Learning
Learning Control for Air Hockey Striking using Deep Reinforcement Learning Ayal Taitler, Nahum Shimkin Faculty of Electrical Engineering Technion - Israel Institute of Technology May 8, 2017 A. Taitler,
More informationARTIFICIAL INTELLIGENCE. Reinforcement learning
INFOB2KI 2018-2019 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Reinforcement learning Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from www.cs.uu.nl/docs/vakken/b2ki/schema.html
More informationChristopher Watkins and Peter Dayan. Noga Zaslavsky. The Hebrew University of Jerusalem Advanced Seminar in Deep Learning (67679) November 1, 2015
Q-Learning Christopher Watkins and Peter Dayan Noga Zaslavsky The Hebrew University of Jerusalem Advanced Seminar in Deep Learning (67679) November 1, 2015 Noga Zaslavsky Q-Learning (Watkins & Dayan, 1992)
More informationReinforcement Learning II. George Konidaris
Reinforcement Learning II George Konidaris gdk@cs.brown.edu Fall 2017 Reinforcement Learning π : S A max R = t=0 t r t MDPs Agent interacts with an environment At each time t: Receives sensor signal Executes
More informationIntroduction of Reinforcement Learning
Introduction of Reinforcement Learning Deep Reinforcement Learning Reference Textbook: Reinforcement Learning: An Introduction http://incompleteideas.net/sutton/book/the-book.html Lectures of David Silver
More informationToday s s Lecture. Applicability of Neural Networks. Back-propagation. Review of Neural Networks. Lecture 20: Learning -4. Markov-Decision Processes
Today s s Lecture Lecture 20: Learning -4 Review of Neural Networks Markov-Decision Processes Victor Lesser CMPSCI 683 Fall 2004 Reinforcement learning 2 Back-propagation Applicability of Neural Networks
More informationQ-learning. Tambet Matiisen
Q-learning Tambet Matiisen (based on chapter 11.3 of online book Artificial Intelligence, foundations of computational agents by David Poole and Alan Mackworth) Stochastic gradient descent Experience
More informationReinforcement Learning and NLP
1 Reinforcement Learning and NLP Kapil Thadani kapil@cs.columbia.edu RESEARCH Outline 2 Model-free RL Markov decision processes (MDPs) Derivative-free optimization Policy gradients Variance reduction Value
More informationReinforcement Learning II. George Konidaris
Reinforcement Learning II George Konidaris gdk@cs.brown.edu Fall 2018 Reinforcement Learning π : S A max R = t=0 t r t MDPs Agent interacts with an environment At each time t: Receives sensor signal Executes
More informationReinforcement Learning
Reinforcement Learning Cyber Rodent Project Some slides from: David Silver, Radford Neal CSC411: Machine Learning and Data Mining, Winter 2017 Michael Guerzhoy 1 Reinforcement Learning Supervised learning:
More informationLecture 10 - Planning under Uncertainty (III)
Lecture 10 - Planning under Uncertainty (III) Jesse Hoey School of Computer Science University of Waterloo March 27, 2018 Readings: Poole & Mackworth (2nd ed.)chapter 12.1,12.3-12.9 1/ 34 Reinforcement
More informationProximal Policy Optimization (PPO)
Proximal Policy Optimization (PPO) default reinforcement learning algorithm at OpenAI Policy Gradient On-policy Off-policy Add constraint DeepMind https://youtu.be/gn4nrcc9twq OpenAI https://blog.openai.com/o
More informationReinforcement Learning and Control
CS9 Lecture notes Andrew Ng Part XIII Reinforcement Learning and Control We now begin our study of reinforcement learning and adaptive control. In supervised learning, we saw algorithms that tried to make
More informationMARKOV DECISION PROCESSES (MDP) AND REINFORCEMENT LEARNING (RL) Versione originale delle slide fornita dal Prof. Francesco Lo Presti
1 MARKOV DECISION PROCESSES (MDP) AND REINFORCEMENT LEARNING (RL) Versione originale delle slide fornita dal Prof. Francesco Lo Presti Historical background 2 Original motivation: animal learning Early
More informationReinforcement learning an introduction
Reinforcement learning an introduction Prof. Dr. Ann Nowé Computational Modeling Group AIlab ai.vub.ac.be November 2013 Reinforcement Learning What is it? Learning from interaction Learning about, from,
More informationDeep Reinforcement Learning: Policy Gradients and Q-Learning
Deep Reinforcement Learning: Policy Gradients and Q-Learning John Schulman Bay Area Deep Learning School September 24, 2016 Introduction and Overview Aim of This Talk What is deep RL, and should I use
More informationINTRODUCTION TO EVOLUTION STRATEGY ALGORITHMS. James Gleeson Eric Langlois William Saunders
INTRODUCTION TO EVOLUTION STRATEGY ALGORITHMS James Gleeson Eric Langlois William Saunders REINFORCEMENT LEARNING CHALLENGES f(θ) is a discrete function of theta How do we get a gradient θ f? Credit assignment
More informationTrust Region Policy Optimization
Trust Region Policy Optimization Yixin Lin Duke University yixin.lin@duke.edu March 28, 2017 Yixin Lin (Duke) TRPO March 28, 2017 1 / 21 Overview 1 Preliminaries Markov Decision Processes Policy iteration
More informationLearning Dexterity Matthias Plappert SEPTEMBER 6, 2018
Learning Dexterity Matthias Plappert SEPTEMBER 6, 2018 OpenAI OpenAI is a non-profit AI research company, discovering and enacting the path to safe artificial general intelligence. OpenAI OpenAI is a non-profit
More informationDeep Reinforcement Learning
Martin Matyášek Artificial Intelligence Center Czech Technical University in Prague October 27, 2016 Martin Matyášek VPD, 2016 1 / 50 Reinforcement Learning in a picture R. S. Sutton and A. G. Barto 2015
More informationLecture 9: Policy Gradient II 1
Lecture 9: Policy Gradient II 1 Emma Brunskill CS234 Reinforcement Learning. Winter 2019 Additional reading: Sutton and Barto 2018 Chp. 13 1 With many slides from or derived from David Silver and John
More informationProf. Dr. Ann Nowé. Artificial Intelligence Lab ai.vub.ac.be
REINFORCEMENT LEARNING AN INTRODUCTION Prof. Dr. Ann Nowé Artificial Intelligence Lab ai.vub.ac.be REINFORCEMENT LEARNING WHAT IS IT? What is it? Learning from interaction Learning about, from, and while
More informationValue Function Methods. CS : Deep Reinforcement Learning Sergey Levine
Value Function Methods CS 294-112: Deep Reinforcement Learning Sergey Levine Class Notes 1. Homework 2 is due in one week 2. Remember to start forming final project groups and writing your proposal! Proposal
More informationLecture 3: The Reinforcement Learning Problem
Lecture 3: The Reinforcement Learning Problem Objectives of this lecture: describe the RL problem we will be studying for the remainder of the course present idealized form of the RL problem for which
More informationPolicy Gradient Methods. February 13, 2017
Policy Gradient Methods February 13, 2017 Policy Optimization Problems maximize E π [expression] π Fixed-horizon episodic: T 1 Average-cost: lim T 1 T r t T 1 r t Infinite-horizon discounted: γt r t Variable-length
More informationMachine Learning and Bayesian Inference. Unsupervised learning. Can we find regularity in data without the aid of labels?
Machine Learning and Bayesian Inference Dr Sean Holden Computer Laboratory, Room FC6 Telephone extension 6372 Email: sbh11@cl.cam.ac.uk www.cl.cam.ac.uk/ sbh11/ Unsupervised learning Can we find regularity
More informationReinforcement Learning and Deep Reinforcement Learning
Reinforcement Learning and Deep Reinforcement Learning Ashis Kumer Biswas, Ph.D. ashis.biswas@ucdenver.edu Deep Learning November 5, 2018 1 / 64 Outlines 1 Principles of Reinforcement Learning 2 The Q
More informationMarks. bonus points. } Assignment 1: Should be out this weekend. } Mid-term: Before the last lecture. } Mid-term deferred exam:
Marks } Assignment 1: Should be out this weekend } All are marked, I m trying to tally them and perhaps add bonus points } Mid-term: Before the last lecture } Mid-term deferred exam: } This Saturday, 9am-10.30am,
More informationGrundlagen der Künstlichen Intelligenz
Grundlagen der Künstlichen Intelligenz Reinforcement learning II Daniel Hennes 11.12.2017 (WS 2017/18) University Stuttgart - IPVS - Machine Learning & Robotics 1 Today Eligibility traces n-step TD returns
More informationLecture 7: Value Function Approximation
Lecture 7: Value Function Approximation Joseph Modayil Outline 1 Introduction 2 3 Batch Methods Introduction Large-Scale Reinforcement Learning Reinforcement learning can be used to solve large problems,
More informationVariance Reduction for Policy Gradient Methods. March 13, 2017
Variance Reduction for Policy Gradient Methods March 13, 2017 Reward Shaping Reward Shaping Reward Shaping Reward shaping: r(s, a, s ) = r(s, a, s ) + γφ(s ) Φ(s) for arbitrary potential Φ Theorem: r admits
More informationLecture 23: Reinforcement Learning
Lecture 23: Reinforcement Learning MDPs revisited Model-based learning Monte Carlo value function estimation Temporal-difference (TD) learning Exploration November 23, 2006 1 COMP-424 Lecture 23 Recall:
More informationCS 4100 // artificial intelligence. Recap/midterm review!
CS 4100 // artificial intelligence instructor: byron wallace Recap/midterm review! Attribution: many of these slides are modified versions of those distributed with the UC Berkeley CS188 materials Thanks
More informationReinforcement Learning
Reinforcement Learning Policy Search: Actor-Critic and Gradient Policy search Mario Martin CS-UPC May 28, 2018 Mario Martin (CS-UPC) Reinforcement Learning May 28, 2018 / 63 Goal of this lecture So far
More information15-780: Graduate Artificial Intelligence. Reinforcement learning (RL)
15-780: Graduate Artificial Intelligence Reinforcement learning (RL) From MDPs to RL We still use the same Markov model with rewards and actions But there are a few differences: 1. We do not assume we
More informationReinforcement Learning Active Learning
Reinforcement Learning Active Learning Alan Fern * Based in part on slides by Daniel Weld 1 Active Reinforcement Learning So far, we ve assumed agent has a policy We just learned how good it is Now, suppose
More informationREINFORCE Framework for Stochastic Policy Optimization and its use in Deep Learning
REINFORCE Framework for Stochastic Policy Optimization and its use in Deep Learning Ronen Tamari The Hebrew University of Jerusalem Advanced Seminar in Deep Learning (#67679) February 28, 2016 Ronen Tamari
More informationCS Machine Learning Qualifying Exam
CS Machine Learning Qualifying Exam Georgia Institute of Technology March 30, 2017 The exam is divided into four areas: Core, Statistical Methods and Models, Learning Theory, and Decision Processes. There
More informationChapter 3: The Reinforcement Learning Problem
Chapter 3: The Reinforcement Learning Problem Objectives of this chapter: describe the RL problem we will be studying for the remainder of the course present idealized form of the RL problem for which
More informationLecture 9: Policy Gradient II (Post lecture) 2
Lecture 9: Policy Gradient II (Post lecture) 2 Emma Brunskill CS234 Reinforcement Learning. Winter 2018 Additional reading: Sutton and Barto 2018 Chp. 13 2 With many slides from or derived from David Silver
More informationReinforcement Learning
Reinforcement Learning Temporal Difference Learning Temporal difference learning, TD prediction, Q-learning, elibigility traces. (many slides from Marc Toussaint) Vien Ngo Marc Toussaint University of
More informationReinforcement Learning. Spring 2018 Defining MDPs, Planning
Reinforcement Learning Spring 2018 Defining MDPs, Planning understandability 0 Slide 10 time You are here Markov Process Where you will go depends only on where you are Markov Process: Information state
More information6 Reinforcement Learning
6 Reinforcement Learning As discussed above, a basic form of supervised learning is function approximation, relating input vectors to output vectors, or, more generally, finding density functions p(y,
More information<Special Topics in VLSI> Learning for Deep Neural Networks (Back-propagation)
Learning for Deep Neural Networks (Back-propagation) Outline Summary of Previous Standford Lecture Universal Approximation Theorem Inference vs Training Gradient Descent Back-Propagation
More informationReinforcement Learning for NLP
Reinforcement Learning for NLP Advanced Machine Learning for NLP Jordan Boyd-Graber REINFORCEMENT OVERVIEW, POLICY GRADIENT Adapted from slides by David Silver, Pieter Abbeel, and John Schulman Advanced
More informationChapter 3: The Reinforcement Learning Problem
Chapter 3: The Reinforcement Learning Problem Objectives of this chapter: describe the RL problem we will be studying for the remainder of the course present idealized form of the RL problem for which
More informationBalancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm
Balancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm Michail G. Lagoudakis Department of Computer Science Duke University Durham, NC 2778 mgl@cs.duke.edu
More informationPayments System Design Using Reinforcement Learning: A Progress Report
Payments System Design Using Reinforcement Learning: A Progress Report A. Desai 1 H. Du 1 R. Garratt 2 F. Rivadeneyra 1 1 Bank of Canada 2 University of California Santa Barbara 16th Payment and Settlement
More informationMachine Learning. Machine Learning: Jordan Boyd-Graber University of Maryland REINFORCEMENT LEARNING. Slides adapted from Tom Mitchell and Peter Abeel
Machine Learning Machine Learning: Jordan Boyd-Graber University of Maryland REINFORCEMENT LEARNING Slides adapted from Tom Mitchell and Peter Abeel Machine Learning: Jordan Boyd-Graber UMD Machine Learning
More informationDeep Learning. What Is Deep Learning? The Rise of Deep Learning. Long History (in Hind Sight)
CSCE 636 Neural Networks Instructor: Yoonsuck Choe Deep Learning What Is Deep Learning? Learning higher level abstractions/representations from data. Motivation: how the brain represents sensory information
More informationCOMP9444 Neural Networks and Deep Learning 10. Deep Reinforcement Learning. COMP9444 c Alan Blair, 2017
COMP9444 Neural Networks and Deep Learning 10. Deep Reinforcement Learning COMP9444 17s2 Deep Reinforcement Learning 1 Outline History of Reinforcement Learning Deep Q-Learning for Atari Games Actor-Critic
More informationDeep Learning. What Is Deep Learning? The Rise of Deep Learning. Long History (in Hind Sight)
CSCE 636 Neural Networks Instructor: Yoonsuck Choe Deep Learning What Is Deep Learning? Learning higher level abstractions/representations from data. Motivation: how the brain represents sensory information
More informationCS 598 Statistical Reinforcement Learning. Nan Jiang
CS 598 Statistical Reinforcement Learning Nan Jiang Overview What s this course about? A grad-level seminar course on theory of RL 3 What s this course about? A grad-level seminar course on theory of RL
More informationVariational Deep Q Network
Variational Deep Q Network Yunhao Tang Department of IEOR Columbia University yt2541@columbia.edu Alp Kucukelbir Department of Computer Science Columbia University alp@cs.columbia.edu Abstract We propose
More informationMarkov Decision Processes Chapter 17. Mausam
Markov Decision Processes Chapter 17 Mausam Planning Agent Static vs. Dynamic Fully vs. Partially Observable Environment What action next? Deterministic vs. Stochastic Perfect vs. Noisy Instantaneous vs.
More informationReinforcement Learning
Reinforcement Learning From the basics to Deep RL Olivier Sigaud ISIR, UPMC + INRIA http://people.isir.upmc.fr/sigaud September 14, 2017 1 / 54 Introduction Outline Some quick background about discrete
More informationCOMP3702/7702 Artificial Intelligence Lecture 11: Introduction to Machine Learning and Reinforcement Learning. Hanna Kurniawati
COMP3702/7702 Artificial Intelligence Lecture 11: Introduction to Machine Learning and Reinforcement Learning Hanna Kurniawati Today } What is machine learning? } Where is it used? } Types of machine learning
More informationToday s Outline. Recap: MDPs. Bellman Equations. Q-Value Iteration. Bellman Backup 5/7/2012. CSE 473: Artificial Intelligence Reinforcement Learning
CSE 473: Artificial Intelligence Reinforcement Learning Dan Weld Today s Outline Reinforcement Learning Q-value iteration Q-learning Exploration / exploitation Linear function approximation Many slides
More informationNatural Language Processing. Slides from Andreas Vlachos, Chris Manning, Mihai Surdeanu
Natural Language Processing Slides from Andreas Vlachos, Chris Manning, Mihai Surdeanu Projects Project descriptions due today! Last class Sequence to sequence models Attention Pointer networks Today Weak
More informationDeep Learning Lab Course 2017 (Deep Learning Practical)
Deep Learning Lab Course 207 (Deep Learning Practical) Labs: (Computer Vision) Thomas Brox, (Robotics) Wolfram Burgard, (Machine Learning) Frank Hutter, (Neurorobotics) Joschka Boedecker University of
More informationReinforcement Learning
CS7/CS7 Fall 005 Supervised Learning: Training examples: (x,y) Direct feedback y for each input x Sequence of decisions with eventual feedback No teacher that critiques individual actions Learn to act
More informationROB 537: Learning-Based Control. Announcements: Project background due Today. HW 3 Due on 10/30 Midterm Exam on 11/6.
ROB 537: Learning-Based Control Week 5, Lecture 1 Policy Gradient, Eligibility Traces, Transfer Learning (MaC Taylor Announcements: Project background due Today HW 3 Due on 10/30 Midterm Exam on 11/6 Reading:
More information