These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
184 related articles for article (PubMed ID: 18249764)
1. On the optimality of neural-network approximation using incremental algorithms. Meir R; Maiorov VE IEEE Trans Neural Netw; 2000; 11(2):323-37. PubMed ID: 18249764 [TBL] [Abstract][Full Text] [Related]
2. Approximation rates for neural networks with encodable weights in smoothness spaces. Gühring I; Raslan M Neural Netw; 2021 Feb; 134():107-130. PubMed ID: 33310376 [TBL] [Abstract][Full Text] [Related]
3. On the geometric convergence of neural approximations. Lavretsky E IEEE Trans Neural Netw; 2002; 13(2):274-82. PubMed ID: 18244430 [TBL] [Abstract][Full Text] [Related]
4. Bounds of the incremental gain for discrete-time recurrent neural networks. Chu YC IEEE Trans Neural Netw; 2002; 13(5):1087-98. PubMed ID: 18244506 [TBL] [Abstract][Full Text] [Related]
5. Optimal approximation of piecewise smooth functions using deep ReLU neural networks. Petersen P; Voigtlaender F Neural Netw; 2018 Dec; 108():296-330. PubMed ID: 30245431 [TBL] [Abstract][Full Text] [Related]
6. Approximation bounds for smooth functions in C(IRd) by neural and mixture networks. Maiorov V; Meir RS IEEE Trans Neural Netw; 1998; 9(5):969-78. PubMed ID: 18255780 [TBL] [Abstract][Full Text] [Related]
7. An integral upper bound for neural network approximation. Kainen PC; Kůrková V Neural Comput; 2009 Oct; 21(10):2970-89. PubMed ID: 19635020 [TBL] [Abstract][Full Text] [Related]
8. Discrete-Time Deterministic $Q$ -Learning: A Novel Convergence Analysis. Wei Q; Lewis FL; Sun Q; Yan P; Song R IEEE Trans Cybern; 2017 May; 47(5):1224-1237. PubMed ID: 27093714 [TBL] [Abstract][Full Text] [Related]
9. Near-optimal deep neural network approximation for Korobov functions with respect to L Yang Y; Lu Y Neural Netw; 2024 Dec; 180():106702. PubMed ID: 39250872 [TBL] [Abstract][Full Text] [Related]
10. Minimization of error functionals over perceptron networks. Kůrková V Neural Comput; 2008 Jan; 20(1):252-70. PubMed ID: 18045008 [TBL] [Abstract][Full Text] [Related]
11. Synthesis of feedforward networks in supremum error bound. Ciesielski K; Sacha JP; Cios KJ IEEE Trans Neural Netw; 2000; 11(6):1213-27. PubMed ID: 18249848 [TBL] [Abstract][Full Text] [Related]
12. A neural network of smooth hinge functions. Wang S; Huang X; Yam Y IEEE Trans Neural Netw; 2010 Sep; 21(9):1381-95. PubMed ID: 20682471 [TBL] [Abstract][Full Text] [Related]
14. Almost linear VC-dimension bounds for piecewise polynomial networks. Bartlett PL; Maiorov V; Meir R Neural Comput; 1998 Nov; 10(8):2159-73. PubMed ID: 9804676 [TBL] [Abstract][Full Text] [Related]
15. Simultaneous neural network approximation for smooth functions. Hon S; Yang H Neural Netw; 2022 Oct; 154():152-164. PubMed ID: 35882083 [TBL] [Abstract][Full Text] [Related]
16. Analysis of Tikhonov regularization for function approximation by neural networks. Burger M; Neubauer A Neural Netw; 2003 Jan; 16(1):79-90. PubMed ID: 12576108 [TBL] [Abstract][Full Text] [Related]