Representations and rates of approximation of realvalued Boolean functions by neural networks

 KUARKOVA V.
 Institute of Computer Science, Academy of Sciences of the Czech Republic

 SAVICKY P.
 Institute of Computer Science, Academy of Sciences of the Czech Republic

 HLAVACKOVA K.
 Institute of Computer Science, Academy of Sciences of the Czech Republic
Search this Article
Author(s)

 KUARKOVA V.
 Institute of Computer Science, Academy of Sciences of the Czech Republic

 SAVICKY P.
 Institute of Computer Science, Academy of Sciences of the Czech Republic

 HLAVACKOVA K.
 Institute of Computer Science, Academy of Sciences of the Czech Republic
Journal

 Neural Networks

Neural Networks 11(4), 651659, 19980601
References: 22

1
 <no title>

ALON N.
The Probabilistic Method, 1992
Cited by (10)

2
 Neural net approximation.

BARRON A. R.
Proceedings of the 7th Yale Workshop on Adaptive and Learning Systems, 6972, 1992
Cited by (2)

3
 Rate of approximation results motivated by robust neural network learning.

DARKEN C.
Proceedings of the 6th Annual ACM Conference on Computational Learning Theory, 303309, 1993
Cited by (3)

4
 Rates of convergence for radial basis function and neural networks.

GIROSI F.
Artificial neural networks for speech and vision, 97113, 1993
Cited by (1)

5
 <no title>

HOLMES R. B.
Geometrical functional analysis and its applications, 1975
Cited by (1)

6
 Finite mapping by neural networks and truth functions.

ITO Y.
Mathematical Scientist 17, 6977, 1992
Cited by (1)

7
 Learning decision trees using the Fourier spectrum.

KUSHILEVLCICZ E.
Proceedings of 23rd, ACM STOC, 455464, 1991
Cited by (1)

8
 On the bent Boolean functions that are symmetric.

SAVICKY P.
European Journal of Combinatorics 15, 407410, 1994
Cited by (1)

9
 Parallel networks that learn to pronounce English text

SEJNOWSKI T. J.
Complex systems 1, 145168, 1987
Cited by (16)

10
 <no title>

WEAVER H. J.
Applications of discrete and continuous Fourier analysis., 1983
Cited by (1)

11
 Universal approximation bounds for superpositions of a sigmoidal function

BARRON A. R.
IEEE Trans. Inf. Theory 39(3), 930945, 1993
DOI Cited by (45)

12
 Harmonic analysis of polynomial threshold functions

BRUCK J.
SIAM Journal on Discrete Mathematics 3(2), 168177, 1990
DOI Cited by (4)

13
 Polynomial threshold functions, ac^0 functions and spectral norms

BRUCK J.
SIAM Journal on Discrete Mathematics 21, 3342, 1992
Cited by (3)

14
 Threshold circuits of bounded depth

HAJNAL A.
Proc. 28th IEEE Symp. on Foundations of Computer Science, 99110, 1987
Cited by (2)

15
 A simple lemma on greedy approximation in hilbert space and convergence rates for projection pursuit regression and neural network training

JONES L. K.
The Annals of Statistics 20(1), 608613, 1992
DOI Cited by (4)

16
 Dimensionindependent rates of approximation by neural networks.

KURKOVA V.
Computer intensive methods in control and signal processing: Curse of dimensionality, 261270, 1997
Cited by (1)

17
 Estimates of the Number of Hidden Units and Variation with Respect to HalfSpaces

KURKOVA Vera , KAINEN Paul C. , KREINOVICH Vladik
Neural Networks 10(6), 10611068, 19970801
References (22) Cited by (1)

18
 Multilayer feedforward networks with a nonpolynomial activation function can approximate any function

LESHNO M.
Neural Networks 6, 861867, 1993
DOI Cited by (23)

19
 Approximation by superposition of sigmoidal and radial basis functions

MHASKAR H. N.
Advances in Applied Mathematics 13, 350373, 1992
DOI Cited by (11)

20
 Dimension independent bounds on the degree of approximation by neural networks

MHASKAR H. N.
IBM Journal of Research and Development 38, 277284, 1994
Cited by (5)

21
 Approximation and radialbasisfunction networks

PARK J.
Neural Computation 5, 305316, 1993
DOI Cited by (20)

22
 On the Power of Threshold Circuits with Small Weights

SIU K. Y.
SIAM J. Disc. Math. 4(3), 423435, 1991
DOI Cited by (4)
Cited by: 1

1
 INDEPENDENCE OF UNSCALED BASIS FUNCTIONS AND FINITE MAPPINGS BY NEURAL NETWORKS [in Japanese]

ITO Yoshifusa
IEICE technical report. Neurocomputing 100(490), 17, 20001201
References (8)