Functional approximation by feed-forward networks: a least-squares approach to generalization
The DOI matches its Crossref record.
Abstract
This paper considers a least-squares approach to function approximation and generalization. The particular problem addressed is one in which the training data are noiseless and the requirement is to define a mapping that approximates the data and that generalizes to situations in which data samples are corrupted by noise in the input variables. The least-squares approach produces a generalizer that has the form of a radial basis function network for a finite number of training samples. The finite sample approximation is valid provided that the perturbations due to noise on the expected operating conditions are large compared to the sample spacing in the data space. In the other extreme of small noise perturbations, a particular parametric form must be assumed for the generalizer. It is shown that better generalization will occur if the error criterion used in training the generalizer is modified by the addition of a specific regularization term. This is illustrated by an approximator that has a feedforward architecture and is applied to the problem of point-source location using the outputs of an array of receivers in the focal-plane of a lens.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Training with Noise is Equivalent to Tikhonov Regularization
Bishop, C. M. (1995) · Neural Computation · doi:10.1162/neco.1995.7.1.108 · Cited by 1,325
Surprises in high-dimensional ridgeless least squares interpolation
Hastie, T., Montanari, A., Rosset, S., & Tibshirani, R. J. (2022) · The Annals of Statistics · doi:10.1214/21-aos2133 · Cited by 503
Improving the Generalization Properties of Radial Basis Function Neural Networks
Bishop, C. (1991) · Neural Computation · doi:10.1162/neco.1991.3.4.579 · Cited by 318
Use of some sensitivity criteria for choosing networks with good generalization ability
Dimopoulos, Y., Bourret, P., & Lek, S. (1995) · Neural Processing Letters · doi:10.1007/bf02309007 · Cited by 267
Noise Injection: Theoretical Prospects
Grandvalet, Y., Canu, S., & Boucheron, S. (1997) · Neural Computation · doi:10.1162/neco.1997.9.5.1093 · Cited by 147
“This finally suggests that mixing input perturbation with smoothness-based penalization might be profitable.”
Background
Metadata
- Authors
- Webb, A. R.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1994-05
- Volume
- 5
- Issue
- 3
- Pages
- 363-371
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2146596719
- Cited by
- 74
- References
- 0
- FWCI
- 7.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Functional approximation by feed-forward networks: a least-squares approach to generalization. https://app.cochat.ai/papers/10.1109/72.286908
- The paper
- Webb, A. R. (1994). Functional approximation by feed-forward networks: a least-squares approach to generalization. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.286908
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.