Course:CPSC522/Reinforcement Learning with Backpropagation

From UBC Wiki

Title

Reinforcement learning is an area of machine learning inspired by behaviorist psychology, concerned with how software agents ought to take actions in an environment so as to maximize some notion of cumulative reward. For smaller problems machine learners use a tabular representation of the data called a Look-up Table (LUT). Here we want to discuss the use of a neural network to replace the look-up table and approximate the Q-function.

Principal Author: Mehrdad Ghomi

Collaborators:

Abstract

This should be a brief summary that tells us what is covered in this page.

Builds on

Put links to the more general categories that this builds on. These links should all be in sentences that make sense without following the links. You can only rely on technical knowledge that is in these links (and their transitive closure). There is no need to put the transitive closure of the links.

More general than

This should contain the reverse links to the "builds on" links

Content

Put the content here. Use appropriate subheadings and links.

Annotated Bibliography

Put your annotated bibliography here. Add links where appropriate.

To Add

Put links and content here to be added. This does not need to be organized, and will not be graded as part of the page. If you find something that might be useful for a page, feel free to put it here.


Some rights reserved
Permission is granted to copy, distribute and/or modify this document according to the terms in Creative Commons License, Attribution-NonCommercial-ShareAlike 3.0. The full text of this license may be found here: CC by-nc-sa 3.0
By-nc-sa-small-transparent.png