251 search results - page 17 / 51 » Approximation and Estimation Bounds for Artificial Neural Ne... |
COLT
2001
Springer
14 years 1 days ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
IWANN
2009
Springer
14 years 2 months ago
2009
Springer
We present an evolving neural network model in which synapses appear and disappear stochastically according to bio-inspired probabilities. These are in general nonlinear functions ...
ANNPR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. In many real-world applications of evolutionary computation, it is essential to reduce the number of fitness evaluations. To this end, computationally efficient models c...