On the power of polynomial discriminators and radial basis function networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the power of polynomial discriminators and radial basis function networks

Full text

Pdf (744 KB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the sixth annual conference on Computational learning theory table of contents

Santa Cruz, California, United States

Pages: 158 - 164

Year of Publication: 1993

ISBN:0-89791-611-5

Authors

Martin Anthony
Sean B. Holden

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 15, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/168304.168324 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. Anthony, On the number of boolean functions of a given threshold order, LSE Mathematics Preprint Series, LSE-MPS-35, September 1992.
	2	Martin Anthony , Norman Biggs, Computational learning theory: an introduction, Cambridge University Press, New York, NY, 1992
	3	P. Baldi, Neural networks, orientations of the hypercube, and algebraic threshold functions, IEEE Transactions on Information Theory, 34 (3), 1988: 523-530.
	4	Anselm Blumer , A. Ehrenfeucht , David Haussler , Manfred K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the ACM (JACM), v.36 n.4, p.929-965, Oct. 1989 [doi>10.1145/76359.76371]
	5	Bernhard E. Boser , Isabelle M. Guyon , Vladimir N. Vapnik, A training algorithm for optimal margin classifiers, Proceedings of the fifth annual workshop on Computational learning theory, p.144-152, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130401]
	6	D.S. Broomhead and D. Lowe, Multivariable functional interpolation and adaptive networks, Complex Systems, 2, 1988: 321-355.
	7	J. Bruck, Harmonic analysis of polynomial threshold functions, SIAM Journ. Disc. Math., 3 (2), 1990: 168-177.
	8	T.M. Cover, Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition, IEEE Trans. Electronic Computers 14, 1965: 326-334.
	9	R.M. Dudley, Central limit theorems for empirical measures, Ann. Probability 6, 1978: 899-929.
	10	C. Gotsman, On boolean functions, polynomials and algebraic threshold functions. Technical report TR-89-18, Department of Computer Science, Hebrew University, 1989.
	11	S. B. Holden and P. J. W. Rayner, Generalization and PAC learning: Some new results for the class of generalized single layer networks, IEEE Transactions on Neural Networks 1993, in press.
	12	D. Lowe. Adaptive radial basis function nonlinearities and the problem of generalization. In Proceedings of the First IEE International Conference on Artificzal Neural Networks, pages 171- 175, 1989.
	13	Wolfgang Maass, Bounds for the computational power and learning complexity of analog neural nets, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.335-344, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167193]
	14	C.A. MiccheUi. Interpolation of scattered data: Distance matrices and conditionally positive definite functions. Constructive Approximation, 2, 1986: 11-22.
	15	M. Minsky and S. Papert, Perceptrons. MIT Press, Cambridge, MA., 1969. (Expanded edition 1988.)
	16	J.W. Moon, Four combinatorial problems, in Combinatorial Mathematics and its Applications (ed. D.J.A. Welsh), 185-190, Academic Press, London, 1971.
	17	S. Muroga, Threshold Logic and its Applications, Wiley, New York, 1971.
	18	N.J. Nilsson, Learning Machines, McGraw-Hill, New York, 1965.
	19	M. Niranjan and F. Fallside, Neural networks and radial basis functions in classifying static speech patterns. Technical Report CUED/F- INFENG/TR 22 (1988), Cambridge University Engineering Department, 1988.
	20	R. Paturi and M. Saks, On threshold circuits for parity, In Proceedings of 31st IEEE Symposium on Foundations of Computer Science, 1990.
	21	T. Poggio and F. Girosi, Networks for approximation and learning, Proceedings of the IEEE, 78(9), 1990: 1481-1497.
	22	M.J.D. Powell, Radial basis functions for multivariable interpolation: A review. Technical Report #DAMTP 1985/NA12, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, October 1985.
	23	M.J.D.Powell, The Theory of Radial Basis Function Approximation in 1990. Technical report #DAMTP 1990/NAll, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, December 1990.
	24	R.W. Prager and F. Fallside, The modified Kanerva model for automatic speech recognition, Computer Speech and Language, 3, 1989: 61-81.
	25	S. Renals and R. Rohwer. Phoneme classification experiments using radial basis functions. In Proceedings of the International Joint Conference on Neural Networks, pages 1-461-I-467, June 1989.
	26	Kathleen Romanik , Carl Smith, Testing geometric objects, University of Maryland at College Park, College Park, MD, 1990
	27	Michael E. Saks, Slicing the hypercube, Surveys in combinatorics, 1993, Cambridge University Press, New York, NY, 1993
	28	Eduardo D. Sontag, Feedforward nets for interpolation and classification, Journal of Computer and System Sciences, v.45 n.1, p.20-48, Aug. 1992 [doi>10.1016/0022-0000(92)90039-L]
	29	L. G. Valiant, A theory of the learnable, Communications of the ACM, v.27 n.11, p.1134-1142, Nov. 1984 [doi>10.1145/1968.1972]
	30	V.N. Vapnik and A. Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2), 1971: 264-280.
	31	Chi Wang , A. C. Williams, The threshold order of a Boolean function, Discrete Applied Mathematics, v.31 n.1, p.51-69, March 11, 1991 [doi>10.1016/0166-218X(91)90032-R]

CITED BY 2

	Wee Sun Lee , Peter L. Bartlett , Robert C. Williamson, Lower bounds on the VC-dimension of smoothly parametrized function classes, Proceedings of the seventh annual conference on Computational learning theory, p.362-367, July 12-15, 1994, New Brunswick, New Jersey, United States
	Dan Roth, Learning in natural language, Proceedings of the 16th international joint conference on Artificial intelligence, p.898-904, July 31-August 06, 1999, Stockholm, Sweden