Pattern recognition and Valiant's learning framework

摘要

The computational learning approach shows that the concept descriptions acquired from examples are approximately correct with a degree of probability that grows with the size of the training sample. The same problem has also been widely investigated in the field of pattern recognition under a variety of problem settings. Some of the results obtained in both fields are surveyed and compared, and the limits of their applicability are analyzed. Moreover, new and tighter bounds for the growth function of some classes of Boolean formulas are presented.