Sciweavers

COLT
2008
Springer
13 years 7 months ago
The True Sample Complexity of Active Learning
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
Maria-Florina Balcan, Steve Hanneke, Jennifer Wort...
KCAP
2009
ACM
14 years 9 days ago
Interactively shaping agents via human reinforcement: the TAMER framework
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...
W. Bradley Knox, Peter Stone
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 2 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...

Publication
222views
14 years 2 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis

Publication
334views
14 years 2 months ago
Rollout Sampling Approximate Policy Iteration
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
Christos Dimitrakakis, Michail G. Lagoudakis