flâneur — a map of the web's best reading

Model-free (reinforcement learning)

en.wikipedia.org · 1,150 words · saved by 1 readers

In reinforcement learning (RL), a model-free algorithm is an algorithm which does not estimate the transition probability distribution (and the reward function) associated with the Markov decision process (MDP), which, in RL, represents the problem to be solved. The transition probability distribution (or transition model) and the reward function are often collectively called the "model" of the environment (or MDP), hence the name "model-free". A model-free RL algorithm can be thought of as an "explicit" trial-and-error algorithm. Typical examples of model-free algorithms include Monte Carlo (MC) RL, SARSA, and Q-learning.

Model-free (reinforcement learning) - Wikipedia Jump to content From Wikipedia, the free encyclopedia Class of reinforcement learning algorithm This article needs more citations . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed . Find sources: "Model-free" reinforcement learning – news · newspapers · books · scholar · JSTOR ( April 2019 ) ( Learn how and when to remove this message ) Part of a series on Machine learning and data mining Paradigms Supervised learning Unsupervised learning Semi-supervised learning Self-su

Explore this link on the map →

related reading