most citedLearning from Sparse Data by Exploiting Monotonicity Constraints

29 citations · 70 across the 3 of their papers we have counts for

collaborators

5 papers

cs.AI201217 cited

Inferring Strategies from Limited Reconnaissance in Real-time Strategy Games

Jesse Hostetler, Ethan W. Dereszynski, Thomas G. Dietterich +1

In typical real-time strategy (RTS) games, enemy units are visible only when they are within sight range of a friendly unit. Knowledge of an opponent's disposition is limited to wh…

cs.LG201224 cited

Active Imitation Learning via Reduction to I.I.D. Active Learning

Kshitij Judah, Alan Fern, Thomas G. Dietterich

In standard passive imitation learning, the goal is to learn a target policy by passively observing full execution trajectories of it. Unfortunately, generating such trajectories c…

cs.LG201229 cited

Learning from Sparse Data by Exploiting Monotonicity Constraints

Eric E. Altendorf, Angelo C. Restificar, Thomas G. Dietterich

When training data is sparse, more domain knowledge must be incorporated into the learning algorithm in order to reduce the effective size of the hypothesis space. This paper build…

cs.LG1999

State Abstraction in MAXQ Hierarchical Reinforcement Learning

Thomas G. Dietterich

Many researchers have explored methods for hierarchical reinforcement learning (RL) with temporal abstractions, in which abstract actions are defined that can perform many primitiv…

cs.LG1999

Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition

Thomas G. Dietterich

This paper presents the MAXQ approach to hierarchical reinforcement learning based on decomposing the target Markov decision process (MDP) into a hierarchy of smaller MDPs and deco…