An Introduction to Reinforcement Learning
|
|
- Maria Flowers
- 5 years ago
- Views:
Transcription
1 An Introduction to Reinforcement Learning Shivaram Kalyanakrishnan Department of Computer Science and Engineering Indian Institute of Technology Bombay April 2018
2 What is Reinforcement Learning? Shivaram Kalyanakrishnan 1/21
3 What is Reinforcement Learning? [Video 1 of toddler learning to walk] 1. Shivaram Kalyanakrishnan 1/21
4 What is Reinforcement Learning? [Video 1 of toddler learning to walk] 1. Shivaram Kalyanakrishnan 1/21
5 What is Reinforcement Learning? [Video 1 of toddler learning to walk] Learning to Drive a Bicycle using Reinforcement Learning and Shaping Jette Randløv and Preben Alstrøm. ICML Shivaram Kalyanakrishnan 1/21
6 What is Reinforcement Learning? [Video 1 of toddler learning to walk] Learning to Drive a Bicycle using Reinforcement Learning and Shaping Jette Randløv and Preben Alstrøm. ICML Learning by trial and error to perform sequential decision making Shivaram Kalyanakrishnan 1/21
7 Our View of Reinforcement Learning Operations Research (Dynamic Programming) Control Theory Psychology (Animal Behaviour) Reinforcement Learning Neuroscience Artificial Intelligence and Computer Science Shivaram Kalyanakrishnan 2/21
8 Our View of Reinforcement Learning Operations Research (Dynamic Programming) Control Theory Psychology (Animal Behaviour) Reinforcement Learning Neuroscience Artificial Intelligence and Computer Science B. F. Skinner Shivaram Kalyanakrishnan 2/21
9 Our View of Reinforcement Learning R. E. Bellman Operations Research (Dynamic Programming) Control Theory Psychology (Animal Behaviour) Reinforcement Learning Neuroscience Artificial Intelligence and Computer Science B. F. Skinner Shivaram Kalyanakrishnan 2/21
10 Our View of Reinforcement Learning R. E. Bellman Operations Research (Dynamic Programming) Control Theory D. P. Bertsekas Psychology (Animal Behaviour) Reinforcement Learning Neuroscience Artificial Intelligence and Computer Science B. F. Skinner Shivaram Kalyanakrishnan 2/21
11 Our View of Reinforcement Learning R. E. Bellman Operations Research (Dynamic Programming) Control Theory D. P. Bertsekas Psychology (Animal Behaviour) Reinforcement Learning Neuroscience Artificial Intelligence and Computer Science B. F. Skinner W. Schultz Shivaram Kalyanakrishnan 2/21
12 Our View of Reinforcement Learning R. E. Bellman Operations Research (Dynamic Programming) Control Theory D. P. Bertsekas Psychology (Animal Behaviour) Reinforcement Learning Neuroscience Artificial Intelligence and Computer Science B. F. Skinner W. Schultz R. S. Sutton Shivaram Kalyanakrishnan 2/21
13 Resources Reinforcement Learning: A Survey. Leslie Pack Kaelbling, Michael L. Littman, and Andrew W. Moore. JAIR Shivaram Kalyanakrishnan 3/21
14 Resources Reinforcement Learning: A Survey. Leslie Pack Kaelbling, Michael L. Littman, and Andrew W. Moore. JAIR Reinforcement Learning: An Introduction Richard S. Sutton and Andrew G. Barto. MIT Press, ( draft also now on-line). Algorithms for Reinforcement Learning Csaba Szepesvári. Morgan & Claypool, Shivaram Kalyanakrishnan 3/21
15 Today s Class 1. Markov Decision Problems 2. Planning and learning 3. Deep Reinforcement Learning 4. Summary Shivaram Kalyanakrishnan 4/21
16 Today s Class 1. Markov Decision Problems 2. Planning and learning 3. Deep Reinforcement Learning 4. Summary Shivaram Kalyanakrishnan 4/21
17 Markov Decision Problem s t+1 r t+1 ENVIRONMENT T R state s t reward r t LEARNING AGENT action a t π : S A S: set of states. A: set of actions. T : transition function. s S, a A, T (s, a) is a distribution over S. R: reward function. s, s S, a A, R(s, a, s ) is a finite real number. γ: discount factor. 0 γ < 1. Shivaram Kalyanakrishnan 5/21
18 Markov Decision Problem s t+1 r t+1 ENVIRONMENT T R state s t reward r t LEARNING AGENT action a t π : S A S: set of states. A: set of actions. T : transition function. s S, a A, T (s, a) is a distribution over S. R: reward function. s, s S, a A, R(s, a, s ) is a finite real number. γ: discount factor. 0 γ < 1. Trajectory over time: s 0, a 0, r 0, s 1, a 1, r 1,..., s t, a t, r t, s t+1,.... Shivaram Kalyanakrishnan 5/21
19 Markov Decision Problem s t+1 r t+1 ENVIRONMENT T R state s t reward r t LEARNING AGENT action a t π : S A S: set of states. A: set of actions. T : transition function. s S, a A, T (s, a) is a distribution over S. R: reward function. s, s S, a A, R(s, a, s ) is a finite real number. γ: discount factor. 0 γ < 1. Trajectory over time: s 0, a 0, r 0, s 1, a 1, r 1,..., s t, a t, r t, s t+1,.... Value, or expected long-term reward, of state s under policy π: V π (s) = E[r 0 + γr 1 + γ 2 r to s 0 = s, a i = π(s i )]. Shivaram Kalyanakrishnan 5/21
20 Markov Decision Problem s t+1 r t+1 ENVIRONMENT T R state s t reward r t LEARNING AGENT action a t π : S A S: set of states. A: set of actions. T : transition function. s S, a A, T (s, a) is a distribution over S. R: reward function. s, s S, a A, R(s, a, s ) is a finite real number. γ: discount factor. 0 γ < 1. Trajectory over time: s 0, a 0, r 0, s 1, a 1, r 1,..., s t, a t, r t, s t+1,.... Value, or expected long-term reward, of state s under policy π: V π (s) = E[r 0 + γr 1 + γ 2 r to s 0 = s, a i = π(s i )]. Objective: Find π such that V π (s) is maximal s S. Shivaram Kalyanakrishnan 5/21
21 Examples What are the agent and environment? What are S, A, T, and R? Shivaram Kalyanakrishnan 6/21
22 Examples What are the agent and environment? What are S, A, T, and R? 1. Shivaram Kalyanakrishnan 6/21
23 Examples What are the agent and environment? What are S, A, T, and R? An Application of Reinforcement Learning to Aerobatic Helicopter Flight Pieter Abbeel, Adam Coates, Morgan Quigley, and Andrew Y. Ng. NIPS SH-3-Sea-King-helicopter-191.preview.jpg Shivaram Kalyanakrishnan 6/21
24 Examples What are the agent and environment? What are S, A, T, and R? [Video 3 of Tetris] An Application of Reinforcement Learning to Aerobatic Helicopter Flight Pieter Abbeel, Adam Coates, Morgan Quigley, and Andrew Y. Ng. NIPS SH-3-Sea-King-helicopter-191.preview.jpg 3. Shivaram Kalyanakrishnan 6/21
25 Today s Class 1. Markov decision problems 2. Planning and learning 3. Deep Reinforcement Learning 4. Summary Shivaram Kalyanakrishnan 7/21
26 Bellman s Equations Recall that V π (s) = E[r 0 + γr 1 + γ 2 r s 0 = s, a i = π(s i )]. Bellman s Equations ( s S): V π (s) = s S T (s, π(s), s ) [R(s, π(s), s ) + γv π (s )]. V π is called the value function of π. Shivaram Kalyanakrishnan 8/21
27 Bellman s Equations Recall that V π (s) = E[r 0 + γr 1 + γ 2 r s 0 = s, a i = π(s i )]. Bellman s Equations ( s S): V π (s) = s S T (s, π(s), s ) [R(s, π(s), s ) + γv π (s )]. V π is called the value function of π. Define ( s S, a A): Q π (s, a) = s S T (s, a, s ) [R(s, a, s ) + γv π (s )]. Q π is called the action value function of π. V π (s) = Q π (s, π(s)). Shivaram Kalyanakrishnan 8/21
28 Bellman s Equations Recall that V π (s) = E[r 0 + γr 1 + γ 2 r s 0 = s, a i = π(s i )]. Bellman s Equations ( s S): V π (s) = s S T (s, π(s), s ) [R(s, π(s), s ) + γv π (s )]. V π is called the value function of π. Define ( s S, a A): Q π (s, a) = s S T (s, a, s ) [R(s, a, s ) + γv π (s )]. Q π is called the action value function of π. V π (s) = Q π (s, π(s)). The variables in Bellman s Equations are the V π (s). S linear equations in S unknowns. Shivaram Kalyanakrishnan 8/21
29 Bellman s Equations Recall that V π (s) = E[r 0 + γr 1 + γ 2 r s 0 = s, a i = π(s i )]. Bellman s Equations ( s S): V π (s) = s S T (s, π(s), s ) [R(s, π(s), s ) + γv π (s )]. V π is called the value function of π. Define ( s S, a A): Q π (s, a) = s S T (s, a, s ) [R(s, a, s ) + γv π (s )]. Q π is called the action value function of π. V π (s) = Q π (s, π(s)). The variables in Bellman s Equations are the V π (s). S linear equations in S unknowns. Thus, given S, A, T, R, γ, and a fixed policy π, we can solve Bellman s equations efficiently to obtain, s S, a A, V π (s) and Q π (s, a). Shivaram Kalyanakrishnan 8/21
30 Bellman s Optimality Equations Let Π be the set of all policies. What is its cardinality? Shivaram Kalyanakrishnan 9/21
31 Bellman s Optimality Equations Let Π be the set of all policies. What is its cardinality? It can be shown that there exists a policy π Π such that π Π s S: V π (s) V π (s). V π is denoted V, and Q π is denoted Q. There could be multiple optimal policies π, but V and Q are unique. Shivaram Kalyanakrishnan 9/21
32 Bellman s Optimality Equations Let Π be the set of all policies. What is its cardinality? It can be shown that there exists a policy π Π such that π Π s S: V π (s) V π (s). V π is denoted V, and Q π is denoted Q. There could be multiple optimal policies π, but V and Q are unique. Bellman s Optimality Equations ( s S): V (s) = max a A s S T (s, a, s ) [R(s, a, s ) + γv (s )]. Shivaram Kalyanakrishnan 9/21
33 Bellman s Optimality Equations Let Π be the set of all policies. What is its cardinality? It can be shown that there exists a policy π Π such that π Π s S: V π (s) V π (s). V π is denoted V, and Q π is denoted Q. There could be multiple optimal policies π, but V and Q are unique. Bellman s Optimality Equations ( s S): V (s) = max a A s S T (s, a, s ) [R(s, a, s ) + γv (s )]. V can be computed up to arbitrary precision using Value Iteration. Shivaram Kalyanakrishnan 9/21
34 Planning and Learning Planning problem: Given S, A, T, R, γ, how can we find an optimal policy π? We need to be computationally efficient. Shivaram Kalyanakrishnan 10/21
35 Planning and Learning Planning problem: Given S, A, T, R, γ, how can we find an optimal policy π? We need to be computationally efficient. Learning problem: Given S, A, γ, and the facility to follow a trajectory by sampling from T and R, how can we find an optimal policy π? We need to be sampleefficient. Shivaram Kalyanakrishnan 10/21
36 The Learning Problem Shivaram Kalyanakrishnan 11/21
37 The Learning Problem Shivaram Kalyanakrishnan 11/21
38 The Learning Problem Shivaram Kalyanakrishnan 11/21
39 The Learning Problem Shivaram Kalyanakrishnan 11/21
40 The Learning Problem Shivaram Kalyanakrishnan 11/21
41 The Learning Problem Shivaram Kalyanakrishnan 11/21
42 The Learning Problem r 0 = 1. Shivaram Kalyanakrishnan 11/21
43 The Learning Problem r 0 = 1. r 1 = 2. Shivaram Kalyanakrishnan 11/21
44 The Learning Problem r 0 = 1. r 1 = 2. r 2 = 10. Shivaram Kalyanakrishnan 11/21
45 The Learning Problem r 0 = 1. r 1 = 2. r 2 = 10. How to take actions so as to maximise expected long-term reward E[r 0 + γr 1 + γ 2 r ]? Shivaram Kalyanakrishnan 11/21
46 The Learning Problem r 0 = 1. r 1 = 2. r 2 = 10. How to take actions so as to maximise expected long-term reward E[r 0 + γr 1 + γ 2 r ]? [Note that there exists an (unknown) optimal policy.] Shivaram Kalyanakrishnan 11/21
47 Q-Learning Keep a running estimate of the expected long-term reward obtained by taking each action from each state s, and acting optimally thereafter. Q red green Shivaram Kalyanakrishnan 12/21
48 Q-Learning Keep a running estimate of the expected long-term reward obtained by taking each action from each state s, and acting optimally thereafter. Q red green Update these estimates based on experience (s t, a t, r t, s t+1 ): Q(s t, a t ) Q(s t, a t ) + α t{r t + max a Q(s t+1, a) Q(s t, a t )}. Shivaram Kalyanakrishnan 12/21
49 Q-Learning Keep a running estimate of the expected long-term reward obtained by taking each action from each state s, and acting optimally thereafter. Q red green Update these estimates based on experience (s t, a t, r t, s t+1 ): Q(s t, a t ) Q(s t, a t ) + α t{r t + max a Q(s t+1, a) Q(s t, a t )}. Shivaram Kalyanakrishnan 12/21
50 Q-Learning Keep a running estimate of the expected long-term reward obtained by taking each action from each state s, and acting optimally thereafter. Q red green Update these estimates based on experience (s t, a t, r t, s t+1 ): Q(s t, a t ) Q(s t, a t ) + α t{r t + max a Q(s t+1, a) Q(s t, a t )}. Shivaram Kalyanakrishnan 12/21
51 Q-Learning Keep a running estimate of the expected long-term reward obtained by taking each action from each state s, and acting optimally thereafter. Q red green Update these estimates based on experience (s t, a t, r t, s t+1 ): Q(s t, a t ) Q(s t, a t ) + α t{r t + max a Q(s t+1, a) Q(s t, a t )}. Act greedily based on the estimates (exploit) most of the time, but still Make sure to explore each action enough times. Shivaram Kalyanakrishnan 12/21
52 Q-Learning Keep a running estimate of the expected long-term reward obtained by taking each action from each state s, and acting optimally thereafter. Q red green Update these estimates based on experience (s t, a t, r t, s t+1 ): Q(s t, a t ) Q(s t, a t ) + α t{r t + max a Q(s t+1, a) Q(s t, a t )}. Act greedily based on the estimates (exploit) most of the time, but still Make sure to explore each action enough times. Q-learning will converge and induce an optimal policy! Shivaram Kalyanakrishnan 12/21
53 Q-Learning Algorithm Let Q be our guess of Q : for every state s and action a, initialise Q(s, a) arbitrarily. We will start in some state s 0. For t = 0, 1, 2,... Take an action a t, chosen uniformly at random with probability ɛ, and to be argmax a Q(s t, a) with probability 1 ɛ. The environment will generate next state s t+1 and reward r t+1. Update: Q(s t, a t ) Q(s t, a t ) + α t (r t+1 + γ max a A Q(s t+1, a) Q(s t, a t )). [ɛ: parameter for ɛ-greedy exploration] [α t: learning rate] [r t+1 +γ max a A Q(s t+1, a) Q(s t, a t ): temporal difference prediction error] Shivaram Kalyanakrishnan 13/21
54 Q-Learning Algorithm Let Q be our guess of Q : for every state s and action a, initialise Q(s, a) arbitrarily. We will start in some state s 0. For t = 0, 1, 2,... Take an action a t, chosen uniformly at random with probability ɛ, and to be argmax a Q(s t, a) with probability 1 ɛ. The environment will generate next state s t+1 and reward r t+1. Update: Q(s t, a t ) Q(s t, a t ) + α t (r t+1 + γ max a A Q(s t+1, a) Q(s t, a t )). [ɛ: parameter for ɛ-greedy exploration] [α t: learning rate] [r t+1 +γ max a A Q(s t+1, a) Q(s t, a t ): temporal difference prediction error] For ɛ (0, 1] and α t = 1 t, it can be proven that as t, Q Q. Q-Learning Christopher J. C. H. Watkins and Peter Dayan. Machine Learning, Shivaram Kalyanakrishnan 13/21
55 Practice In Spite of the Theory! Task State State Policy Representation Aliasing Space (Number of features) Backgammon (T1992) Absent Discrete Neural network (198) Job-shop scheduling (ZD1995) Absent Discrete Neural network (20) Tetris (BT1906) Absent Discrete Linear (22) Elevator dispatching (CB1996) Present Continuous Neural network (46) Acrobot control (S1996) Absent Continuous Tile coding (4) Dynamic channel allocation (SB1997) Absent Discrete Linear (100 s) Active guidance of finless rocket (GM2003) Present Continuous Neural network (14) Fast quadrupedal locomotion (KS2004) Present Continuous Parameterized policy (12) Robot sensing strategy (KF2004) Present Continuous Linear (36) Helicopter control (NKJS2004) Present Continuous Neural network (10) Dynamic bipedal locomotion (TZS2004) Present Continuous Feedback control policy (2) Adaptive job routing/scheduling (WS2004) Present Discrete Tabular (4) Robot soccer keepaway (SSK2005) Present Continuous Tile coding (13) Robot obstacle negotiation (LSYSN2006) Present Continuous Linear (10) Optimized trade execution (NFK2007) Present Discrete Tabular (2-5) Blimp control (RPHB2007) Present Continuous Gaussian Process (2) 9 9 Go (SSM2007) Absent Discrete Linear ( 1.5 million) Ms. Pac-Man (SL2007) Absent Discrete Rule list (10) Autonomic resource allocation (TJDB2007) Present Continuous Neural network (2) General game playing (FB2008) Absent Discrete Tabular (part of state space) Soccer opponent hassling (GRT2009) Present Continuous Neural network (9) Adaptive epilepsy treatment (GVAP2008) Present Continuous Extremely rand. trees (114) Computer memory scheduling (IMMC2008) Absent Discrete Tile coding (6) Motor skills (PS2008) Present Continuous Motor primitive coeff. (100 s) Combustion Control (HNGK2009) Present Continuous Parameterized policy (2-3) Shivaram Kalyanakrishnan 14/21
56 Practice In Spite of the Theory! Task State State Policy Representation Aliasing Space (Number of features) Backgammon (T1992) Absent Discrete Neural network (198) Job-shop scheduling (ZD1995) Absent Discrete Neural network (20) Tetris (BT1906) Absent Discrete Linear (22) Elevator dispatching (CB1996) Present Continuous Neural network (46) Acrobot control (S1996) Absent Continuous Tile coding (4) Dynamic channel allocation (SB1997) Absent Discrete Linear (100 s) Active guidance of finless rocket (GM2003) Present Continuous Neural network (14) Fast quadrupedal locomotion (KS2004) Present Continuous Parameterized policy (12) Robot sensing strategy (KF2004) Present Continuous Linear (36) Helicopter control (NKJS2004) Present Continuous Neural network (10) Dynamic bipedal locomotion (TZS2004) Present Continuous Feedback control policy (2) Adaptive job routing/scheduling (WS2004) Present Discrete Tabular (4) Robot soccer keepaway (SSK2005) Present Continuous Tile coding (13) Robot obstacle negotiation (LSYSN2006) Present Continuous Linear (10) Optimized trade execution (NFK2007) Present Discrete Tabular (2-5) Blimp control (RPHB2007) Present Continuous Gaussian Process (2) 9 9 Go (SSM2007) Absent Discrete Linear ( 1.5 million) Ms. Pac-Man (SL2007) Absent Discrete Rule list (10) Autonomic resource allocation (TJDB2007) Present Continuous Neural network (2) General game playing (FB2008) Absent Discrete Tabular (part of state space) Soccer opponent hassling (GRT2009) Present Continuous Neural network (9) Adaptive epilepsy treatment (GVAP2008) Present Continuous Extremely rand. trees (114) Computer memory scheduling (IMMC2008) Absent Discrete Tile coding (6) Motor skills (PS2008) Present Continuous Motor primitive coeff. (100 s) Combustion Control (HNGK2009) Present Continuous Parameterized policy (2-3) Shivaram Kalyanakrishnan 14/21
57 Practice In Spite of the Theory! Task State State Policy Representation Aliasing Space (Number of features) Backgammon (T1992) Absent Discrete Neural network (198) Job-shop scheduling (ZD1995) Absent Discrete Neural network (20) Tetris (BT1906) Absent Discrete Linear (22) Elevator dispatching (CB1996) Present Continuous Neural network (46) Acrobot control (S1996) Absent Continuous Tile coding (4) Dynamic channel allocation (SB1997) Absent Discrete Linear (100 s) Active guidance of finless rocket (GM2003) Present Continuous Neural network (14) Fast quadrupedal locomotion (KS2004) Present Continuous Parameterized policy (12) Robot sensing strategy (KF2004) Present Continuous Linear (36) Helicopter control (NKJS2004) Present Continuous Neural network (10) Dynamic bipedal locomotion (TZS2004) Present Continuous Feedback control policy (2) Adaptive job routing/scheduling (WS2004) Present Discrete Tabular (4) Robot soccer keepaway (SSK2005) Present Continuous Tile coding (13) Robot obstacle negotiation (LSYSN2006) Present Continuous Linear (10) Optimized trade execution (NFK2007) Present Discrete Tabular (2-5) Blimp control (RPHB2007) Present Continuous Gaussian Process (2) 9 9 Go (SSM2007) Absent Discrete Linear ( 1.5 million) Ms. Pac-Man (SL2007) Absent Discrete Rule list (10) Autonomic resource allocation (TJDB2007) Present Continuous Neural network (2) General game playing (FB2008) Absent Discrete Tabular (part of state space) Soccer opponent hassling (GRT2009) Present Continuous Neural network (9) Adaptive epilepsy treatment (GVAP2008) Present Continuous Extremely rand. trees (114) Computer memory scheduling (IMMC2008) Absent Discrete Tile coding (6) Motor skills (PS2008) Present Continuous Motor primitive coeff. (100 s) Combustion Control (HNGK2009) Present Continuous Parameterized policy (2-3) Shivaram Kalyanakrishnan 14/21
58 Practice In Spite of the Theory! Task State State Policy Representation Aliasing Space (Number of features) Backgammon (T1992) Absent Discrete Neural network (198) Job-shop scheduling (ZD1995) Absent Discrete Neural network (20) Tetris (BT1906) Absent Discrete Linear (22) Elevator dispatching (CB1996) Present Continuous Neural network (46) Acrobot control (S1996) Absent Continuous Tile coding (4) Dynamic channel allocation (SB1997) Absent Discrete Linear (100 s) Active guidance of finless rocket (GM2003) Present Continuous Neural network (14) Fast quadrupedal locomotion (KS2004) Present Continuous Parameterized policy (12) Robot sensing strategy (KF2004) Present Continuous Linear (36) Helicopter control (NKJS2004) Present Continuous Neural network (10) Dynamic bipedal locomotion (TZS2004) Present Continuous Feedback control policy (2) Adaptive job routing/scheduling (WS2004) Present Discrete Tabular (4) Robot soccer keepaway (SSK2005) Present Continuous Tile coding (13) Robot obstacle negotiation (LSYSN2006) Present Continuous Linear (10) Optimized trade execution (NFK2007) Present Discrete Tabular (2-5) Blimp control (RPHB2007) Present Continuous Gaussian Process (2) 9 9 Go (SSM2007) Absent Discrete Linear ( 1.5 million) Ms. Pac-Man (SL2007) Absent Discrete Rule list (10) Autonomic resource allocation (TJDB2007) Present Continuous Neural network (2) General game playing (FB2008) Absent Discrete Tabular (part of state space) Soccer opponent hassling (GRT2009) Present Continuous Neural network (9) Adaptive epilepsy treatment (GVAP2008) Present Continuous Extremely rand. trees (114) Computer memory scheduling (IMMC2008) Absent Discrete Tile coding (6) Motor skills (PS2008) Present Continuous Motor primitive coeff. (100 s) Combustion Control (HNGK2009) Present Continuous Parameterized policy (2-3) Perfect representations (fully observable, enumerable states) are impractical. Shivaram Kalyanakrishnan 14/21
59 Today s Class 1. Markov Decision Problems 2. Planning and learning 3. Deep Reinforcement Learning 4. Summary Shivaram Kalyanakrishnan 15/21
60 Typical Neural Network-based Representation of Q 1. Shivaram Kalyanakrishnan 16/21
61 ATARI 2600 Games (MKSRVBGRFOPBSAKKWLH2015) [Breakout video 1 ] 1. Shivaram Kalyanakrishnan 17/21
62 ATARI 2600 Games (MKSRVBGRFOPBSAKKWLH2015) [Breakout video 1 ] 1. Shivaram Kalyanakrishnan 17/21
63 AlphaGo (SHMGSDSAPLDGNKSLLKGH2016) March 2016: DeepMind s program beats Go champion Lee Sedol Shivaram Kalyanakrishnan 18/21
64 AlphaGo (SHMGSDSAPLDGNKSLLKGH2016) 1. screen%20shot% %20at%2014.png Shivaram Kalyanakrishnan 18/21
65 Learning Algorithm: Batch Q-learning 1. Represent action value function Q as a neural network. 2. Gather data (on the simulator) by taking ɛ-greedy actions w.r.t. Q: (s 1, a 1, r 1, s 2, a 2, r 2, s 3, a 3, r 3,... s D, a D, r D, s D+1 ). 3. Train the network such that Q(s t, a t) r t + max a Q(s t+1, a). Go to 2. Shivaram Kalyanakrishnan 19/21
66 Learning Algorithm: Batch Q-learning 1. Represent action value function Q as a neural network. AlphaGo: Use both a policy network and an action value network. 2. Gather data (on the simulator) by taking ɛ-greedy actions w.r.t. Q: (s 1, a 1, r 1, s 2, a 2, r 2, s 3, a 3, r 3,... s D, a D, r D, s D+1 ). AlphaGo: Use Monte Carlo Tree Search for action selection 3. Train the network such that Q(s t, a t) r t + max a Q(s t+1, a). Go to 2. AlphaGo: Trained using self-play. Shivaram Kalyanakrishnan 19/21
67 Today s Class 1. Markov Decision Problems 2. Planning and learning 3. Deep Reinforcement Learning 4. Summary Shivaram Kalyanakrishnan 20/21
68 Summary Learning by trial and error to perform sequential decision making. Do not program behaviour! Rather, specify goals. Rich history, at confluence of several fields of study, firm foundation. Given an MDP (S, A, T, R, γ), we have to find a policy π : S A that yields high expected long-term reward from states. An optimal value function V exists, and it induces an optimal policy π (several optimal policies might exist). Under planning, we are given S, A, T, R, and γ. We may compute V and π using a dynamic programming algorithm such as policy iteration. In the learning context, we are given S, A, and γ: we may sample T and R in a sequential manner. We can still converge to V and π by applying a temporal difference learning method such as Q-learning. Limited in practice by quality of the representation used. Deep neural networks address the representation problem in some domains, and have yielded impressive results. Shivaram Kalyanakrishnan 21/21
An Introduction to Reinforcement Learning
An Introduction to Reinforcement Learning Shivaram Kalyanakrishnan shivaram@csa.iisc.ernet.in Department of Computer Science and Automation Indian Institute of Science August 2014 What is Reinforcement
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 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 informationTemporal Difference Learning & Policy Iteration
Temporal Difference Learning & Policy Iteration Advanced Topics in Reinforcement Learning Seminar WS 15/16 ±0 ±0 +1 by Tobias Joppen 03.11.2015 Fachbereich Informatik Knowledge Engineering Group Prof.
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 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 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 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 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 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: the basics
Reinforcement Learning: the basics Olivier Sigaud Université Pierre et Marie Curie, PARIS 6 http://people.isir.upmc.fr/sigaud August 6, 2012 1 / 46 Introduction Action selection/planning Learning by trial-and-error
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 informationGrundlagen der Künstlichen Intelligenz
Grundlagen der Künstlichen Intelligenz Reinforcement learning Daniel Hennes 4.12.2017 (WS 2017/18) University Stuttgart - IPVS - Machine Learning & Robotics 1 Today Reinforcement learning Model based and
More informationOpen Theoretical Questions in Reinforcement Learning
Open Theoretical Questions in Reinforcement Learning Richard S. Sutton AT&T Labs, Florham Park, NJ 07932, USA, sutton@research.att.com, www.cs.umass.edu/~rich Reinforcement learning (RL) concerns the problem
More informationIntroduction to Reinforcement Learning
Introduction to Reinforcement Learning Rémi Munos SequeL project: Sequential Learning http://researchers.lille.inria.fr/ munos/ INRIA Lille - Nord Europe Machine Learning Summer School, September 2011,
More informationMachine Learning I Reinforcement Learning
Machine Learning I Reinforcement Learning Thomas Rückstieß Technische Universität München December 17/18, 2009 Literature Book: Reinforcement Learning: An Introduction Sutton & Barto (free online version:
More informationReinforcement Learning (1)
Reinforcement Learning 1 Reinforcement Learning (1) Machine Learning 64-360, Part II Norman Hendrich University of Hamburg, Dept. of Informatics Vogt-Kölln-Str. 30, D-22527 Hamburg hendrich@informatik.uni-hamburg.de
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 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 informationReinforcement Learning
Reinforcement Learning Inverse Reinforcement Learning Inverse RL, behaviour cloning, apprenticeship learning, imitation learning. Vien Ngo Marc Toussaint University of Stuttgart Outline Introduction to
More informationReinforcement learning
Reinforcement learning Stuart Russell, UC Berkeley Stuart Russell, UC Berkeley 1 Outline Sequential decision making Dynamic programming algorithms Reinforcement learning algorithms temporal difference
More informationUniversity of Alberta
University of Alberta NEW REPRESENTATIONS AND APPROXIMATIONS FOR SEQUENTIAL DECISION MAKING UNDER UNCERTAINTY by Tao Wang A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment
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 informationAn Adaptive Clustering Method for Model-free Reinforcement Learning
An Adaptive Clustering Method for Model-free Reinforcement Learning Andreas Matt and Georg Regensburger Institute of Mathematics University of Innsbruck, Austria {andreas.matt, georg.regensburger}@uibk.ac.at
More informationMachine Learning. Reinforcement learning. Hamid Beigy. Sharif University of Technology. Fall 1396
Machine Learning Reinforcement learning Hamid Beigy Sharif University of Technology Fall 1396 Hamid Beigy (Sharif University of Technology) Machine Learning Fall 1396 1 / 32 Table of contents 1 Introduction
More informationTemporal difference learning
Temporal difference learning AI & Agents for IET Lecturer: S Luz http://www.scss.tcd.ie/~luzs/t/cs7032/ February 4, 2014 Recall background & assumptions Environment is a finite MDP (i.e. A and S are finite).
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 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 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
Reinforcement learning Based on [Kaelbling et al., 1996, Bertsekas, 2000] Bert Kappen Reinforcement learning Reinforcement learning is the problem faced by an agent that must learn behavior through trial-and-error
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 informationReinforcement Learning
Reinforcement Learning Markov decision process & Dynamic programming Evaluative feedback, value function, Bellman equation, optimality, Markov property, Markov decision process, dynamic programming, value
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 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 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 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 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 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 informationReinforcement Learning
1 Reinforcement Learning Chris Watkins Department of Computer Science Royal Holloway, University of London July 27, 2015 2 Plan 1 Why reinforcement learning? Where does this theory come from? Markov decision
More informationMDP Preliminaries. Nan Jiang. February 10, 2019
MDP Preliminaries Nan Jiang February 10, 2019 1 Markov Decision Processes In reinforcement learning, the interactions between the agent and the environment are often described by a Markov Decision Process
More informationBasics of reinforcement learning
Basics of reinforcement learning Lucian Buşoniu TMLSS, 20 July 2018 Main idea of reinforcement learning (RL) Learn a sequential decision policy to optimize the cumulative performance of an unknown system
More informationIntroduction to Reinforcement Learning. Part 5: Temporal-Difference Learning
Introduction to Reinforcement Learning Part 5: emporal-difference Learning What everybody should know about emporal-difference (D) learning Used to learn value functions without human input Learns a guess
More informationReinforcement Learning
Reinforcement Learning Inverse Reinforcement Learning LfD, imitation learning/behavior cloning, apprenticeship learning, IRL. Hung Ngo MLR Lab, University of Stuttgart Outline Learning from Demonstrations
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 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 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 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 informationReinforcement Learning with Function Approximation. Joseph Christian G. Noel
Reinforcement Learning with Function Approximation Joseph Christian G. Noel November 2011 Abstract Reinforcement learning (RL) is a key problem in the field of Artificial Intelligence. The main goal is
More informationUsing Gaussian Processes for Variance Reduction in Policy Gradient Algorithms *
Proceedings of the 8 th International Conference on Applied Informatics Eger, Hungary, January 27 30, 2010. Vol. 1. pp. 87 94. Using Gaussian Processes for Variance Reduction in Policy Gradient Algorithms
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 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 informationLecture 8: Policy Gradient I 2
Lecture 8: Policy Gradient I 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 and John Schulman
More informationReinforcement Learning. Donglin Zeng, Department of Biostatistics, University of North Carolina
Reinforcement Learning Introduction Introduction Unsupervised learning has no outcome (no feedback). Supervised learning has outcome so we know what to predict. Reinforcement learning is in between it
More informationArtificial Intelligence
Artificial Intelligence Dynamic Programming Marc Toussaint University of Stuttgart Winter 2018/19 Motivation: So far we focussed on tree search-like solvers for decision problems. There is a second important
More informationReinforcement Learning: An Introduction
Introduction Betreuer: Freek Stulp Hauptseminar Intelligente Autonome Systeme (WiSe 04/05) Forschungs- und Lehreinheit Informatik IX Technische Universität München November 24, 2004 Introduction What is
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 informationReinforcement Learning
Reinforcement Learning 1 Reinforcement Learning Mainly based on Reinforcement Learning An Introduction by Richard Sutton and Andrew Barto Slides are mainly based on the course material provided by the
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 informationLecture 4: Approximate dynamic programming
IEOR 800: Reinforcement learning By Shipra Agrawal Lecture 4: Approximate dynamic programming Deep Q Networks discussed in the last lecture are an instance of approximate dynamic programming. These are
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 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 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 informationCS 287: Advanced Robotics Fall Lecture 14: Reinforcement Learning with Function Approximation and TD Gammon case study
CS 287: Advanced Robotics Fall 2009 Lecture 14: Reinforcement Learning with Function Approximation and TD Gammon case study Pieter Abbeel UC Berkeley EECS Assignment #1 Roll-out: nice example paper: X.
More informationElements of Reinforcement Learning
Elements of Reinforcement Learning Policy: way learning algorithm behaves (mapping from state to action) Reward function: Mapping of state action pair to reward or cost Value function: long term reward,
More informationState Space Abstractions for Reinforcement Learning
State Space Abstractions for Reinforcement Learning Rowan McAllister and Thang Bui MLG RCC 6 November 24 / 24 Outline Introduction Markov Decision Process Reinforcement Learning State Abstraction 2 Abstraction
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 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 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 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 informationilstd: Eligibility Traces and Convergence Analysis
ilstd: Eligibility Traces and Convergence Analysis Alborz Geramifard Michael Bowling Martin Zinkevich Richard S. Sutton Department of Computing Science University of Alberta Edmonton, Alberta {alborz,bowling,maz,sutton}@cs.ualberta.ca
More informationTemporal Difference. Learning KENNETH TRAN. Principal Research Engineer, MSR AI
Temporal Difference Learning KENNETH TRAN Principal Research Engineer, MSR AI Temporal Difference Learning Policy Evaluation Intro to model-free learning Monte Carlo Learning Temporal Difference Learning
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 informationAutonomous Helicopter Flight via Reinforcement Learning
Autonomous Helicopter Flight via Reinforcement Learning Authors: Andrew Y. Ng, H. Jin Kim, Michael I. Jordan, Shankar Sastry Presenters: Shiv Ballianda, Jerrolyn Hebert, Shuiwang Ji, Kenley Malveaux, Huy
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 informationCourse 16:198:520: Introduction To Artificial Intelligence Lecture 13. Decision Making. Abdeslam Boularias. Wednesday, December 7, 2016
Course 16:198:520: Introduction To Artificial Intelligence Lecture 13 Decision Making Abdeslam Boularias Wednesday, December 7, 2016 1 / 45 Overview We consider probabilistic temporal models where the
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 informationIntroduction to Reinforcement Learning Part 1: Markov Decision Processes
Introduction to Reinforcement Learning Part 1: Markov Decision Processes Rowan McAllister Reinforcement Learning Reading Group 8 April 2015 Note I ve created these slides whilst following Algorithms for
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 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 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 informationEfficient Learning in Linearly Solvable MDP Models
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Efficient Learning in Linearly Solvable MDP Models Ang Li Department of Computer Science, University of Minnesota
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 information, and rewards and transition matrices as shown below:
CSE 50a. Assignment 7 Out: Tue Nov Due: Thu Dec Reading: Sutton & Barto, Chapters -. 7. Policy improvement Consider the Markov decision process (MDP) with two states s {0, }, two actions a {0, }, discount
More informationBias-Variance Error Bounds for Temporal Difference Updates
Bias-Variance Bounds for Temporal Difference Updates Michael Kearns AT&T Labs mkearns@research.att.com Satinder Singh AT&T Labs baveja@research.att.com Abstract We give the first rigorous upper bounds
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 informationDeep 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 information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 23: Markov Decision Processes Policy Iteration Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology December
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 informationCS788 Dialogue Management Systems Lecture #2: Markov Decision Processes
CS788 Dialogue Management Systems Lecture #2: Markov Decision Processes Kee-Eung Kim KAIST EECS Department Computer Science Division Markov Decision Processes (MDPs) A popular model for sequential decision
More informationAn application of the temporal difference algorithm to the truck backer-upper problem
ESANN 214 proceedings, European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. Bruges (Belgium), 23-25 April 214, i6doc.com publ., ISBN 978-28741995-7. Available
More informationRL 3: Reinforcement Learning
RL 3: Reinforcement Learning Q-Learning Michael Herrmann University of Edinburgh, School of Informatics 20/01/2015 Last time: Multi-Armed Bandits (10 Points to remember) MAB applications do exist (e.g.
More informationReinforcement Learning
Reinforcement Learning Temporal Difference Learning Temporal difference learning, TD prediction, Q-learning, elibigility traces. (many slides from Marc Toussaint) Vien Ngo MLR, University of Stuttgart
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 informationNotes on Reinforcement Learning
1 Introduction Notes on Reinforcement Learning Paulo Eduardo Rauber 2014 Reinforcement learning is the study of agents that act in an environment with the goal of maximizing cumulative reward signals.
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 informationThe convergence limit of the temporal difference learning
The convergence limit of the temporal difference learning Ryosuke Nomura the University of Tokyo September 3, 2013 1 Outline Reinforcement Learning Convergence limit Construction of the feature vector
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 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 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 information