Sciweavers

7530 search results - page 347 / 1506
» Machine learning in bioinformatics
Sort
View
ICML
2007
IEEE
16 years 7 months ago
A bound on the label complexity of agnostic active learning
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...
Steve Hanneke
ICML
2005
IEEE
16 years 7 months ago
Why skewing works: learning difficult Boolean functions with greedy tree learners
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...
ICML
2004
IEEE
16 years 7 months ago
Dynamic abstraction in reinforcement learning via clustering
Abstraction in Reinforcement Learning via Clustering Shie Mannor shie@mit.edu Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA ...
Shie Mannor, Ishai Menache, Amit Hoze, Uri Klein
ICML
2002
IEEE
16 years 7 months ago
Discovering Hierarchy in Reinforcement Learning with HEXQ
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...
Bernhard Hengst
ICML
1998
IEEE
16 years 7 months ago
Relational Reinforcement Learning
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...
Kurt Driessens