Regularized greedy algorithms for network training with data noise (Q1774153)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Regularized greedy algorithms for network training with data noise |
scientific article; zbMATH DE number 2162512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regularized greedy algorithms for network training with data noise |
scientific article; zbMATH DE number 2162512 |
Statements
Regularized greedy algorithms for network training with data noise (English)
0 references
29 April 2005
0 references
The aim of this paper is to construct a modified greedy algorithm applicable to an ill-posed function approximation problem in presence of data noise. The authors provide a detailed convergence analysis of the algorithm and discuss the choice of the iteration parameters. Applications to neural networks are presented.
0 references
Greedy approximation
0 references
data noise
0 references
neural networks
0 references
regularization
0 references
training
0 references
0.7709558606147766
0 references
0.7420209050178528
0 references
0.7371325492858887
0 references
0.725846529006958
0 references
