701 search results - page 12 / 141 » Self Bounding Learning Algorithms |
ICEC
1996
14 years 10 months ago
1996
Abstract - The paper describes how a formal model of selfadaptation [Angeline, 1995] can be expressed in terms of Cultural Algorithms. A particular form of self-adaptation concerns...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
COLT
2004
Springer
15 years 1 months ago
2004
Springer
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
COLT
2007
Springer
15 years 3 months ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
IJCNN
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— In this paper, we present a weighted Linde-BuzoGray algorithm (WLBG) as a powerful and efficient technique for compressing neural spike data. We compare this technique...