<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Lecture Notes on 3rd layer</title><link>https://3rdlayer.uk/tags/lecture-notes/</link><description>Recent content in Lecture Notes on 3rd layer</description><generator>Hugo -- 0.157.0</generator><language>en-US</language><lastBuildDate>Sat, 19 Jun 2021 00:00:00 +0000</lastBuildDate><atom:link href="https://3rdlayer.uk/tags/lecture-notes/index.xml" rel="self" type="application/rss+xml"/><item><title>Reinforcement Learning Lecture 10: RL in Games</title><link>https://3rdlayer.uk/posts/rl-10-games/</link><pubDate>Sat, 19 Jun 2021 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-10-games/</guid><description>David Silver&amp;rsquo;s Lecture 10. A case study. Best response and Nash equilibrium seen through game theory, minimax search with a binary-linear value function, self-play reinforcement learning, combining minimax with RL, and imperfect-information games like poker. One recipe running through Chinook, Deep Blue, Logistello, TD-Gammon, and Maven.</description></item><item><title>Reinforcement Learning Lecture 9: Exploration and Exploitation</title><link>https://3rdlayer.uk/posts/rl-09-exploration-exploitation/</link><pubDate>Sat, 15 May 2021 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-09-exploration-exploitation/</guid><description>David Silver&amp;rsquo;s Lecture 9. Use what you know now (exploitation), or find out more (exploration)? This note ties that dilemma into five principles, then follows the multi-armed bandit through regret and lower bounds, UCB, Thompson sampling, and information-state search, and on to contextual bandits and the extension to MDPs.</description></item><item><title>Reinforcement Learning Lecture 8: Integrating Learning and Planning</title><link>https://3rdlayer.uk/posts/rl-08-integrating-learning-planning/</link><pubDate>Sat, 17 Apr 2021 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-08-integrating-learning-planning/</guid><description>David Silver&amp;rsquo;s Lecture 8. Learn a model of the environment from experience, then plan with that model. Model learning as supervised learning, the AB example, Dyna and Dyna-Q+, Monte-Carlo Tree Search and Go, TD search and Dyna-2.</description></item><item><title>Reinforcement Learning Lecture 7: Policy Gradient</title><link>https://3rdlayer.uk/posts/rl-07-policy-gradient/</link><pubDate>Sat, 13 Mar 2021 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-07-policy-gradient/</guid><description>David Silver&amp;rsquo;s Lecture 7. Optimize the policy directly, without going through value. The likelihood-ratio trick and the score function, REINFORCE, baselines and advantage, actor-critic, natural policy gradient, and a summary that ties six faces into one.</description></item><item><title>Reinforcement Learning Lecture 6: Value Function Approximation</title><link>https://3rdlayer.uk/posts/rl-06-value-function-approximation/</link><pubDate>Sat, 13 Feb 2021 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-06-value-function-approximation/</guid><description>David Silver&amp;rsquo;s Lecture 6. When states are too many to write down in a table, approximate the value with a handful of parameters. The incremental methods that learn features by gradient descent, mountain car and the bootstrapping debate, Baird&amp;rsquo;s counterexample where off-policy diverges, and the batch methods and DQN that pool experience.</description></item><item><title>Reinforcement Learning Lecture 5: Model-Free Control</title><link>https://3rdlayer.uk/posts/rl-05-model-free-control/</link><pubDate>Sat, 16 Jan 2021 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-05-model-free-control/</guid><description>David Silver&amp;rsquo;s Lecture 5. Finding the optimal policy without a model. Why action values rather than state values, the two doors and ε-greedy and GLIE, Sarsa and Sarsa(λ) on the windy gridworld, importance sampling and off-policy learning, Q-learning through cliff walking, and the correspondence between DP and TD.</description></item><item><title>Reinforcement Learning Lecture 4: Model-Free Prediction</title><link>https://3rdlayer.uk/posts/rl-04-model-free-prediction/</link><pubDate>Sat, 12 Dec 2020 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-04-model-free-prediction/</guid><description>David Silver&amp;rsquo;s Lecture 4. Estimate the value of a policy from experience alone, with no model of the environment. Monte-Carlo in Blackjack, temporal-difference learning on the drive home, the unified view of bootstrapping and sampling, and TD(λ) with eligibility traces.</description></item><item><title>Reinforcement Learning Lecture 3: Dynamic Programming</title><link>https://3rdlayer.uk/posts/rl-03-dynamic-programming/</link><pubDate>Sat, 14 Nov 2020 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-03-dynamic-programming/</guid><description>David Silver&amp;rsquo;s Lecture 3. When the MDP is fully known, solve the Bellman equations by iteration to compute the optimal policy. Policy evaluation, policy iteration, and value iteration through a small grid world example.</description></item><item><title>Reinforcement Learning Lecture 2: Markov Decision Processes</title><link>https://3rdlayer.uk/posts/rl-02-mdp/</link><pubDate>Sat, 17 Oct 2020 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-02-mdp/</guid><description>David Silver&amp;rsquo;s Lecture 2. The Markov decision process is the container that holds the reinforcement learning problem, built up one layer at a time, from the Markov chain through the reward process to the decision process, alongside Silver&amp;rsquo;s &amp;lsquo;student&amp;rsquo; example.</description></item><item><title>Reinforcement Learning, Lecture 1: The RL Problem</title><link>https://3rdlayer.uk/posts/rl-01-introduction/</link><pubDate>Sat, 19 Sep 2020 00:00:00 +0000</pubDate><guid>https://3rdlayer.uk/posts/rl-01-introduction/</guid><description>David Silver&amp;rsquo;s lecture 1. What sets reinforcement learning apart from other kinds of learning, reward and state, and the three pieces that make up an agent (policy, value function, model).</description></item></channel></rss>