Arrow Research search

Author name cluster

Wolfgang Maass

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

40 papers
1 author row

Possible papers

40

IJCAI Conference 2024 Conference Paper

REAVER: Real-time Earthquake Prediction with Attention-based Sliding-Window Spectrograms

  • Lotfy Abdel Khaliq
  • Sabine Janzen
  • Wolfgang Maass

Predicting earthquakes with precision remains an ongoing challenge in earthquake early warning systems (EEWS), that struggle with accuracy and fail to provide timely warnings for impending earthquakes. Recent efforts employing deep learning techniques have shown promise in overcoming these limitations. However, current methods lack the ability to capture subtle frequency changes indicative of seismic activity in real-time, limiting their effectiveness in EEWS. To address this gap, we propose REAVER, a novel approach for real-time prediction of P- and S-waves of earthquakes using attention-based sliding-window spectrograms. REAVER leverages Mel-Spectrogram signal representations to capture temporal frequency changes in seismic signals effectively. By employing an encoder-decoder architecture with attention mechanisms, REAVER accurately predicts the onset of P- and S-waves moments when an earthquake occurs. We benchmark the effectiveness of REAVER, showing its performance in terms of both accuracy and real-time prediction capabilities compared to existing methods. Additionally, we provide a web-based implementation of REAVER, allowing users to monitor seismic activity in real-time and analyze historical earthquake waveforms.

IJCAI Conference 2024 Conference Paper

SACNN: Self Attention-based Convolutional Neural Network for Fraudulent Behaviour Detection in Sports

  • Maxx Richard Rahman
  • Lotfy Abdel Khaliq
  • Thomas Piper
  • Hans Geyer
  • Tristan Equey
  • Norbert Baume
  • Reid Aikin
  • Wolfgang Maass

Doping practices in sports by unscrupulous athletes have been an important societal issue for several decades. Recently, sample swapping has been raised as a potential practice performed by athletes to swap their doped samples with clean samples to evade the positive doping test. So far, the only proven method to detect such cases is by performing DNA analysis on samples. However, it is expensive and time-consuming, which goes beyond the budgetary limits of anti-doping organisations when implementing to all the samples collected during sports events. Therefore, in this paper, we propose a self attention-based convolutional neural network (SACNN) that incorporates both spatial and temporal behaviour of the longitudinal profile and generates embedding maps for solving the fraud detection problem in sports. We conduct extensive experiments on the real-world datasets. The result shows that SACNN outperforms other state-of-the-art baseline models for sequential anomaly detection. Moreover, we conduct a study with domain experts on real-world profiles using both DNA analysis and our proposed method; the result demonstrates the effectiveness of our proposed method and the impact it could bring to the society.

NeurIPS Conference 2018 Conference Paper

Long short-term memory and Learning-to-learn in networks of spiking neurons

  • Guillaume Bellec
  • Darjan Salaj
  • Anand Subramoney
  • Robert Legenstein
  • Wolfgang Maass

Recurrent networks of spiking neurons (RSNNs) underlie the astounding computing and learning capabilities of the brain. But computing and learning capabilities of RSNN models have remained poor, at least in comparison with ANNs. We address two possible reasons for that. One is that RSNNs in the brain are not randomly connected or designed according to simple rules, and they do not start learning as a tabula rasa network. Rather, RSNNs in the brain were optimized for their tasks through evolution, development, and prior experience. Details of these optimization processes are largely unknown. But their functional contribution can be approximated through powerful optimization methods, such as backpropagation through time (BPTT). A second major mismatch between RSNNs in the brain and models is that the latter only show a small fraction of the dynamics of neurons and synapses in the brain. We include neurons in our RSNN model that reproduce one prominent dynamical process of biological neurons that takes place at the behaviourally relevant time scale of seconds: neuronal adaptation. We denote these networks as LSNNs because of their Long short-term memory. The inclusion of adapting neurons drastically increases the computing and learning capability of RSNNs if they are trained and configured by deep learning (BPTT combined with a rewiring algorithm that optimizes the network architecture). In fact, the computational performance of these RSNNs approaches for the first time that of LSTM networks. In addition RSNNs with adapting neurons can acquire abstract knowledge from prior learning in a Learning-to-Learn (L2L) scheme, and transfer that knowledge in order to learn new but related tasks from very few examples. We demonstrate this for supervised learning and reinforcement learning.

NeurIPS Conference 2018 Conference Paper

Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons

  • Nima Anari
  • Constantinos Daskalakis
  • Wolfgang Maass
  • Christos Papadimitriou
  • Amin Saberi
  • Santosh Vempala

We analyze linear independence of rank one tensors produced by tensor powers of randomly perturbed vectors. This enables efficient decomposition of sums of high-order tensors. Our analysis builds upon [BCMV14] but allows for a wider range of perturbation models, including discrete ones. We give an application to recovering assemblies of neurons. Assemblies are large sets of neurons representing specific memories or concepts. The size of the intersection of two assemblies has been shown in experiments to represent the extent to which these memories co-occur or these concepts are related; the phenomenon is called association of assemblies. This suggests that an animal's memory is a complex web of associations, and poses the problem of recovering this representation from cognitive data. Motivated by this problem, we study the following more general question: Can we reconstruct the Venn diagram of a family of sets, given the sizes of their l-wise intersections? We show that as long as the family of sets is randomly perturbed, it is enough for the number of measurements to be polynomially larger than the number of nonempty regions of the Venn diagram to fully reconstruct the diagram.

RLDM Conference 2015 Conference Abstract

Reward-based network plasticity as Bayesian inference

  • Stefan Habenschuss
  • Robert Legenstein
  • David Kappel
  • Wolfgang Maass

We reexamine the conceptual and mathematical framework for modeling and understanding rein- forcement learning in biological networks of neurons. One commonly assumes that reinforcement learning processes move neuronal network parameters to values that maximize (locally) the long-term expectation of rewards. But this view is in conflict with biological data from at least two perspectives. One is, that this approach ignores experimentally observed structural rules of biological networks of neurons, such as sparse connectivity, specific connection probabilities between specific types of neurons and brain areas, and heavy-tailed distributions of synaptic weights. In addition, substantial experimental evidence (e. g. , on spine motility, fluctuation of PSD-95 proteins) suggests that synaptic connections and synaptic efficacies are con- tinuously fluctuating, to some extent even in the absence of network activity. We show that, if one takes both of these biological constraints into account, a new approach arises that is not only consistent with the above mentioned experimental data, but also has interesting new functional properties that have been posited from the perspective of learning theory [MacKay 1992; Pouget et al. , 2013]. Our novel conceptual framework is based on stochastic synaptic plasticity rules. Stochastic plasticity enables networks of neurons to learn a posterior distribution of network configurations by sampling from this posterior. This enables these net- works to observe given priors and it can enhance their generalization capability. Synaptic plasticity rules are formulated in our approach as reward-modulated stochastic differential equations. Via Fokker-Planck equa- tions one can relate them rigorously to the resulting posterior distribution of network configurations from which the network samples. Hence this framework provides a new method for relating local reward-based plasticity rules to reward-based learning on the network level. Poster M7*: The Role of Orbitofrontal Cortex in Cognitive Planning in the Rat Kevin Miller*, Princeton University; Matthew Botvinick, Princeton University; Carlos Brody, Princeton Neuroscience Institute / Howard Hughes Medical Institute Imagine you are playing chess. As you think about your next move, you consider the outcome each possibility will have on the board, and the likely responses of your opponent. Your knowledge of the board and the rules constitutes an internal model of the chess game. Guiding your behavior on the basis of model-predicted outcomes of your actions is the very definition of cognitive planning. It has been known for many decades that humans and animals can plan (Tolman, 1948), but the neural mechanisms of planning remain largely unknown. Recently, a powerful new tool for the study of planning has become available: the ‘two-step’ task introduced by Daw et al. (2011). This task allows, for the first time, the collection of multiple trials of planned behavior within a single experimental session, opening the door to many new experimental possibilities. We have adapted the two-step task for use with rodents, and developed a semi- automated pipeline to efficiently train large numbers of animals. Here, we show that the rodent two-step task reliably elicits planning behavior in rats, and we characterize the role of the orbitofrontal cortex (OFC) in this planning behavior. We find that inactivations of OFC substantially impair the ability to plan, and that single units in OFC encode planning-related variables, such as the values associated with actions taken at each step in the two-step task. These data demonstrate the OFC is crucial for planning, and begin to shed light on the computational role that it plays in the planning process.

