Associative reinforcement learning: Functions ink-DNF

摘要

An agent that must learn to act in the world by trial and error faces thereinforcement learning problem, which is quite different from standard concept learning. Although good algorithms exist for this problem in the general case, they are often quite inefficient and do not exhibit generalization. One strategy is to find restricted classes of action policies that can be learned more efficiently. This paper pursues that strategy by developing algorithms that can efficiently learn action maps that are expressible ink-DNF. The algorithms are compared with existing methods in empirical trials and are shown to have very good performance.