Regularized greedy algorithms for network training with data noise (Q1774153): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00607-004-0081-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031959925 / rank | |||
Normal rank | |||
Revision as of 22:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regularized greedy algorithms for network training with data noise |
scientific article |
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