NeurIPS Conference 2015 Conference Paper

Synaptic Sampling: A Bayesian Approach to Neural Network Plasticity and Rewiring

  • David Kappel
  • Stefan Habenschuss
  • Robert Legenstein
  • Wolfgang Maass

We reexamine in this article the conceptual and mathematical framework for understanding the organization of plasticity in spiking neural networks. We propose that inherent stochasticity enables synaptic plasticity to carry out probabilistic inference by sampling from a posterior distribution of synaptic parameters. This view provides a viable alternative to existing models that propose convergence of synaptic weights to maximum likelihood parameters. It explains how priors on weight distributions and connection probabilities can be merged optimally with learned experience. In simulations we show that our model for synaptic plasticity allows spiking neural networks to compensate continuously for unforeseen disturbances. Furthermore it provides a normative mathematical framework to better understand the permanent variability and rewiring observed in brain networks.

NeurIPS Conference 2009 Conference Paper

Functional network reorganization in motor cortex can be explained by reward-modulated Hebbian learning

  • Steven Chase
  • Andrew Schwartz
  • Wolfgang Maass
  • Robert Legenstein

The control of neuroprosthetic devices from the activity of motor cortex neurons benefits from learning effects where the function of these neurons is adapted to the control task. It was recently shown that tuning properties of neurons in monkey motor cortex are adapted selectively in order to compensate for an erroneous interpretation of their activity. In particular, it was shown that the tuning curves of those neurons whose preferred directions had been misinterpreted changed more than those of other neurons. In this article, we show that the experimentally observed self-tuning properties of the system can be explained on the basis of a simple learning rule. This learning rule utilizes neuronal noise for exploration and performs Hebbian weight updates that are modulated by a global reward signal. In contrast to most previously proposed reward-modulated Hebbian learning rules, this rule does not require extraneous knowledge about what is noise and what is signal. The learning rule is able to optimize the performance of the model system within biologically realistic periods of time and under high noise levels. When the neuronal noise is fitted to experimental data, the model produces learning effects similar to those found in monkey experiments.

NeurIPS Conference 2009 Conference Paper

Replacing supervised classification learning by Slow Feature Analysis in spiking neural networks

  • Stefan Klampfl
  • Wolfgang Maass

Many models for computations in recurrent networks of neurons assume that the network state moves from some initial state to some fixed point attractor or limit cycle that represents the output of the computation. However experimental data show that in response to a sensory stimulus the network state moves from its initial state through a trajectory of network states and eventually returns to the initial state, without reaching an attractor or limit cycle in between. This type of network response, where salient information about external stimuli is encoded in characteristic trajectories of continuously varying network states, raises the question how a neural system could compute with such code, and arrive for example at a temporally stable classification of the external stimulus. We show that a known unsupervised learning algorithm, Slow Feature Analysis (SFA), could be an important ingredient for extracting stable information from these network trajectories. In fact, if sensory stimuli are more often followed by another stimulus from the same class than by a stimulus from another class, SFA approaches the classification capability of Fishers Linear Discriminant (FLD), a powerful algorithm for supervised learning. We apply this principle to simulated cortical microcircuits, and show that it enables readout neurons to learn discrimination of spoken digits and detection of repeating firing patterns within a stream of spike trains with the same firing statistics, without requiring any supervision for learning.

NeurIPS Conference 2009 Conference Paper

STDP enables spiking neurons to detect hidden causes of their inputs

  • Bernhard Nessler
  • Michael Pfeiffer
  • Wolfgang Maass

The principles by which spiking neurons contribute to the astounding computational power of generic cortical microcircuits, and how spike-timing-dependent plasticity (STDP) of synaptic weights could generate and maintain this computational function, are unknown. We show here that STDP, in conjunction with a stochastic soft winner-take-all (WTA) circuit, induces spiking neurons to generate through their synaptic weights implicit internal models for subclasses (or causes") of the high-dimensional spike patterns of hundreds of pre-synaptic neurons. Hence these neurons will fire after learning whenever the current input best matches their internal model. The resulting computational function of soft WTA circuits, a common network motif of cortical microcircuits, could therefore be a drastic dimensionality reduction of information streams, together with the autonomous creation of internal models for the probability distributions of their input patterns. We show that the autonomous generation and maintenance of this computational function can be explained on the basis of rigorous mathematical principles. In particular, we show that STDP is able to approximate a stochastic online Expectation-Maximization (EM) algorithm for modeling the input data. A corresponding result is shown for Hebbian learning in artificial neural networks. "

NeurIPS Conference 2008 Conference Paper

Hebbian Learning of Bayes Optimal Decisions

  • Bernhard Nessler
  • Michael Pfeiffer
  • Wolfgang Maass

Uncertainty is omnipresent when we perceive or interact with our environment, and the Bayesian framework provides computational methods for dealing with it. Mathematical models for Bayesian decision making typically require datastructures that are hard to implement in neural networks. This article shows that even the simplest and experimentally best supported type of synaptic plasticity, Hebbian learning, in combination with a sparse, redundant neural code, can in principle learn to infer optimal Bayesian decisions. We present a concrete Hebbian learning rule operating on log-probability ratios. Modulated by reward-signals, this Hebbian plasticity rule also provides a new perspective for understanding how Bayesian inference could support fast reinforcement learning in the brain. In particular we show that recent experimental results by Yang and Shadlen [1] on reinforcement learning of probabilistic inference in primates can be modeled in this way.

NeurIPS Conference 2007 Conference Paper

Simplified Rules and Theoretical Analysis for Information Bottleneck Optimization and PCA with Spiking Neurons

  • Lars Buesing
  • Wolfgang Maass

We show that under suitable assumptions (primarily linearization) a simple and perspicuous online learning rule for Information Bottleneck optimization with spiking neurons can be derived. This rule performs on common benchmark tasks as well as a rather complex rule that has previously been proposed \cite{KlampflETAL: 07b}. Furthermore, the transparency of this new learning rule makes a theoretical analysis of its convergence properties feasible. A variation of this learning rule (with sign changes) provides a theoretically founded method for performing Principal Component Analysis {(PCA)} with spiking neurons. By applying this rule to an ensemble of neurons, different principal components of the input can be extracted. In addition, it is possible to preferentially extract those principal components from incoming signals $X$ that are related or are not related to some additional target signal $Y_T$. In a biological interpretation, this target signal $Y_T$ (also called relevance variable) could represent proprioceptive feedback, input from other sensory modalities, or top-down signals.

NeurIPS Conference 2007 Conference Paper

Theoretical Analysis of Learning with Reward-Modulated Spike-Timing-Dependent Plasticity

  • Dejan Pecevski
  • Wolfgang Maass
  • Robert Legenstein

Reward-modulated spike-timing-dependent plasticity (STDP) has recently emerged as a candidate for a learning rule that could explain how local learning rules at single synapses support behaviorally relevant adaptive changes in com- plex networks of spiking neurons. However the potential and limitations of this learning rule could so far only be tested through computer simulations. This ar- ticle provides tools for an analytic treatment of reward-modulated STDP, which allow us to predict under which conditions reward-modulated STDP will be able to achieve a desired learning effect. In particular, we can produce in this way a theoretical explanation and a computer model for a fundamental experimental finding on biofeedback in monkeys (reported in [1]).

NeurIPS Conference 2006 Conference Paper

Information Bottleneck Optimization and Independent Component Extraction with Spiking Neurons

  • Stefan Klampfl
  • Wolfgang Maass
  • Robert Legenstein

The extraction of statistically independent components from high-dimensional multi-sensory input streams is assumed to be an essential component of sensory processing in the brain. Such independent component analysis (or blind source separation) could provide a less redundant representation of information about the external world. Another powerful processing strategy is to extract preferentially those components from high-dimensional input streams that are related to other information sources, such as internal predictions or proprioceptive feedback. This strategy allows the optimization of internal representation according to the infor- mation bottleneck method. However, concrete learning rules that implement these general unsupervised learning principles for spiking neurons are still missing. We show how both information bottleneck optimization and the extraction of inde- pendent components can in principle be implemented with stochastically spiking neurons with refractoriness. The new learning rule that achieves this is derived from abstract information optimization principles.

NeurIPS Conference 2006 Conference Paper

Temporal dynamics of information content carried by neurons in the primary visual cortex

  • Danko Nikolić
  • Stefan Haeusler
  • Wolf Singer
  • Wolfgang Maass

We use multi-electrode recordings from cat primary visual cortex and investigate whether a simple linear classifier can extract information about the presented stim(cid: 173) uli. We find that information is extractable and that it even lasts for several hun(cid: 173) dred milliseconds after the stimulus has been removed. In a fast sequence of stim(cid: 173) ulus presentation, information about both new and old stimuli is present simul(cid: 173) taneously and nonlinear relations between these stimuli can be extracted. These results suggest nonlinear properties of cortical representations. The important im(cid: 173) plications of these properties for the nonlinear brain theory are discussed.

NeurIPS Conference 2005 Conference Paper

A Criterion for the Convergence of Learning with Spike Timing Dependent Plasticity

  • Robert Legenstein
  • Wolfgang Maass

We investigate under what conditions a neuron can learn by experimen- tally supported rules for spike timing dependent plasticity (STDP) to pre- dict the arrival times of strong “teacher inputs” to the same neuron. It turns out that in contrast to the famous Perceptron Convergence Theo- rem, which predicts convergence of the perceptron learning rule for a simplified neuron model whenever a stable solution exists, no equally strong convergence guarantee can be given for spiking neurons with STDP. But we derive a criterion on the statistical dependency structure of input spike trains which characterizes exactly when learning with STDP will converge on average for a simple model of a spiking neuron. This criterion is reminiscent of the linear separability criterion of the Percep- tron Convergence Theorem, but it applies here to the rows of a correlation matrix related to the spike inputs. In addition we show through computer simulations for more realistic neuron models that the resulting analyti- cally predicted positive learning results not only hold for the common interpretation of STDP where STDP changes the weights of synapses, but also for a more realistic interpretation suggested by experimental data where STDP modulates the initial release probability of dynamic synapses.

NeurIPS Conference 2005 Conference Paper

Principles of real-time computing with feedback applied to cortical microcircuit models

  • Wolfgang Maass
  • Prashant Joshi
  • Eduardo Sontag

The network topology of neurons in the brain exhibits an abundance of feedback connections, but the computational function of these feedback connections is largely unknown. We present a computational theory that characterizes the gain in computational power achieved through feedback in dynamical systems with fading memory. It implies that many such systems acquire through feedback universal computational capabilities for analog computing with a non-fading memory. In particular, we show that feedback enables such systems to process time-varying input streams in diverse ways according to rules that are implemented through internal states of the dynamical system. In contrast to previous attractor-based computational models for neural networks, these flexible internal states are high-dimensional attractors of the circuit dynamics, that still allow the circuit state to absorb new information from online input streams. In this way one arrives at novel models for working memory, integration of evidence, and reward expectation in cortical circuits. We show that they are applicable to circuits of conductance-based Hodgkin-Huxley (HH) neurons with high levels of noise that reflect experimental data on in- vivo conditions.

NeurIPS Conference 2004 Conference Paper

Methods for Estimating the Computational Power and Generalization Capability of Neural Microcircuits

  • Wolfgang Maass
  • Robert Legenstein
  • Nils Bertschinger

What makes a neural microcircuit computationally powerful? Or more precisely, which measurable quantities could explain why one microcir- cuit C is better suited for a particular family of computational tasks than another microcircuit C? We propose in this article quantitative measures for evaluating the computational power and generalization capability of a neural microcircuit, and apply them to generic neural microcircuit mod- els drawn from different distributions. We validate the proposed mea- sures by comparing their prediction with direct evaluations of the com- putational performance of these microcircuit models. This procedure is applied first to microcircuit models that differ with regard to the spatial range of synaptic connections and with regard to the scale of synaptic efficacies in the circuit, and then to microcircuit models that differ with regard to the level of background input currents and the level of noise on the membrane potential of neurons. In this case the proposed method allows us to quantify differences in the computational power and gen- eralization capability of circuits in different dynamic regimes (UP- and DOWN-states) that have been demonstrated through intracellular record- ings in vivo. 1 Introduction Rather than constructing particular microcircuit models that carry out particular computa- tions, we pursue in this article a different strategy, which is based on the assumption that the computational function of cortical microcircuits is not fully genetically encoded, but rather emerges through various forms of plasticity ("learning") in response to the actual distribution of signals that the neural microcircuit receives from its environment. From this perspective the question about the computational function of cortical microcircuits C turns into the questions: a) What functions (i. e. maps from circuit inputs to circuit outputs) can the circuit C learn to compute. b) How well can the circuit C generalize a specific learned computational function to new inputs? We propose in this article a conceptual framework and quantitative measures for the in- vestigation of these two questions. In order to make this approach feasible, in spite of numerous unknowns regarding synaptic plasticity and the distribution of electrical and bio- chemical signals impinging on a cortical microcircuit, we make in the present first step of this approach the following simplifying assumptions: Particular neurons ("readout neurons") learn via synaptic plasticity to extract specific information encoded in the spiking activity of neurons in the circuit. We assume that the cortical microcircuit itself is highly recurrent, but that the impact of feedback that a readout neuron might send back into this circuit can be neglected. 1 We assume that synaptic plasticity of readout neurons enables them to learn arbitrary linear transformations. More precisely, we assume that the input to such readout neuron can be approximated by a term n-1 w i=1 ixi(t), where n - 1 is the number of presynaptic neurons, xi(t) results from the output spike train of the ith presynaptic neuron by filtering it according to the low-pass filtering property of the membrane of the readout neuron, 2 and wi is the efficacy of the synaptic connection. Thus wixi(t) models the time course of the contribution of previous spikes from the ith presynaptic neuron to the membrane potential at the soma of this readout neuron. We will refer to the vector x(t) as the circuit state at time t. Under these unpleasant but apparently unavoidable simplifying assumptions we propose new quantitative criteria based on rigorous mathematical principles for evaluating a neural microcircuit C with regard to questions a) and b). We will compare in sections 4 and 5 the predictions of these quantitative measures with the actual computational performance achieved by 132 different types of neural microcircuit models, for a fairly large number of different computational tasks. All microcircuit models that we consider are based on bio- logical data for generic cortical microcircuits (as described in section 3), but have different settings of their parameters. 2 Measures for the kernel-quality and generalization capability of neural microcircuits One interesting measure for probing the computational power of a neural circuit is the pair- wise separation property considered in [Maass et al. , 2002]. This measure tells us to what extent the current circuit state x(t) reflects details of the input stream that occurred some time back in the past (see Fig. 1). Both circuit 2 and circuit 3 could be described as being chaotic since state differences resulting from earlier input differences persist. The "edge-of- chaos" [Langton, 1990] lies somewhere between points 1 and 2 according to Fig. 1c). But the best computational performance occurs between points 2 and 3 (see Fig. 2b)). Hence the "edge-of-chaos" is not a reliable predictor of computational power for circuits of spik- ing neurons. In addition, most real-world computational tasks require that the circuit gives a desired output not just for 2, but for a fairly large number m of significantly different inputs. One could of course test whether a circuit C can separate each of the m pairs of 2 1This assumption is best justified if such readout neuron is located for example in another brain area that receives massive input from many neurons in this microcircuit and only has diffuse back- wards projection. But it is certainly problematic and should be addressed in future elaborations of the present approach. 2One can be even more realistic and filter it also by a model for the short term dynamics of the synapse into the readout neuron, but this turns out to make no difference for the analysis proposed in this article. 8 a 4 b state separation 0. 25 c 4 7 2 circuit 3 0. 2 0 2 6 3 0 1 2 3 5 0. 2 1 0. 15 0. 7 scale 2 4 0. 1 0. 5 W circuit 2 0. 1 0. 3 3 1 00 1 2 3 state separation 2 0. 1 0. 05 0. 1 1 0. 05 0. 05 circuit 1 0 0. 5 1 1. 4 2 3 4 6 8 0 1. 4 1. 6 1. 8 2 2. 2 0 1 2 3 t [s] Figure 1: Pointwise separation property for different types of neural microcircuit models as specified in section 3. Each circuit C was tested for two arrays u and v of 4 input spike trains at 20 Hz over 3 s that differed only during the first second. a) Euclidean differences between resulting circuit states xu(t) and xv(t) for t = 3 s, averaged over 20 circuits C and 20 pairs u, v for each indicated value of and Wscale (see section 3). b) Temporal evolution of xu(t) - xv(t) for 3 different circuits with values of, Wscale according to the 3 points marked in panel a) ( = 1. 4, 2, 3 and Wscale = 0. 3, 0. 7, 2 for circuit 1, 2, and 3 respectively). c) Pointwise separation along a straight line between point 1 and point 2 of panel a). such inputs. But even if the circuit can do this, we do not know whether a neural readout from such circuit would be able to produce given target outputs for these m inputs. Therefore we propose here the linear separation property as a more suitable quantitative measure for evaluating the computational power of a neural microcircuit (or more precisely: the kernel-quality of a circuit; see below). To evaluate the linear separation property of a circuit C for m different inputs u1, .. ., um (which are in this article always functions of time, i. e. input streams such as for example multiple spike trains) we compute the rank of the n m matrix M whose columns are the circuit states xu (t i 0 ) resulting at some fixed time t0 for the preceding input stream ui. If this matrix has rank m, then it is guaranteed that any given assignment of target outputs yi R at time t0 for the inputs ui can be implemented by this circuit C (in combination with a linear readout). In particular, each of the 2m possible binary classifications of these m inputs can then be carried out by a linear readout from this fixed circuit C. Obviously such insight is much more informative than a demonstration that some particular classification task can be carried out by such circuit C. If the rank of this matrix M has a value r 8 0. 7 b 4 a 2 3 0. 65 1 0. 7 scale 2 0. 5 W 0. 3 1 0. 6 0 50 100 150 200 0 50 100 150 200 0. 1 t [ms] t [ms] 0. 05 0. 5 1 1. 4 2 3 4 6 8 Figure 2: Performance of different types of neural microcircuit models for classification of spike patterns. a) In the top row are two examples of the 80 spike patterns that were used (each consisting of 4 Poisson spike trains at 20 Hz over 200 ms), and in the bottom row are examples of noisy variations (Gaussian jitter with SD 10 ms) of these spike patterns which were used as circuit inputs. b) Fraction of examples (for 200 test examples) that were correctly classified by a linear readout (trained by linear regression with 500 training examples). Results are shown for 90 different types of neural microcircuits C with varying on the x-axis and Wscale on the y-axis (20 randomly drawn circuits and 20 target classification functions randomly drawn from the set of 280 possible classification functions were tested for each of the 90 different circuit types, and resulting correctness-rates were averaged. The mean SD of the results is 0. 028. ). Points 1, 2, 3 defined as in Fig. 1. Linear readouts from circuits with n - 1 neurons were assumed to compute a weighted sum n-1 w i=1 ixi(t) + w0 (see section 1). In order to simplify notation we assume that the vector x(t) contains an additional constant component x0(t) = 1, so that one can write w x(t) instead of n-1 w i=1 ixi(t) + w0. In the case of classification tasks we assume that the readout outputs 1 if w x(t) 0, and 0 otherwise. 4 Evaluating the influence of synaptic connectivity on computational performance Neural microcircuits were drawn from the distribution described in section 3 for 10 differ- ent values of (which scales the number and average distance of synaptically connected neurons) and 9 different values of Wscale (which scales the efficacy of all synaptic connec- tions). 20 microcircuit models C were drawn for each of these 90 different assignments of values to and Wscale. For each circuit a linear readout was trained to perform one (randomly chosen) out of 280 possible classification tasks on noisy variations u of 80 fixed spike patterns as circuit inputs u. The target performance of any such circuit input was to output at time t = 100 ms the class (0 or 1) of the spike pattern from which the preceding circuit input had been generated (for some arbitrary partition of the 80 fixed spike patterns into two classes. Each spike pattern u consisted of 4 Poisson spike trains over 200 ms. Per- formance results are shown in Fig. 2b for 90 different types of neural microcircuit models. We now test the predictive quality of the two proposed measures for the computational power of a microcircuit on spike patterns. One should keep in mind that the proposed measures do not attempt to test the computational capability of a circuit for one particu- lar computational task, but for any distribution on Suniv and for a very large (in general infinitely large) family of computational tasks that only have in common a particular bias regarding which aspects of the incoming spike trains may carry information that is relevant for the target output of computations, and which aspects should be viewed as noise. Fig. 3a explains why the lower left part of the parameter map in Fig. 2b is less suitable for any 8 8 8 a b c 20 4 450 4 450 4 2 400 2 400 2 3 15 1 350 1 350 1 0. 7 0. 7 0. 7 scale 2 0. 5 W 0. 5 0. 5 10 300 300 0. 3 0. 3 0. 3 1 250 250 5 0. 1 0. 1 200 0. 1 200 0. 05 0. 05 0. 05 0 0. 5 1 1. 4 2 3 4 6 8 0. 5 1 1. 4 2 3 4 6 8 0. 5 1 1. 4 2 3 4 6 8 Figure 3: Values of the proposed measures for computations on spike patterns. a) Kernel-quality for spike patterns of 90 different circuit types (average over 20 circuits, mean SD = 13; For each circuit, the average over 5 different sets of spike patterns was used). 6 b) Generalization capability for spike patterns: estimated VC-dimension of HC (for a set Suniv of inputs u consisting of 500 jittered versions of 4 spike patterns), for 90 different circuit types (average over 20 circuits, mean SD = 14; For each circuit, the average over 5 different sets of spike patterns was used). c) Difference of both measures (mean SD = 5. 3). This should be compared with actual computational performance plotted in Fig. 2b. Points 1, 2, 3 defined as in Fig. 1. such computation, since there the kernel-quality of the circuits is too low. Fig. 3b explains why the upper right part of the parameter map in Fig. 2b is less suitable, since a higher VC-dimension (for a training set of fixed size) entails poorer generalization capability. We are not aware of a theoretically founded way of combining both measures into a single value that predicts overall computational performance. But if one just takes the difference of both measures then the resulting number (see Fig. 3c) predicts quite well which types of neural microcircuit models perform well for the particular computational tasks considered in Fig. 2b. 5 Evaluating the computational power of neural microcircuit models in UP- and DOWN-states Data from numerous intracellular recordings suggest that neural circuits in vivo switch be- tween two different dynamic regimes that are commonly referred to as UP- and DOWN states. UP-states are characterized by a bombardment with synaptic inputs from recurrent activity in the circuit, resulting in a membrane potential whose average value is signifi- cantly closer to the firing threshold, but also has larger variance. We have simulated these different dynamic regimes by varying the background current Ibackground and the noise current Inoise. Fig. 4a shows that one can simulate in this way different dynamic regimes of the same circuit where the time course of the membrane potential qualitatively matches data from intracellular recordings in UP- and DOWN-states (see e. g. [Shu et al. , 2003]). We have tested the computational performance of circuits in 42 different dynamic regimes (for 7 values of Ibackground and 6 values of Inoise) with 3 complex nonlinear computations on firing rates of circuit inputs. 7 Inputs u consisted of 4 Poisson spike trains with time- varying rates (drawn independently every 30 ms from the interval of 0 to 80 Hz for the first two and the second two of 4 input spike trains, see middle row of Fig. 4a for a sample). Let f1(t) (f2(t)) be the actual sum of rates normalized to the interval [0, 1] for the first 6The rank of the matrix consisting of 500 circuit states xu(t) for t = 200 ms was computed for 500 spike patterns over 200 ms as described in section 2, see Fig. 2a. 7Computations on firing rates were chosen as benchmark tasks both because UP states were con- jectured to enhance the performance for such tasks, and because we want to show that the proposed measures are applicable to other types of computational tasks than those considered in section 4. 16 a 100 UP-state [mV] 14 m 50 V 12 0 16 100 DOWN-state [mV] 14 m 50 V 12 0 300 350 400 450 500 350 400 450 500 t [ms] t [ms] b c d 10 10 10 120 6 70 6 6 0. 2 4. 5 UP 4. 5 100 4. 5 60 0. 15 3. 2 3. 2 3. 2 80 I noise 50 0. 1 1. 9 DOWN 1. 9 60 1. 9 40 0. 05 40 30 0 0. 6 0. 6 20 0. 6 11. 5 12 12. 5 13. 5 14. 3 11. 5 12 12. 5 13. 5 14. 3 11. 5 12 12. 5 13. 5 14. 3 e f g 10 10 10 0. 25 6 6 6 0. 3 4. 5 0. 7 4. 5 4. 5 0. 2 3. 2 3. 2 3. 2 I noise 0. 6 1. 9 1. 9 0. 15 1. 9 0. 25 0. 5 0. 1 0. 2 0. 6 0. 6 0. 6 11. 5 12 12. 5 13. 5 14. 3 11. 5 12 12. 5 13. 5 14. 3 11. 5 12 12. 5 13. 5 14. 3 I I I background background background Figure 4: Analysis of the computational power of simulated neural microcircuits in different dy- namic regimes. a) Membrane potential (for a firing threshold of 15 mV) of two randomly selected neurons from circuits in the two parameter regimes marked in panel b), as well as spike rasters for the same two parameter regimes (with the actual circuit inputs shown between the two rows). b) Estimates of the kernel-quality for input streams u with 34 different combinations of firing rates from 0, 20, 40 Hz in the 4 input spike trains (mean SD = 12). c) Estimate of the VC-dimension for a set Suniv of inputs consisting of 200 different spike trains u that represent 2 different combinations of firing rates (mean SD = 4. 6). d) Difference of measures from panels b and c (after scaling each lin- early into a common range [0, 1]). e), f), g): Evaluation of the computational performance (correlation coefficient; all for test data; mean SD is 0. 06, 0. 04, and 0. 03 for panels e), f), and g) respectively. ) of the same circuits in different dynamic regimes for computations involving multiplication and abso- lute value of differences of firing rates (see text). The theoretically predicted parameter regime with good computational performance for any computations on firing rates (see panel d) agrees quite well with the intersection of areas with good computational performance in panels e, f, g. two (second two) input spike trains computed from the time interval [t - 30ms, t]. The computational tasks considered in Fig. 4 were to compute online (and in real-time) every 30 ms the functions f1(t) f2(t) (see panel e), to decide whether the value of the product f1(t) f2(t) lies in the interval [0. 1, 0. 3] or lies outside of this interval (see panel f), and to decide whether the absolute value of the difference f1(t) - f2(t) is greater than 0. 25 (see panel g). We wanted to test whether the proposed measures for computational power and general- ization capability were able to make reasonable predictions for this completely different parameter map, and for computations on firing rates instead of spike patterns. It turns out that also in this case the kernel-quality (Fig. 4b) explains why circuits in the dynamic regime corresponding to the left-hand side of the parameter map have inferior computa- tional power for all three computations on firing rates (see Fig. 4 e, f, g). The VC-dimension (Fig. 4c) explains the decline of computational performance in the right part of the pa- rameter map. The difference of both measures (Fig. 4d) predicts quite well the dynamic regime where high performance is achieved for all three computational tasks considered in Fig. 4 e, f, g. Note that Fig. 4e has high performance in the upper right corner, in spite of a very high VC-dimension. This could be explained by the inherent bias of linear readouts to compute smooth functions on firing rates, which fits particularly well to this particular target output. If one estimates kernel-quality and VC-dimension for the same circuits, but for computa- tions on sparse spike patterns (for an input ensemble Suniv similarly as in section 4), one finds that circuits at the lower left corner of this parameter map (corresponding to DOWN- states) are predicted to have better computational performance for these computations on sparse input. This agrees quite well with direct evaluations of computational performance (not shown). Hence the proposed quantitative measures may provide a theoretical founda- tion for understanding the computational function of different states of neural activity.

NeurIPS Conference 2003 Conference Paper

Information Dynamics and Emergent Computation in Recurrent Circuits of Spiking Neurons

  • Thomas Natschläger
  • Wolfgang Maass

We employ an efficient method using Bayesian and linear classifiers for analyzing the dynamics of information in high-dimensional states of generic cortical microcircuit models. It is shown that such recurrent cir- cuits of spiking neurons have an inherent capability to carry out rapid computations on complex spike patterns, merging information contained in the order of spike arrival with previously acquired context information.

NeurIPS Conference 2002 Conference Paper

A Model for Real-Time Computation in Generic Neural Microcircuits

  • Wolfgang Maass
  • Thomas Natschläger
  • Henry Markram

Henry Markram Brain Mind Institute EPFL, Lausanne, Switzerland henry. markram@epfl. ch A key challenge for neural modeling is to explain how a continuous stream of multi-modal input from a rapidly changing environment can be processed by stereotypical recurrent circuits of integrate-and-fire neurons in real-time. We propose a new computational model that is based on principles of high dimensional dynamical systems in combination with statistical learning theory. It can be implemented on generic evolved or found recurrent circuitry.

TCS Journal 2002 Journal Article

Neural circuits for pattern recognition with small total wire length

  • Robert A. Legenstein
  • Wolfgang Maass

One of the most basic pattern recognition problems is whether a certain local feature occurs in some linear array to the left of some other local feature. We construct in this article circuits that solve this problem with an asymptotically optimal number of threshold gates. Furthermore it is shown that much fewer threshold gates are needed if one employs in addition a small number of winner-take-all gates. In either case the circuits that are constructed have linear or almost linear total wire length, and are therefore not unrealistic from the point of view of physical implementations.

TCS Journal 2002 Journal Article

Spiking neurons and the induction of finite state machines

  • Thomas Natschläger
  • Wolfgang Maass

We discuss in this short survey article some current mathematical models from neurophysiology for the computational units of biological neural systems: neurons and synapses. These models are contrasted with the computational units of common artificial neural network models, which reflect the state of knowledge in neurophysiology 50 years ago. We discuss the problem of carrying out computations in circuits consisting of biologically realistic computational units, focusing on the biologically particularly relevant case of computations on time series. Finite state machines are frequently used in computer science as models for computations on time series. One may argue that these models provide a reasonable common conceptual basis for analyzing computations in computers and biological neural systems, although the emphasis in biological neural systems is shifted more towards asynchronous computation on analog time series. In the second half of this article some new computer experiments and theoretical results are discussed, which address the question whether a biological neural system can, in principle, learn to behave like a given simple finite state machine.

TCS Journal 2001 Journal Article

On the relevance of time in neural computation and learning

  • Wolfgang Maass

We discuss models for computation in biological neural systems that are based on the current state of knowledge in neurophysiology. Differences and similarities to traditional neural network models are highlighted. It turns out that many important questions regarding computation and learning in biological neural systems cannot be adequately addressed in traditional neural network models. In particular, the role of time is quite different in biologically more realistic models, and many fundamental questions regarding computation and learning have to be rethought for this context. Simultaneously, a somewhat related new generation of VLSI-chips is emerging (“pulsed VLSI”) where new ideas about computing and learning with temporal coding can be tested in an engineering context. Articles with details to models and results that are sketched in this article can be found at http: //www. tu-graz. ac. at/igi/maass/. We refer to Maass and Bishop (Eds. , Pulsed Neural Network, MIT Press, Cambridge, MA, 1999) for a collection of survey articles that contain further details and references.

NeurIPS Conference 2000 Conference Paper

Finding the Key to a Synapse

  • Thomas Natschläger
  • Wolfgang Maass

Experimental data have shown that synapses are heterogeneous: different synapses respond with different sequences of amplitudes of postsynaptic responses to the same spike train. Neither the role of synaptic dynamics itself nor the role of the heterogeneity of synaptic dynamics for com(cid: 173) putations in neural circuits is well understood. We present in this article methods that make it feasible to compute for a given synapse with known synaptic parameters the spike train that is optimally fitted to the synapse, for example in the sense that it produces the largest sum of postsynap(cid: 173) tic responses. To our surprise we find that most of these optimally fitted spike trains match common firing patterns of specific types of neurons that are discussed in the literature.

NeurIPS Conference 2000 Conference Paper

Foundations for a Circuit Complexity Theory of Sensory Processing

  • Robert Legenstein
  • Wolfgang Maass

We introduce total wire length as salient complexity measure for an anal(cid: 173) ysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineering. This new complexity measure is applied to a set of basic computational problems that apparently need to be solved by circuits for translation- and scale-invariant sensory process(cid: 173) ing. We exhibit new circuit design strategies for these new benchmark functions that can be implemented within realistic complexity bounds, in particular with linear or almost linear total wire length.

NeurIPS Conference 2000 Conference Paper

Processing of Time Series by Neural Circuits with Biologically Realistic Synaptic Dynamics

  • Thomas Natschläger
  • Wolfgang Maass
  • Eduardo Sontag
  • Anthony Zador

Experimental data show that biological synapses behave quite differently from the symbolic synapses in common artificial neural network models. Biological synapses are dynamic, i. e. , their "weight" changes on a short time scale by several hundred percent in dependence of the past input to the synapse. In this article we explore the consequences that these synaptic dynamics entail for the computational power of feedforward neural networks. We show that gradient descent suffices to approximate a given (quadratic) filter by a rather small neural system with dynamic synapses. We also compare our network model to artificial neural net(cid: 173) works designed for time series processing. Our numerical results are complemented by theoretical analysis which show that even with just a single hidden layer such networks can approximate a surprisingly large large class of nonlinear filters: all filters that can be characterized by Volterra series. This result is robust with regard to various changes in the model for synaptic dynamics.

NeurIPS Conference 1999 Conference Paper

Neural Computation with Winner-Take-All as the Only Nonlinear Operation

  • Wolfgang Maass

Everybody "knows" that neural networks need more than a single layer of nonlinear units to compute interesting functions. We show that this is false if one employs winner-take-all as nonlinear unit: • Any boolean function can be computed by a single k-winner-take(cid: 173) all unit applied to weighted sums of the input variables. • Any continuous function can be approximated arbitrarily well by a single soft winner-take-all unit applied to weighted sums of the input variables. • Only positive weights are needed in these (linear) weighted sums. This may be of interest from the point of view of neurophysiology, since only 15% of the synapses in the cortex are inhibitory. In addi(cid: 173) tion it is widely believed that there are special microcircuits in the cortex that compute winner-take-all. • Our results support the view that winner-take-all is a very useful basic computational unit in Neural VLS! : o it is wellknown that winner-take-all of n input variables can be computed very efficiently with 2n transistors (and a to(cid: 173) tal wire length and area that is linear in n) in analog VLSI [Lazzaro et at. , 1989] o we show that winner-take-all is not just useful for special pur(cid: 173) pose computations, but may serve as the only nonlinear unit for neural circuits with universal computational power o we show that any multi-layer perceptron needs quadratically in n many gates to compute winner-take-all for n input variables, hence winner-take-all provides a substantially more powerful computational unit than a perceptron (at about the same cost of implementation in analog VLSI). Complete proofs and further details to these results can be found in [Maass, 2000]. 294

I&C Journal 1999 Journal Article

On Computation with Pulses

  • Wolfgang Maass
  • Berthold Ruf

We explore the computational power of formal models for computation with pulses. Such models are motivated by realistic models for biological neurons and by related new types of VLSI (“pulse stream VLSI”). In preceding work it was shown that the computational power of formal models for computation with pulses is quite high if the pulses arriving at a computational unit have an approximately linearly rising or linearly decreasing initial segment. This property is satisfied by common models for biological neurons. On the other hand, several implementations of pulse stream VLSI employ pulses that are approximately piecewise constant (i. e. , step functions). In this article we investigate the relevance of the shape of pulses in formal models for computation with pulses. The results show that the computational power drops significantly if one replaces pulses with linearly rising or decreasing initial segments by piecewise constant pulses. We provide an exact characterization of the latter model in terms of a weak version of a random access machine (RAM). We also compare the language recognition capability of a recurrent version of this model with that of deterministic finite automata and Turing machines.

I&C Journal 1999 Journal Article

On the Complexity of Learning for Spiking Neurons with Temporal Coding

  • Wolfgang Maass
  • Michael Schmitt

Spiking neurons are models for the computational units in biological neural systems where information is considered to be encoded mainly in the temporal patterns of their activity. In a network of spiking neurons a new set of parameters becomes relevant which has no counterpart in traditional neural network models: the time that a pulse needs to travel through a connection between two neurons (also known as delay of a connection). It is known that these delays are tuned in biological neural systems through a variety of mechanisms. In this article we consider the arguably most simple model for a spiking neuron, which can also easily be implemented in pulsed VLSI. We investigate the Vapnik–Chervonenkis (VC) dimension of networks of spiking neurons, where the delays are viewed as programmable parameters and we prove tight bounds for this VC dimension. Thus, we get quantitative estimates for the diversity of functions that a network with fixed architecture can compute with different settings of its delays. In particular, it turns out that a network of spiking neurons with k adjustable delays is able to compute a much richer class of functions than a threshold circuit with k adjustable weights. The results also yield bounds for the number of training examples that an algorithm needs for tuning the delays of a network of spiking neurons. Results about the computational complexity of such algorithms are also given.

NeurIPS Conference 1998 Conference Paper

A Precise Characterization of the Class of Languages Recognized by Neural Nets under Gaussian and Other Common Noise Distributions

  • Wolfgang Maass
  • Eduardo Sontag

We consider recurrent analog neural nets where each gate is subject to Gaussian noise, or any other common noise distribution whose probabil(cid: 173) ity density function is nonzero on a large set. We show that many regular languages cannot be recognized by networks of this type, for example the language {w E {O, I} * I w begins with O}, and we give a precise characterization of those languages which can be recognized. This result implies severe constraints on possibilities for constructing recurrent ana(cid: 173) log neural nets that are robust against realistic types of analog noise. On the other hand we present a method for constructing feed forward analog neural nets that are robust with regard to analog noise of this type.

I&C Journal 1998 Journal Article

Efficient Learning with Virtual Threshold Gates

  • Wolfgang Maass
  • Manfred K Warmuth

We reduce learning simple geometric concept classes to learning disjunctions over exponentially many variables. We then apply an online algorithm called Winnow whose number of prediction mistakes grows only logarithmically with the number of variables. The hypotheses of Winnow are linear threshold functions with one weight per variable. We find ways to keep the exponentially many weights of Winnow implicitly so that the time for the algorithm to compute a prediction and update its “virtual” weights is polynomial. Our method can be used to learnd-dimensional axis-parallel boxes whendis variable and unions ofd-dimensional axis-parallel boxes whendis constant. The worst-case number of mistakes of our algorithms for the above classes is optimal to within a constant factor, and our algorithms inherit the noise robustness of Winnow. We think that other online algorithms with multiplicative weight updates whose loss bounds grow logarithmically with the dimension are amenable to our methods.

NeurIPS Conference 1997 Conference Paper

Dynamic Stochastic Synapses as Computational Units

  • Wolfgang Maass
  • Anthony Zador

In most neural network models, synapses are treated as static weights that change only on the slow time scales of learning. In fact, however, synapses are highly dynamic, and show use-dependent plasticity over a wide range of time scales. Moreover, synaptic transmission is an inherently stochastic process: a spike arriving at a presynaptic terminal triggers release of a vesicle of neurotransmitter from a release site with a probability that can be much less than one. Changes in release probability represent one of the main mechanisms by which synaptic efficacy is modulated in neural circuits. We propose and investigate a simple model for dynamic stochastic synapses that can easily be integrated into common models for neural computation. We show through computer simulations and rigorous theoretical analysis that this model for a dynamic stochastic synapse increases computational power in a nontrivial way. Our results may have implications for the process(cid: 173) ing of time-varying signals by both biological and artificial neural networks. A synapse 8 carries out computations on spike trains, more precisely on trains of spikes from the presynaptic neuron. Each spike from the presynaptic neuron mayor may not trigger the release of a neurotransmitter-filled vesicle at the synapse. The probability of a vesicle release ranges from about 0. 01 to almost 1. Furthermore this release probability is known to be strongly "history dependent" [Dobrunz and Stevens, 1997]. A spike causes an excitatory or inhibitory potential (EPSP or IPSP, respectively) in the postsynaptic neuron only when a vesicle is released. A spike train is represented as a sequence 1 of firing times, i. e. as increasing sequences of numbers tl < t2 <. .. from R+: = {z E R: z ~ O}. For each spike train 1 the output of synapse 8 consists of the sequence 8W of those ti E 10n which vesicles are "released" by 8, i. e. of those t, E 1 which cause an excitatory or inhibitory postsynaptic potential (EPSP or IPSP, respectively). The map 1 -+ 8(1) may be viewed as a stochastic function that is computed by synapse S. Alternatively one can characterize the output SW of a synapse 8 through its release pattern q = qlq2. .. E {R, F}·, where R stands for release and F for failure of release. For each t, E 1 one sets q, = R if ti E 8(1), and qi = F if ti ¢ 8W. Dynamic Stochastic Synapses as Computational Units 195

NeurIPS Conference 1996 Conference Paper

Noisy Spiking Neurons with Temporal Coding have more Computational Power than Sigmoidal Neurons

  • Wolfgang Maass

We exhibit a novel way of simulating sigmoidal neural nets by net(cid: 173) works of noisy spiking neurons in temporal coding. Furthermore it is shown that networks of noisy spiking neurons with temporal coding have a strictly larger computational power than sigmoidal neural nets with the same number of units. 1 Introduction and Definitions We consider a formal model SNN for a §piking neuron network that is basically a reformulation of the spike response model (and of the leaky integrate and fire model) without using 6-functions (see [Maass, 1996a] or [Maass, 1996b] for further backgrou nd). An SNN consists of a finite set V of spiking neurons, a set E ~ V x V of synapses, a weight wu, v 2: 0 and a response function cu, v: R+ --+ R for each synapse {u, v} E E (where R+: = {x E R: x 2: O}), and a threshold function 8 v: R+ --+ R+ for each neuron v E V. If Fu ~ R+ is the set of firing times of a neuron u, then the potential at the trigger zone of neuron v at time t is given by

