In this paper, we present a review of some recent works on approximation by feedforward neural networks. A particular emphasis is placed on the computational aspects of the problem, i.e. we discuss the possibility of realizing a feedforward neural network which achieves a prescribed degree of accura
โฆ LIBER โฆ
Approximate policy iteration: a survey and some new methods
โ Scribed by Dimitri P. Bertsekas
- Book ID
- 107504891
- Publisher
- South China University of Technology and Academy of Mathematics and Systems Science, CAS
- Year
- 2011
- Tongue
- English
- Weight
- 473 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1672-6340
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Universal Approximation Using Feedforwar
โ
Franco Scarselli; Ah Chung Tsoi
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 699 KB
A review of stochastic algorithms with c
โ
Warren B. Powell; Jun Ma
๐
Article
๐
2011
๐
South China University of Technology and Academy o
๐
English
โ 273 KB
A short survey of semiquantitative metho
โ
Herbert Weisz; Herbert Lepper
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 442 KB
Some Methods of Approximate Integration
โ
PERCIVAL, A. S.
๐
Article
๐
1920
๐
Nature Publishing Group
๐
English
โ 199 KB
Some Methods of Approximate Integration
โ
ROGERS, R. A. P.
๐
Article
๐
1920
๐
Nature Publishing Group
๐
English
โ 108 KB
Resolvability: A selective survey and so
โ
W.W. Comfort; Salvador Garcia-Ferreira
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 1008 KB
Following guidance from the Organizing Committee, the authors give a brief introduction to the theory of spaces which are resolvable in the sense introduced by Hewitt (1943). The new results presented here are these. (A) A countably compact regular Hausdorff space without isolated points is w-resol