3250 search results - page 54 / 650 » Parameterized Learning Complexity |
ALT
1998
Springer
14 years 2 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
ICALT
2009
IEEE
14 years 4 months ago
2009
IEEE
COLT
2007
Springer
14 years 4 months ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
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...
MLG
2007
Springer
14 years 4 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...