Sciweavers

1667 search results - page 84 / 334
» Extended clause learning
Sort
View
COLT
2001
Springer
14 years 2 months ago
On Learning Monotone DNF under Product Distributions
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
Rocco A. Servedio
AAAI
2008
14 years 14 days ago
Efficient Learning of Action Schemas and Web-Service Descriptions
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
Thomas J. Walsh, Michael L. Littman
ACL
2008
13 years 11 months ago
Multi-Task Active Learning for Linguistic Annotations
We extend the classical single-task active learning (AL) approach. In the multi-task active learning (MTAL) paradigm, we select examples for several annotation tasks rather than f...
Roi Reichart, Katrin Tomanek, Udo Hahn, Ari Rappop...
NIPS
2007
13 years 11 months ago
A general agnostic active learning algorithm
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
Sanjoy Dasgupta, Daniel Hsu, Claire Monteleoni
AAAI
1994
13 years 11 months ago
Dead-End Driven Learning
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
Daniel Frost, Rina Dechter