The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Accuracy analysis for wavelet approximations
Abstract
"Constructive wavelet networks" are investigated as a universal tool for function approximation. The parameters of such networks are obtained via some "direct" Monte Carlo procedures. Approximation bounds are given. Typically, it is shown that such networks with one layer of "wavelons" achieve an L(2) error of order O(N(-(rho/d))), where N is the number of nodes, d is the problem dimension and rho is the number of summable derivatives of the approximated function. An algorithm is also proposed to estimate this approximation based on noisy input-output data observed from the function under consideration. Unlike neural network training, this estimation procedure does not rely on stochastic gradient type techniques such as the celebrated "backpropagation" and it completely avoids the problem of poor convergence or undesirable local minima.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Daubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Networks for approximation and learning
Poggio, T., & Girosi, F. (1990) · Proceedings of the IEEE · doi:10.1109/5.58326 · Cited by 3,252
Interpolation Spaces: An Introduction
Bergh, J., & Löfström, J. (1976) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-66451-9 · Cited by 3,143
Universal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
Martingale Limit Theory and its Application.
Loynes, R. M., Hall, P., & Heyde, C. C. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981599 · Cited by 2,685
Applied Nonparametric Regression
Härdle, W. (1990) · Cambridge University Press eBooks · doi:10.1017/ccol0521382483 · Cited by 2,457
Zhang, Q., & Benveniste, A. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.165591 · Cited by 2,091
Self-citationOptimal Global Rates of Convergence for Nonparametric Regression
Stone, C. J. (1982) · The Annals of Statistics · doi:10.1214/aos/1176345969 · Cited by 1,497
Optimal Rates of Convergence for Nonparametric Estimators
Stone, C. J. (1980) · The Annals of Statistics · doi:10.1214/aos/1176345206 · Cited by 795
Minimax Theory of Image Reconstruction
Korostelev, A. P., & Tsybakov, A. B. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2712-0 · Cited by 483
Stinchcombe, & White (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118640 · Cited by 251
First Leaves: A Tutorial Introduction to Maple V
Char, B. W., Geddes, K. O., Gonnet, G. H., Leong, B. L., Monagan, M. B., Watt, S. M., & Bartram, J. F. (1995) · The Journal of the Acoustical Society of America · doi:10.1121/1.413756 · Cited by 178
Construction of neural nets using the radon transform
Carroll, & Dickinson (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118639 · Cited by 162
Remarques sur un résultat non publié de B. Maurey
Pisier, G. (1981) · French digital mathematics library (Numdam) · Cited by 69
Cited by
Forecasting with artificial neural networks:
Zhang, G., Eddy Patuwo, B., & Y. Hu, M. (1998) · International Journal of Forecasting · doi:10.1016/s0169-2070(97)00044-7 · Cited by 4,229
Nonlinear black-box modeling in system identification: a unified overview
Sjöberg, J., Zhang, Q., Ljung, L., Benveniste, A., Delyon, B., Glorennec, P.-Y., Hjalmarsson, H., & Juditsky, A. (1995) · Automatica · doi:10.1016/0005-1098(95)00120-8 · Cited by 1,942
Self-citationUsing wavelet network in nonparametric estimation
Zhang, Q. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.557660 · Cited by 727
Nonlinear black-box models in system identification: Mathematical foundations
Juditsky, A., Hjalmarsson, H., Benveniste, A., Delyon, B., Ljung, L., SjÖberg, J., & Zhang, Q. (1995) · Automatica · doi:10.1016/0005-1098(95)00119-1 · Cited by 405
Self-citation
Metadata
- Authors
- Delyon, B., Juditsky, A., & Benveniste, A.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1995-03
- Volume
- 6
- Issue
- 2
- Pages
- 332-348
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2127390588
- Cited by
- 259
- References
- 16
- FWCI
- 9.10
- 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
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.