The influence of oppositely classified examples on the generalization complexity of Boolean functions.
In this paper, we analyze Boolean functions using a recently proposed measure of their complexity. This complexity measure, motivated by the aim of relating the complexity of the functions with the generalization ability that can be obtained when the functions are implemented in feed-forward neural networks, is the sum of a number of components. We concentrate on the case in which we use the first two of these components. The first is related to the "average sensitivity" of the function and the second is, in a sense, a measure of the "randomness" or lack of structure of the function. In this paper, we investigate the importance of using the second term in the complexity measure, and we consider to what extent these two terms suffice as an indicator of how difficult it is to learn a Boolean function. We also explore the existence of very complex Boolean functions, considering, in particular, the symmetric Boolean functions.
Franco
Leonardo
L
Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, Campus de Teatinos S/N, 29071 Málaga, Spain. lfranco@lcc.uma.es
Anthony
Martin
M
D000465:Algorithms; D001185:Artificial Intelligence; D016247:Information Storage and Retrieval / Q000379:methods*; D016015:Logistic Models; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*