Resource Bounded Measure and Learnability

We consider the resource bounded measure of polynomial-time learnable subclasses of polynomial-size circuits. We show that if EXP 6= MA, then every PAClearnable subclass of P=poly has EXP-measure zero. We introduce a nonuniformly computable variant of resource bounded measure and show that, for every fixed polynomial q, any polynomial-time learnable subclass of circuits of size q has measure zero with respect to P=poly. We relate our results to the question whether Boolean Circuits are polynomial-time learnable.

• Type: Conference
• Year: 1998
• Where: COCO
• Authors: Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
• Keywords: Algorithms, COCO 1998, Exp 6= Ma, Polynomial-time Learnable Subclasses, Resource Bounded Measure