A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training (Q1192997): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q124997995, #quickstatements; #temporary_batch_1711565664090 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1214/aos/1176348546 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044828368 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q124997995 / rank | |||
Normal rank | |||
Latest revision as of 21:21, 27 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training |
scientific article |
Statements
A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training (English)
0 references
27 September 1992
0 references
general convergence criterion
0 references
iterative sequences
0 references
Hilbert space
0 references
estimates of the rate of convergence
0 references
projection pursuit regression
0 references
neural network training
0 references
ridge functions
0 references
neurons
0 references
greedy basis expansion
0 references
