We introduce in this work an extension for the generalization complexity measure to continuous input data. The measure, originally defined in Boolean space, quantifies the complexity of data in relationship to the prediction accuracy that can be expected when using a supervised classifier like a neural network, SVM, and so forth. We first extend the original measure for its use with continuous functions to later on, using an approach based on the use of the set of Walsh functions, consider the case of having a finite number of data points (inputs/outputs pairs), that is, usually the practical case. Using a set of trigonometric functions a model that gives a relationship between the size of the hidden layer of a neural network and the comple...
One of the most important aspects of any machine learning paradigm is how it scales according to pro...
This paper reviews some of the recent results in applying the theory of Probably Approximately Corre...
A definition of complexity based on logic functions, which are widely used as compact descriptions o...
We introduce in this work an extension for the generalization complexity measure to continuous input...
Copyright © 2014 Iván Gómez et al. This is an open access article distributed under the Creative C...
Abstract. The relationship between generalization ability, neural net-work size and function complex...
In this paper, we bound the generalization error of a class of Radial Basis Function networks, for...
Sample complexity results from computational learning theory, when applied to neural network learnin...
In this work, we study how the selection of examples affects the learning procedure in a neural netw...
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural netwo...
AbstractThis paper shows that neural networks which use continuous activation functions have VC dime...
Abstract. The generalization ability of different sizes architectures with one and two hidden layers...
When training an artificial neural network (ANN) for classification using backpropagation of error, ...
Abstract This work analyzes the problem of selecting an adequate neural network archi-tecture for a ...
We analyze Boolean functions using a recently proposed measure of their complexity. This complexity ...
One of the most important aspects of any machine learning paradigm is how it scales according to pro...
This paper reviews some of the recent results in applying the theory of Probably Approximately Corre...
A definition of complexity based on logic functions, which are widely used as compact descriptions o...
We introduce in this work an extension for the generalization complexity measure to continuous input...
Copyright © 2014 Iván Gómez et al. This is an open access article distributed under the Creative C...
Abstract. The relationship between generalization ability, neural net-work size and function complex...
In this paper, we bound the generalization error of a class of Radial Basis Function networks, for...
Sample complexity results from computational learning theory, when applied to neural network learnin...
In this work, we study how the selection of examples affects the learning procedure in a neural netw...
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural netwo...
AbstractThis paper shows that neural networks which use continuous activation functions have VC dime...
Abstract. The generalization ability of different sizes architectures with one and two hidden layers...
When training an artificial neural network (ANN) for classification using backpropagation of error, ...
Abstract This work analyzes the problem of selecting an adequate neural network archi-tecture for a ...
We analyze Boolean functions using a recently proposed measure of their complexity. This complexity ...
One of the most important aspects of any machine learning paradigm is how it scales according to pro...
This paper reviews some of the recent results in applying the theory of Probably Approximately Corre...
A definition of complexity based on logic functions, which are widely used as compact descriptions o...