ORACLES IN $\Sigma^p_2$ ARE SUFFFICIENT FOR EXACT LEARNING

Köbler, Johannes; Lindner, Wolfgang

doi:10.1142/s012905410000034x

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2002

2016

Publication Types

Select...

Book4

Article1

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 5 publications

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

The Complexity of Learning Concept Classes with Polynomial General Dimension

Köbler

Lindner

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concept class with polynomial query complexity can be learned in polynomial time with the help of an oracle in the polynomial hierarchy, where the complexity of the required oracle depends on the query-types used by the learning algorithm. In particular, we show that for subset and superset queries an oracle in Σ P 3 suffices. Since the concept class of DNF formulas has polynomial query complexity with respect to subset and superset queries with DNF formulas as hypotheses, it follows that DNF formulas are properly learnable in polynomial time with subset and superset queries and the help of an oracle in Σ P 3. We also show that the required oracle in our main theorem cannot be replaced by an oracle in a lower level of the polynomial-time hierarchy, unless the hierarchy collapses.

show abstract