Lower Bounds on Learning Random Structures with Statistical Queries.

Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin

Abstract: We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries with respect to an arbitrary distribution on examples. This is a preview of subscription content, log in to check access. Cite paper How to cite? .RIS Papers Reference Manager RefWorks Zotero .ENW EndNote .BIB BibTeX JabRef Mendeley Preview Unable to display preview. Download preview PDF. Unable to display preview. Download preview PDF.