We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
Bernard Rosell, Lisa Hellerstein, Soumya Ray, Davi...
Abstraction in Reinforcement Learning via Clustering Shie Mannor shie@mit.edu Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA ...
An open problem in reinforcement learning is discovering hierarchical structure. HEXQ, an algorithm which automatically attempts to decompose and solve a model-free factored MDP h...
Relational reinforcement learning (RRL) is both a young and an old eld. In this paper, we trace the history of the eld to related disciplines, outline some current work and promis...