A Note on the Regularization Algorithm
Regularization Algorithm (also called Regularization Network) is a technique for solving problems of learning from examples – in particular, the problem of approximating a multivariate function from sparse data. We analyze behavior of Regularization Algorithm for regularizator parameter equal to zero. We propose an approximative version of algorithm in order to overcome the computational cost for large data sets. We give proof of convergence and estimation for error of approximation.
Keywordscomputational learning theory regularization algorithm approximate regularization algorithm
Unable to display preview. Download preview PDF.
- 3.Dodd, T., Harrison, R.: Iterative Solution to Approximation in Reproducing Kernel Hilbert Spaces. In: 15th IFAC World Congress: b 2002, CDROM (2002)Google Scholar
- 6.Pal, S.K., Polkowski, L., Skowron, A. (eds.): Rough-Neural Computing: Techniques for Computing with Words, Cognitive Technologies. Springer, Heidelberg (2004)Google Scholar