2006
DOI: 10.1007/s10994-006-8638-3
|View full text |Cite
|
Sign up to set email alerts
|

A new PAC bound for intersection-closed concept classes

Abstract: et al. (1989) and Haussler, Littlestone and Warmuth (1994). Our bound is established using the closure algorithm, that generates as its hypothesis the intersection of all concepts that are consistent with the positive training examples. On the other hand, we show that many intersection-closed concept classes including e.g. maximum intersection-closed classes satisfy an additional combinatorial property that allows a proof of the optimal bound of O( 1 ε (d + log 1 δ )). For such improved bounds the choice of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Uncertainty sampling attempts to target the principal measure of inadequate testing resources, namely, the positivity rate. Uncertainty sampling is different from merely targeting the positivity rate, however, because it accounts for the uncertainty in the rate . This is important because underserved communities may have a seemingly low positivity rate owing to randomness and low testing volume.…”
Section: Methodsmentioning
confidence: 99%
“…Uncertainty sampling attempts to target the principal measure of inadequate testing resources, namely, the positivity rate. Uncertainty sampling is different from merely targeting the positivity rate, however, because it accounts for the uncertainty in the rate . This is important because underserved communities may have a seemingly low positivity rate owing to randomness and low testing volume.…”
Section: Methodsmentioning
confidence: 99%
“…In such language collections, we can think of mind change optimal methods as choosing the simplest hypothesis consistent with the data when a unique simplest hypothesis is available. 5 …”
Section: Necessary and Sufficient Conditions For Strongly Mind Changementioning
confidence: 99%
“…We would like to characterize the learning problems for which this tension arises, and how great the trade-off can be. For example, if a language collection L is closed under intersection, then conjecturing ∩(L| ) for every data sequence yields an SMC-optimal learner that never procrastinates (the so-called "closure algorithm" [5]). The language collection LINEAR and the learner LIN are an instance of an intersection-closed language class and the corresponding closure algorithm.…”
Section: Summary and Future Workmentioning
confidence: 99%