2005
DOI: 10.1007/11564089_17
|View full text |Cite
|
Sign up to set email alerts
|

Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2007
2007

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Hence we can apply Lemma 35 with C = m-DNF n and γ = τ 0 to get an algorithm which uses γ −4 ln 2 ε −1 N 0 = n O(log(m/ε)) many queries under the protocol STAT τ,U to produce for any target f ∈ C a hypothesis h with error δ(f, h) ε. 2 We note that by applying more powerful boosting strategies, it can be shown [23] that m-term DNFs are ε-learnable from n O(log(m/ε)) statistical queries with tolerance (ε/m) instead of (ε 2 /m) as in Theorem 36.…”
Section: Learning Dnf Formulas With Statistical Queriesmentioning
confidence: 97%
“…Hence we can apply Lemma 35 with C = m-DNF n and γ = τ 0 to get an algorithm which uses γ −4 ln 2 ε −1 N 0 = n O(log(m/ε)) many queries under the protocol STAT τ,U to produce for any target f ∈ C a hypothesis h with error δ(f, h) ε. 2 We note that by applying more powerful boosting strategies, it can be shown [23] that m-term DNFs are ε-learnable from n O(log(m/ε)) statistical queries with tolerance (ε/m) instead of (ε 2 /m) as in Theorem 36.…”
Section: Learning Dnf Formulas With Statistical Queriesmentioning
confidence: 97%