A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning

DOI10.1561/2200000042zbMath1311.90169OpenAlexW2170141744WikidataQ60022210 ScholiaQ60022210MaRDI QIDQ5168383

Alborz Geramifard, Girish Chowdhary, Stefanie Tellex, Nicholas Roy, Thomas J. Walsh, Jonathan P. How

Publication date: 4 July 2014

Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1561/2200000042

zbMATH Keywords

Markov decision processesreinforcement learning

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (5)

A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ A reinforcement learning approach to the stochastic cutting stock problem ⋮ Relationship between least squares Monte Carlo and approximate linear programming ⋮ OPTIMALLY REPLACING MULTIPLE SYSTEMS IN A SHARED ENVIRONMENT ⋮ Shape constraints in economics and operations research

This page was built for publication: A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning