Incremental Stochastic Factorization for Online Reinforcement Learning

Abstract

A construct that has been receiving attention recently in reinforcement learning is stochastic factorization (SF), a particular case of non-negative factorization (NMF) in which the matrices involved are stochastic. The idea is to use SF to approximate the transition matrices of a Markov decision process (MDP). This is useful for two reasons. First… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics