Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Maass, W.
Right arrow Articles by Sontag, E. D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Maass, W.
Right arrow Articles by Sontag, E. D.

Neural Computation, Vol 11, 771-782, Copyright © 1999 by The MIT Press

LETTERS

Analog Neural Nets with Gaussian or Other Common Noise Distribution Cannot Recognize Arbitrary Regular Languages

Wolfgang Maass and Eduardo D. Sontag

We consider recurrent analog neural nets where the output of each gate is subject to gaussian noise or any other common noise distribution that is nonzero on a sufficiently large part of the state-space. We show that many regular languages cannot be recognized by networks of this type, and we give a precise characterization of languages that can be recognized. This result implies severe constraints on possibilities for constructing recurrent analog neural nets that are robust against realistic types of analog noise. On the other hand, we present a method for constructing feedforward analog neural nets that are robust with regard to analog noise of this type.


This article has been cited by other articles:


Home page
 J. Neurophysiol.Home page
D. V. Buonomano
A Learning Rule for the Emergence of Stable Dynamics and Timing in Recurrent Networks
J Neurophysiol, October 1, 2005; 94(4): 2275 - 2283.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
J. Sima and P. Orponen
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
Neural Comput., December 1, 2003; 15(12): 2727 - 2778.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
B. Hammer and P. Tino
Recurrent Neural Networks with Small Weights Implement Definite Memory Machines
Neural Comput., August 1, 2003; 15(8): 1897 - 1929.
[Abstract] [Full Text]

Home page
 Neural Comput.Home page
J. Sima and P. Orponen
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
Neural Comput., March 1, 2003; 15(3): 693 - 733.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
W. Maass, T. Natschlager, and H. Markram
Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations
Neural Comput., November 1, 2002; 14(11): 2531 - 2560.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
R. C. Carrasco, M. L. Forcada, M. A. Valdés-Muñoz, and R. P. Ñeco
Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units
Neural Comput., September 1, 2000; 12(9): 2129 - 2174.
[Abstract] [Full Text]


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1999 by The MIT Press.