The Complexity of Learning Concept Classes with Polynomial General Dimension
Abstract
We use the notion of general dimension 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.
Cite
Text
Köbler and Lindner. "The Complexity of Learning Concept Classes with Polynomial General Dimension." International Conference on Algorithmic Learning Theory, 2002. doi:10.1007/3-540-36169-3_14Markdown
[Köbler and Lindner. "The Complexity of Learning Concept Classes with Polynomial General Dimension." International Conference on Algorithmic Learning Theory, 2002.](https://mlanthology.org/alt/2002/kobler2002alt-complexity/) doi:10.1007/3-540-36169-3_14BibTeX
@inproceedings{kobler2002alt-complexity,
title = {{The Complexity of Learning Concept Classes with Polynomial General Dimension}},
author = {Köbler, Johannes and Lindner, Wolfgang},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2002},
pages = {149-163},
doi = {10.1007/3-540-36169-3_14},
url = {https://mlanthology.org/alt/2002/kobler2002alt-complexity/}
}