In this course, you will learn how to solve problems with large, high-dimensional, and potentially infinite state spaces. You will see that estimating value functions can be cast as a supervised learning problem---function approximation---allowing you to build agents that carefully balance generalization and discrimination in order to maximize reward. We will begin this journey by investigating how our policy evaluation or prediction methods like Monte Carlo and TD can be extended to the function approximation setting. You will learn about feature construction techniques for RL, and representation learning via neural networks and backprop. We conclude this course with a deep-dive into policy gradient methods; a way to learn policies directly without learning a value function. In this course you will solve two continuous-state control tasks and investigate the benefits of policy gradient methods in a continuous-action environment.
提供：
強化学習 の専門講座アルバータ大学（University of Alberta）このコースについて
Probabilities & Expectations, basic linear algebra, basic calculus, Python 3.0 (at least 1 year), implementing algorithms from pseudocode.
習得するスキル
Probabilities & Expectations, basic linear algebra, basic calculus, Python 3.0 (at least 1 year), implementing algorithms from pseudocode.
提供：
アルバータ大学（University of Alberta）
UAlberta is considered among the world’s leading public research- and teaching-intensive universities. As one of Canada’s top universities, we’re known for excellence across the humanities, sciences, creative arts, business, engineering and health sciences.
Alberta Machine Intelligence Institute
The Alberta Machine Intelligence Institute (Amii) is home to some of the world’s top talent in machine intelligence. We’re an Alberta-based
シラバス - 本コースの学習内容
Welcome to the Course!
Welcome to the third course in the Reinforcement Learning Specialization: Prediction and Control with Function Approximation, brought to you by the University of Alberta, Onlea, and Coursera. In this pre-course module, you'll be introduced to your instructors, and get a flavour of what the course has in store for you. Make sure to introduce yourself to your classmates in the "Meet and Greet" section!
On-policy Prediction with Approximation
This week you will learn how to estimate a value function for a given policy, when the number of states is much larger than the memory available to the agent. You will learn how to specify a parametric form of the value function, how to specify an objective function, and how estimating gradient descent can be used to estimate values from interaction with the world.
Constructing Features for Prediction
The features used to construct the agent’s value estimates are perhaps the most crucial part of a successful learning system. In this module we discuss two basic strategies for constructing features: (1) fixed basis that form an exhaustive partition of the input, and (2) adapting the features while the agent interacts with the world via Neural Networks and Backpropagation. In this week’s graded assessment you will solve a simple but infinite state prediction task with a Neural Network and TD learning.
Control with Approximation
This week, you will see that the concepts and tools introduced in modules two and three allow straightforward extension of classic TD control methods to the function approximation setting. In particular, you will learn how to find the optimal policy in infinite-state MDPs by simply combining semi-gradient TD methods with generalized policy iteration, yielding classic control methods like Q-learning, and Sarsa. We conclude with a discussion of a new problem formulation for RL---average reward---which will undoubtedly be used in many applications of RL in the future.
Policy Gradient
Every algorithm you have learned about so far estimates a value function as an intermediate step towards the goal of finding an optimal policy. An alternative strategy is to directly learn the parameters of the policy. This week you will learn about these policy gradient methods, and their advantages over value-function based methods. You will also learn how policy gradient methods can be used to find the optimal policy in tasks with both continuous state and action spaces.
レビュー
PREDICTION AND CONTROL WITH FUNCTION APPROXIMATION からの人気レビュー
Surely a level-up from the previous courses. This course adds to and extends what has been learned in courses 1 & 2 to a greater sphere of real-world problems. Great job Prof. Adam and Martha!
I had been reading the book of Reinforcement Learning An Introduction by myself. This class helped me to finish the study with a great learning environment. Thank you, Martha and Adam!
Great Learning, the best part was the Actor-Critic algorithm for a small pendulum swing task all from stratch using RLGLue library. Love to learn how experimentation in RL works.
Good course with a lot of technical information. I would add another assignment or make current ones a little bit more extensive, as there are many concepts to learn.
強化学習専門講座について
よくある質問
いつ講座や課題にアクセスできるようになりますか？
講義と課題へのアクセスは、登録のタイプによって異なります。聴講モードでコースを受講すると、ほとんどのコース教材を無料で見ることができます。採点された課題にアクセスして修了証を取得するには、聴講中または聴講後に、修了証エクスペリエンスを購入する必要があります。聴講オプションが表示されない場合：
- コースは聴講オプションを提供していない可能性があります。代わりに無料トライアルをお試しいただくか、学資援助を申請することができます。
- コースは、聴講オプションを提供せずに「修了証なしフルコース」オプションを提供する場合があります。このオプションでは、すべてのコース教材が表示され、必須の評価を提出して、最終成績を取得することができます。この場合、修了証エクスペリエンスは購入できません。
この専門講座をサブスクライブすると何を行うことができるようになりますか？
コースに登録する際、専門講座のすべてのコースにアクセスできます。コースの完了時には修了証を取得できます。電子修了証が成果のページに追加され、そこから修了証を印刷したり、LinkedInのプロフィールに追加したりできます。コースの内容の閲覧のみを希望する場合は、無料でコースを聴講できます。
返金ポリシーについて教えてください。
サブスクライブすると、7日間の無料トライアルを体験できます。この期間中は解約金なしでキャンセルできます。それ以降、払い戻しはありませんが、サブスクリプションをいつでもキャンセルできます。返金ポリシーをすべて表示します。
学資援助はありますか？
はい。受講料の支払いが難しい受講生に、Coursera（コーセラ）は学資援助を提供しています。左側の［登録］ボタンの下にある［学資援助］のリンクをクリックして申請してください。申請書の入力を促すメッセージが表示され、承認されると通知が届きます。キャップストーンプロジェクトを含む専門講座の各コースでこのステップを完了する必要があります。詳細。
さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。
