The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Approximation and estimation bounds for artificial neural networks
Open accessOverview
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Density Estimation for Statistics and Data Analysis
(1986) · Springer eBooks · doi:10.1007/978-1-4899-3324-9 · Cited by 8,525
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
Self-citationApplied Nonparametric Regression
Härdle, W. (1990) · Cambridge University Press eBooks · doi:10.1017/ccol0521382483 · Cited by 2,457
Seber, G. A. F., & Wild, C. J. (1989) · Wiley Series in Probability and Statistics · doi:10.1002/0471725315 · Cited by 1,962
A Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,672
Optimal Global Rates of Convergence for Nonparametric Regression
Stone, C. J. (1982) · The Annals of Statistics · doi:10.1214/aos/1176345969 · Cited by 1,497
Problems of Information Transmission
(2013) · Problems of Information Transmission · doi:10.1134/11122.1608-3253 · Cited by 931
Cited by
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
Self-citationApproximation theory of the MLP model in neural networks
Pinkus, A. (1999) · Acta Numerica · doi:10.1017/s0962492900002919 · Cited by 1,529
Regularization Theory and Neural Networks Architectures
Girosi, F., Jones, M., & Poggio, T. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.219 · Cited by 1,349
Stochastic choice of basis functions in adaptive function approximation and the functional-link net
Igelnik, B., & Pao, Y.-H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.471375 · Cited by 955
Forecasting: theory and practice
Petropoulos, F., Apiletti, D., Assimakopoulos, V., Babai, M. Z., Barrow, D. K., Ben Taieb, S., Bergmeir, C., Bessa, R. J., Bijak, J., Boylan, J. E., et al. (2022) · International Journal of Forecasting · doi:10.1016/j.ijforecast.2021.11.001 · Cited by 921
Solving inverse problems using data-driven models
Arridge, S., Maass, P., Öktem, O., & Schönlieb, C.-B. (2019) · Acta Numerica · doi:10.1017/s0962492919000059 · Cited by 686
Risk bounds for model selection via penalization
Barron, A., Birgé, L., & Massart, P. (1999) · Probability Theory and Related Fields · doi:10.1007/s004400050210 · Cited by 657
Self-citationInformation-theoretic determination of minimax rates of convergence
Yang, Y., & Barron, A. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939142 · Cited by 555
Self-citationStructural risk minimization over data-dependent hierarchies
Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705570 · Cited by 527
Westreich, D., Lessler, J., & Funk, M. J. (2010) · Journal of Clinical Epidemiology · doi:10.1016/j.jclinepi.2009.11.020 · Cited by 502
Kwok, T.-Y., & Yeung, D.-Y. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572102 · Cited by 493
Optimal approximation of piecewise smooth functions using deep ReLU neural networks
Petersen, P., & Voigtlaender, F. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.08.019 · Cited by 432
Long short-term memory - Fully connected (LSTM-FC) neural network for PM2.5 concentration prediction
Zhao, J., Deng, F., Cai, Y., & Chen, J. (2019) · Chemosphere · doi:10.1016/j.chemosphere.2018.12.128 · Cited by 410
Bouwmans, T., Javed, S., Sultana, M., & Jung, S. K. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.04.024 · Cited by 396
Smooth discrimination analysis
Mammen, E., & Tsybakov, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939240 · Cited by 377
Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks
Soltanolkotabi, M., Javanmard, A., & Lee, J. D. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2854560 · Cited by 356
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
Incorporating prior information in machine learning by creating virtual examples
Niyogi, P., Girosi, F., & Poggio, T. (1998) · Proceedings of the IEEE · doi:10.1109/5.726787 · Cited by 313
Nonparametric regression using deep neural networks with ReLU activation function
Schmidt-Hieber, J. (2020) · The Annals of Statistics · doi:10.1214/19-aos1875 · Cited by 292
Dawson, C., Gao, S., & Fan, C. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3232542 · Cited by 269
Forecasting Energy Use in Buildings Using Artificial Neural Networks: A Review
Runge, J., & Zmeureanu, R. (2019) · Energies · doi:10.3390/en12173254 · Cited by 268
Semantic Communication: A Survey on Research Landscape, Challenges, and Future Directions
Getu, T. M., Kaddoum, G., & Bennis, M. (2024) · Proceedings of the IEEE · doi:10.1109/jproc.2024.3520707 · Cited by 110
Metadata
- Authors
- Barron, A. R.
- Venue
- Machine Learning
- Published
- 1994-01
- Volume
- 14
- Issue
- 1
- Pages
- 115-133
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W4236966694
- Cited by
- 399
- References
- 22
- FWCI
- 11.20
- Type
- journal article
- Language
- en
- Open access
- bronze
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.