NeurIPS Conference 1996 Conference Paper

On the Effect of Analog Noise in Discrete-Time Analog Computations

  • Wolfgang Maass
  • Pekka Orponen

We introduce a model for noise-robust analog computations with discrete time that is flexible enough to cover the most important concrete cases, such as computations in noisy analog neural nets and networks of noisy spiking neurons. We show that the presence of arbitrarily small amounts of analog noise reduces the power of analog computational models to that of finite automata, and we also prove a new type of upper bound for the VC-dimension of computational models with analog noise.

NeurIPS Conference 1995 Conference Paper

On the Computational Power of Noisy Spiking Neurons

  • Wolfgang Maass

It has remained unknown whether one can in principle carry out reliable digital computations with networks of biologically realistic models for neurons. This article presents rigorous constructions for simulating in real-time arbitrary given boolean circuits and fi(cid: 173) nite automata with arbitrarily high reliability by networks of noisy spiking neurons. In addition we show that with the help of "shunting inhibition" even networks of very unreliable spiking neurons can simulate in real-time any McCulloch-Pitts neuron (or "threshold gate"), and therefore any multilayer perceptron (or "threshold circuit") in a reliable manner. These constructions provide a possible explana(cid: 173) tion for the fact that biological neural systems can carry out quite complex computations within 100 msec. It turns out that the assumption that these constructions require about the shape of the EPSP's and the behaviour of the noise are surprisingly weak.

NeurIPS Conference 1994 Conference Paper

On the Computational Complexity of Networks of Spiking Neurons

  • Wolfgang Maass

We investigate the computational power of a formal model for net(cid: 173) works of spiking neurons, both for the assumption of an unlimited timing precision, and for the case of a limited timing precision. We also prove upper and lower bounds for the number of examples that are needed to train such networks. 1 Introduction and Basic Definitions There exists substantial evidence that timing phenomena such as temporal differ(cid: 173) ences between spikes and frequencies of oscillating subsystems are integral parts of various information processing mechanisms in biological neural systems (for a survey and references see e. g. Abeles, 1991; Churchland and Sejnowski, 1992; Aert(cid: 173) sen, 1993). Furthermore simulations of a variety of specific mathematical models for networks of spiking neurons have shown that temporal coding offers interesting possibilities for solving classical benchmark-problems such as associative memory, binding, and pattern segmentation (for an overview see Gerstner et al. , 1992). Some aspects of these models have also been studied analytically, but almost nothing is known about their computational complexity (see Judd and Aihara, 1993, for some first results in this direction). In this article we introduce a simple formal model SNN for networks of spiking neurons that allows us to model the most important timing phenomena of neural nets (including synaptic modulation), and we prove up(cid: 173) per and lower bounds for its computational power and learning complexity. Further 184

NeurIPS Conference 1993 Conference Paper

Agnostic PAC-Learning of Functions on Analog Neural Nets

  • Wolfgang Maass

There exist a number of negative results ([J), [BR), [KV]) about learning on neural nets in Valiant's model [V) for probably approx(cid: 173) imately correct learning ("PAC-learning"). These negative results are based on an asymptotic analysis where one lets the number of nodes in the neural net go to infinit. y. Hence this analysis is less ad(cid: 173) equate for the investigation of learning on a small fixed neural net. with relatively few analog inputs (e. g. the principal components of some sensory data). The latter type of learning problem gives rise to a different kind of asymptotic question: Can the true error of the neural net be brought arbitrarily close to that of a neural net with "optimal" weights through sufficiently long training? In this paper we employ some new arguments ill order to give a positive answer to this question in Haussler's rather realistic refinement of Valiant's model for PAC-learning ([H), [KSS)). In this more realistic model no a-priori assumptions are required about the "learning target", noise is permitted in the training data, and the inputs and outputs are not restricted to boolean values. As a special case our result implies one of the first positive results about learning on multi-layer neural net. s in Valiant's original PAC-learning model. At the end of this paper we will describe an efficient parallel implementation of this new learning algorit. hm.

TCS Journal 1993 Journal Article

The complexity of matrix transposition on one-tape off-line Turing machines with output tape

  • Martin Dietzfelbinger
  • Wolfgang Maass

A series of existing lower bound results for deterministic one-tape Turing machines is extended to another, stronger such model suitable for the computation of functions: one-tape off-line Turing machines with a write-only output tape. (“Off-line” means: having a two-way input tape.) The following optimal lower bound is shown: Computing the transpose of Boolean l × l-matrices takes Ω(l 5 2 )=Ω(n 5 4 ) steps on such Turing machines. (n=l 2 is the length of the input.)

TCS Journal 1991 Journal Article

The complexity of matrix transposition on one-tape off-line Turing machines

  • Martin Dietzfelbinger
  • Wolfgang Maass
  • Georg Schnitger

This paper contains the first concrete lower bound argument for Turing machines with one worktape and a two-way input tape (“one-tape off-line Turing machines”): an optimal lower bound of Ω(n·l/⌈( log(l) p ) 1 2 ⌉) for transposing an I × l-matrix with elements of bit length p on such machines is proved. (The length of the input is denoted by n.) A special case is a lower bound of Ω( n 3 2 (log n) 1 2 ) for transposing Boolean l × l-matrices (n = l 2) on such Turing machines. The proof of the matching upper bound (which is nontrivial for p<logl) uses the fact that one-tape off-line Turing machines can copy strings slightly faster than if the straightforward method is used. As a corollary of the lower bound it is shown that sorting n (3 log n) strings of 3 log n bits each takes Ω( n 3 2 (log n) 1 2 )steps on one-tape off-line Turing machines. Further corollaries give the first non-linear lower bound for the version of the two-tapes-versus-one problem concerning one-tape off-line Turing machines, and separate one-tape off-line Turing machines from those Turing machines with one input tape, one worktape, and an additional write-only output tape.

NeurIPS Conference 1990 Conference Paper

A Method for the Efficient Design of Boltzmann Machines for Classiffication Problems

  • Ajay Gupta
  • Wolfgang Maass

We introduce a method for the efficient design of a Boltzmann machine (or a Hopfield net) that computes an arbitrary given Boolean function f. This method is based on an efficient simulation of acyclic circuits with threshold gates by Boltzmann machines. As a consequence we can show that various concrete Boolean functions f that are relevant for classification problems can be computed by scalable Boltzmann machines that are guaranteed to converge to their global maximum configuration with high probability after constantly many steps.

TCS Journal 1983 Journal Article

Oracle-dependent properties of the lattice of NP sets

  • Steven Homer
  • Wolfgang Maass

We consider under the assumption P ≠ NP questions concerning the structure of the lattice of NP sets together with the sublattice P. We show that two questions which are slightly more complex than the known splitting properties of this lattice cannot be settled by arguments which relativize. The two questions which we consider are whether every infinite NP set contains an infinite P subset and whether there exists an NP-simple set. We construct several oracles, all of which make P ≠ NP, and which in addition make the above-mentioned statements either true or false. In particular we give a positive answer to the question, raised by Bennett and Gill (1981), whether an oracle B exists making P B ≠ NP B and such that every infinite set in NP B has an infinite subset in P B. The constructions of the oracles are finite injury priority arguments.

v2026.09.13