Information Technology is coming soon
We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.
Information Technology
Reinforcement Learning
Introduction to reinforcement learning, bandit problems and online learning, Markov decision processes, dynamic programming.
Your progress in this subject0 of 1 · 0%
Coming next in Reinforcement Learning
- Elements of reinforcement learning· notes coming
- Types of reinforcement learning and rewards· notes coming
- Q-learning and SARSA· notes coming
- The n-armed bandit problem· notes coming
- Action-value methods· notes coming
- Optimistic initial values and UCB action selection· notes coming
- Gradient bandits· notes coming
- The agent–environment interface· notes coming
- Returns and the Markov property· notes coming
- Value functions and optimal value functions· notes coming
- Policy evaluation and improvement· notes coming
- Policy iteration· notes coming
- Value iteration· notes coming
- Asynchronous DP and generalised policy iteration· notes coming
- Monte Carlo prediction and control· notes coming
- Temporal-difference prediction· notes coming
- Off-policy prediction with importance sampling· notes coming
- RL case studies: elevator dispatching, channel allocation and job-shop scheduling· notes coming
- PAC bandit algorithms and median elimination· notes coming
- Eligibility traces and TD(λ)· notes coming
- Value-function approximation· notes coming
- Semi-gradient methods and linear function approximation· notes coming
- Deep Q-networks· notes coming
- Policy gradient theorem· notes coming
- Hierarchical reinforcement learning· notes coming
- Partially observable MDPs· notes coming