Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

L. F. Abbott

dblp:01/6917 · also Larry Abbott · DBLP profile ↗
← Back
34ranked-venue papers
5as first author
5since 2021 · last 2024
0000-0003-1163-5688ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 25 · 5 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 9 · 4 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Deep learning architectures and training · 42% Reinforcement learning · 40% Representation and self-supervised learning · 18%
Interdisciplinary, comprehensive, and emerging computing
4 papers
Bioinformatics and computational biology · 98% Computational science and engineering · 2%

Topics — the 13 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
biologically plausible learning
0.512021
Credit Assignment Through Broadcasting a Global Error Vector · NeurIPS 2021
Machine learning › Reinforcement learning › multi-agent reinforcement learning
credit assignment
0.512021
Credit Assignment Through Broadcasting a Global Error Vector · NeurIPS 2021
Bioinformatics and computational biology
computational neuroscience
0.132010
Inferring Stimulus Selectivity from the Spatial Structure of Neural Network Dynamics · NIPS 2010
Recurrent Cortical Amplification Produces Complex Cell Responses · NIPS 1998
Order Reduction for Dynamical Systems Describing the Behavior of Complex Neurons · NIPS 1990
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.112010
Inferring Stimulus Selectivity from the Spatial Structure of Neural Network Dynamics · NIPS 2010
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
subspace learning
0.112010
Inferring Stimulus Selectivity from the Spatial Structure of Neural Network Dynamics · NIPS 2010
Bioinformatics and computational biology › computational neuroscience
neural population dynamics
0.112010
Inferring Stimulus Selectivity from the Spatial Structure of Neural Network Dynamics · NIPS 2010
Machine learning › Deep learning architectures and training › biologically plausible learning
synaptic plasticity
0.011998
Temporally Asymmetric Hebbian Learning, Spike liming and Neural Response Variability · NIPS 1998
Bioinformatics and computational biology › computational neuroscience
cortical computation
0.011998
Recurrent Cortical Amplification Produces Complex Cell Responses · NIPS 1998
Computational science and engineering › numerical analysis
model reduction
0.011990
Order Reduction for Dynamical Systems Describing the Behavior of Complex Neurons · NIPS 1990
Bioinformatics and computational biology › computational neuroscience
neuron model
0.011990
Order Reduction for Dynamical Systems Describing the Behavior of Complex Neurons · NIPS 1990
Machine learning › Deep learning architectures and training
spiking neural network
0.011998
Temporally Asymmetric Hebbian Learning, Spike liming and Neural Response Variability · NIPS 1998
Mathematical optimization
dynamical systems
0.011990
Order Reduction for Dynamical Systems Describing the Behavior of Complex Neurons · NIPS 1990
Mathematical optimization › numerical analysis
model reduction
0.011990
Order Reduction for Dynamical Systems Describing the Behavior of Complex Neurons · NIPS 1990

Methods — techniques the papers use, named apart from their topics

vectorized nonnegative networks · 0.5global error-vector broadcasting · 0.5subspace angle analysis · 0.2principal component analysis · 0.2spike timing · 0.0recurrent cortical amplification modeling · 0.0hebbian learning · 0.0hybrid circuit · 0.0biological neuron culture · 0.0order reduction · 0.0dynamical systems · 0.0
YearPublicationVenuePosition
2024 Emergent neural dynamics and geometry for generalization in a transitive inference task
abstract
Relational cognition-the ability to infer relationships that generalize to novel combinations of objects-is fundamental to human and animal intelligence. Despite this importance, it remains unclear how relational cognition is implemented in the brain due in part to a lack of hypotheses and predictions at the levels of collective neural activity and behavior. Here we discovered, analyzed, and experimentally tested neural networks (NNs) that perform transitive inference (TI), a classic relational task (if A > B and B > C, then A > C). We found NNs that (i) generalized perfectly, despite lacking overt transitive structure prior to training, (ii) generalized when the task required working memory (WM), a capacity thought to be essential to inference in the brain, (iii) emergently expressed behaviors long observed in living subjects, in addition to a novel order-dependent behavior, and (iv) expressed different task solutions yielding alternative behavioral and neural predictions. Further, in a large-scale experiment, we found that human subjects performing WM-based TI showed behavior inconsistent with a class of NNs that characteristically expressed an intuitive task solution. These findings provide neural insights into a classical relational ability, with wider implications for how the brain realizes relational cognition.
Kenneth Kay, Natalie Biderman, Ramin Khajeh, Manuel Beiran, Christopher J. Cueva, Daphna Shohamy, Greg Jensen, Xue-Xin Wei, Vincent P. Ferrera, L. F. Abbott
PLoS Comput. Biol.10
2022 Input correlations impede suppression of chaos and learning in balanced firing-rate networks
abstract
Neural circuits exhibit complex activity patterns, both spontaneously and evoked by external stimuli. Information encoding and learning in neural circuits depend on how well time-varying stimuli can control spontaneous network activity. We show that in firing-rate networks in the balanced state, external control of recurrent dynamics, i.e., the suppression of internally-generated chaotic variability, strongly depends on correlations in the input. A distinctive feature of balanced networks is that, because common external input is dynamically canceled by recurrent feedback, it is far more difficult to suppress chaos with common input into each neuron than through independent input. To study this phenomenon, we develop a non-stationary dynamic mean-field theory for driven networks. The theory explains how the activity statistics and the largest Lyapunov exponent depend on the frequency and amplitude of the input, recurrent coupling strength, and network size, for both common and independent input. We further show that uncorrelated inputs facilitate learning in balanced networks.
Rainer Engelken, Alessandro Ingrosso, Ramin Khajeh, Sven Goedeke, L. F. Abbott
PLoS Comput. Biol.5
2022 Sparse balance: Excitatory-inhibitory networks with small bias currents and broadly distributed synaptic weights
abstract
Cortical circuits generate excitatory currents that must be cancelled by strong inhibition to assure stability. The resulting excitatory-inhibitory (E-I) balance can generate spontaneous irregular activity but, in standard balanced E-I models, this requires that an extremely strong feedforward bias current be included along with the recurrent excitation and inhibition. The absence of experimental evidence for such large bias currents inspired us to examine an alternative regime that exhibits asynchronous activity without requiring unrealistically large feedforward input. In these networks, irregular spontaneous activity is supported by a continually changing sparse set of neurons. To support this activity, synaptic strengths must be drawn from high-variance distributions. Unlike standard balanced networks, these sparse balance networks exhibit robust nonlinear responses to uniform inputs and non-Gaussian input statistics. Interestingly, the speed, not the size, of synaptic fluctuations dictates the degree of sparsity in the model. In addition to simulations, we provide a mean-field analysis to illustrate the properties of these networks.
Ramin Khajeh, Francesco Fumarola, L. F. Abbott
PLoS Comput. Biol.3
2022 Sparse RNNs can support high-capacity classification
abstract
Feedforward network models performing classification tasks rely on highly convergent output units that collect the information passed on by preceding layers. Although convergent output-unit like neurons may exist in some biological neural circuits, notably the cerebellar cortex, neocortical circuits do not exhibit any obvious candidates for this role; instead they are highly recurrent. We investigate whether a sparsely connected recurrent neural network (RNN) can perform classification in a distributed manner without ever bringing all of the relevant information to a single convergence site. Our model is based on a sparse RNN that performs classification dynamically. Specifically, the interconnections of the RNN are trained to resonantly amplify the magnitude of responses to some external inputs but not others. The amplified and non-amplified responses then form the basis for binary classification. Furthermore, the network acts as an evidence accumulator and maintains its decision even after the input is turned off. Despite highly sparse connectivity, learned recurrent connections allow input information to flow to every neuron of the RNN, providing the basis for distributed computation. In this arrangement, the minimum number of synapses per neuron required to reach maximum memory capacity scales only logarithmically with network size. The model is robust to various types of noise, works with different activation and loss functions and with both backpropagation- and Hebbian-based learning rules. The RNN can also be constructed with a split excitation-inhibition architecture with little reduction in performance.
Denis Turcu, L. F. Abbott
PLoS Comput. Biol.2
2021 Credit Assignment Through Broadcasting a Global Error Vector
abstract
Backpropagation (BP) uses detailed, unit-specific feedback to train deep neural networks (DNNs) with remarkable success. That biological neural circuits appear to perform credit assignment, but cannot implement BP, implies the existence of other powerful learning algorithms. Here, we explore the extent to which a globally broadcast learning signal, coupled with local weight updates, enables training of DNNs. We present both a learning rule, called global error-vector broadcasting (GEVB), and a class of DNNs, called vectorized nonnegative networks (VNNs), in which this learning rule operates. VNNs have vector-valued units and nonnegative weights past the first layer. The GEVB learning rule generalizes three-factor Hebbian learning, updating each weight by an amount proportional to the inner product of the presynaptic activation and a globally broadcast error vector when the postsynaptic unit is active. We prove that these weight updates are matched in sign to the gradient, enabling accurate credit assignment. Moreover, at initialization, these updates are exactly proportional to the gradient in the limit of infinite network width. GEVB matches the performance of BP in VNNs, and in some cases outperforms direct feedback alignment (DFA) applied in conventional networks. Unlike DFA, GEVB successfully trains convolutional layers. Altogether, our theoretical and empirical results point to a surprisingly powerful role for a global learning signal in training DNNs.
David G. Clark, L. F. Abbott, SueYeon Chung
NeurIPS2
2016 Stability and Competition in Multi-spike Models of Spike-Timing Dependent Plasticity
abstract
Spike-timing dependent plasticity (STDP) is a widespread plasticity mechanism in the nervous system. The simplest description of STDP only takes into account pairs of pre- and postsynaptic spikes, with potentiation of the synapse when a presynaptic spike precedes a postsynaptic spike and depression otherwise. In light of experiments that explored a variety of spike patterns, the pair-based STDP model has been augmented to account for multiple pre- and postsynaptic spike interactions. As a result, a number of different "multi-spike" STDP models have been proposed based on different experimental observations. The behavior of these models at the population level is crucial for understanding mechanisms of learning and memory. The challenging balance between the stability of a population of synapses and their competitive modification is well studied for pair-based models, but it has not yet been fully analyzed for multi-spike models. Here, we address this issue through numerical simulations of an integrate-and-fire model neuron with excitatory synapses subject to STDP described by three different proposed multi-spike models. We also analytically calculate average synaptic changes and fluctuations about these averages. Our results indicate that the different multi-spike models behave quite differently at the population level. Although each model can produce synaptic competition in certain parameter regions, none of them induces synaptic competition with its originally fitted parameters. The dichotomy between synaptic stability and Hebbian competition, which is well characterized for pair-based STDP models, persists in multi-spike models. However, anti-Hebbian competition can coexist with synaptic stability in some models. We propose that the collective behavior of synaptic plasticity models at the population level should be used as an additional guideline in applying phenomenological models based on observations of single synapses.
Baktash Babadi, L. F. Abbott
PLoS Comput. Biol.2
2016 Tuning Curves for Arm Posture Control in Motor Cortex Are Consistent with Random Connectivity
abstract
Neuronal responses characterized by regular tuning curves are typically assumed to arise from structured synaptic connectivity. However, many responses exhibit both regular and irregular components. To address the relationship between tuning curve properties and underlying circuitry, we analyzed neuronal activity recorded from primary motor cortex (M1) of monkeys performing a 3D arm posture control task and compared the results with a neural network model. Posture control is well suited for examining M1 neuronal tuning because it avoids the dynamic complexity of time-varying movements. As a function of hand position, the neuronal responses have a linear component, as has previously been described, as well as heterogeneous and highly irregular nonlinearities. These nonlinear components involve high spatial frequencies and therefore do not support explicit encoding of movement parameters. Yet both the linear and nonlinear components contribute to the decoding of EMG of major muscles used in the task. Remarkably, despite the presence of a strong linear component, a feedforward neural network model with entirely random connectivity can replicate the data, including both the mean and distributions of the linear and nonlinear components as well as several other features of the neuronal responses. This result shows that smoothness provided by the regularity in the inputs to M1 can impose apparent structure on neural responses, in this case a strong linear (also known as cosine) tuning component, even in the absence of ordered synaptic connectivity.
Hagai Lalazar, L. F. Abbott, Eilon Vaadia
PLoS Comput. Biol.2
2014 Hierarchical Control Using Networks Trained with Higher-Level Forward Models
abstract
We propose and develop a hierarchical approach to network control of complex tasks. In this approach, a low-level controller directs the activity of a "plant," the system that performs the task. However, the low-level controller may be able to solve only fairly simple problems involving the plant. To accomplish more complex tasks, we introduce a higher-level controller that controls the lower-level controller. We use this system to direct an articulated truck to a specified location through an environment filled with static or moving obstacles. The final system consists of networks that have memorized associations between the sensory data they receive and the commands they issue. These networks are trained on a set of optimal associations generated by minimizing cost functions. Cost function minimization requires predicting the consequences of sequences of commands, which is achieved by constructing forward models, including a model of the lower-level controller. The forward models and cost minimization are used only during training, allowing the trained networks to respond rapidly. In general, the hierarchical approach can be extended to larger numbers of levels, dividing complex tasks into more manageable subtasks. The optimization procedure and the construction of the forward models and controllers can be performed in similar ways at each level of the hierarchy, which allows the system to be modified to perform other tasks or to be extended for more complex tasks without retraining lower-levels.
Greg Wayne, L. F. Abbott
Neural Comput.2
2013 Pairwise Analysis Can Account for Network Structures Arising from Spike-Timing Dependent Plasticity
abstract
Spike timing-dependent plasticity (STDP) modifies synaptic strengths based on timing information available locally at each synapse. Despite this, it induces global structures within a recurrently connected network. We study such structures both through simulations and by analyzing the effects of STDP on pair-wise interactions of neurons. We show how conventional STDP acts as a loop-eliminating mechanism and organizes neurons into in- and out-hubs. Loop-elimination increases when depression dominates and turns into loop-generation when potentiation dominates. STDP with a shifted temporal window such that coincident spikes cause depression enhances recurrent connections and functions as a strict buffering mechanism that maintains a roughly constant average firing rate. STDP with the opposite temporal shift functions as a loop eliminator at low rates and as a potent loop generator at higher rates. In general, studying pairwise interactions of neurons provides important insights about the structures that STDP can produce in large networks.
Baktash Babadi, L. F. Abbott
PLoS Comput. Biol.2
2013 A Complex-Valued Firing-Rate Model That Approximates the Dynamics of Spiking Networks
abstract
Firing-rate models provide an attractive approach for studying large neural networks because they can be simulated rapidly and are amenable to mathematical analysis. Traditional firing-rate models assume a simple form in which the dynamics are governed by a single time constant. These models fail to replicate certain dynamic features of populations of spiking neurons, especially those involving synchronization. We present a complex-valued firing-rate model derived from an eigenfunction expansion of the Fokker-Planck equation and apply it to the linear, quadratic and exponential integrate-and-fire models. Despite being almost as simple as a traditional firing-rate description, this model can reproduce firing-rate dynamics due to partial synchronization of the action potentials in a spiking model, and it successfully predicts the transition to spike synchronization in networks of coupled excitatory and inhibitory neurons.
Evan S. Schaffer, Srdjan Ostojic, L. F. Abbott
PLoS Comput. Biol.3
2010 Inferring Stimulus Selectivity from the Spatial Structure of Neural Network Dynamics
abstract
How are the spatial patterns of spontaneous and evoked population responses related? We study the impact of connectivity on the spatial pattern of fluctuations in the input-generated response of a neural network, by comparing the distribution of evoked and intrinsically generated activity across the different units. We develop a complementary approach to principal component analysis in which separate high-variance directions are typically derived for each input condition. We analyze subspace angles to compute the difference between the shapes of trajectories corresponding to different network states, and the orientation of the low-dimensional subspaces that driven trajectories occupy within the full space of neuronal activity. In addition to revealing how the spatiotemporal structure of spontaneous activity affects input-evoked responses, these methods can be used to infer input selectivity induced by network dynamics from experimentally accessible measures of spontaneous activity (e.g. from voltage- or calcium-sensitive optical imaging experiments). We conclude that the absence of a detailed spatial map of afferent inputs and cortical connectivity does not limit our ability to design spatially extended stimuli that evoke strong responses.
Kanaka Rajan, L. F. Abbott, Haim Sompolinsky
NIPS2
2010 Intrinsic Stability of Temporally Shifted Spike-Timing Dependent Plasticity
abstract
Spike-timing dependent plasticity (STDP), a widespread synaptic modification mechanism, is sensitive to correlations between presynaptic spike trains and it generates competition among synapses. However, STDP has an inherent instability because strong synapses are more likely to be strengthened than weak ones, causing them to grow in strength until some biophysical limit is reached. Through simulations and analytic calculations, we show that a small temporal shift in the STDP window that causes synchronous, or nearly synchronous, pre- and postsynaptic action potentials to induce long-term depression can stabilize synaptic strengths. Shifted STDP also stabilizes the postsynaptic firing rate and can implement both Hebbian and anti-Hebbian forms of competitive synaptic plasticity. Interestingly, the overall level of inhibition determines whether plasticity is Hebbian or anti-Hebbian. Even a random symmetric jitter of a few milliseconds in the STDP window can stabilize synaptic strengths while retaining these features. The same results hold for a shifted version of the more recent "triplet" model of STDP. Our results indicate that the detailed shape of the STDP window function near the transition from depression to potentiation is of the utmost importance in determining the consequences of STDP, suggesting that this region warrants further experimental study.
Baktash Babadi, L. F. Abbott
PLoS Comput. Biol.2
2005 Supervised Learning Through Neuronal Response Modulation
abstract
Neural networks that are trained to perform specific tasks must be developed through a supervised learning procedure. This normally takes the form of direct supervision of synaptic plasticity. We explore the idea that supervision takes place instead through the modulation of neuronal excitability. Such supervision can be done using conventional synaptic feedback pathways rather than requiring the hypothetical actions of unknown modulatory agents. During task learning, supervised response modulation guides Hebbian synaptic plasticity indirectly by establishing appropriate patterns of correlated network activity. This results in robust learning of function approximation tasks evenwhenmultiple output units representing different functions share large amounts of common input. Reward-based supervision is also studied, and a number of potential advantages of neuronal response modulation are identified.
Christian D. Swinehart, L. F. Abbott
Neural Comput.2
2004 Synaptic equalization by anti-STDP
Clifton C. Rumsey, L. F. Abbott
Neurocomputing2
2004 Control of network activity through neuronal response modulation
Christian D. Swinehart, Kristofer E. Bouchard, Peretz Partensky, L. F. Abbott
Neurocomputing4
2002 Modeling temporal combination selective neurons of the songbird
Patrick J. Drew, L. F. Abbott
Neurocomputing2
2001 Input-specific adaptation in complex cells through synaptic depression
Frances S. Chance, L. F. Abbott
Neurocomputing2
2000 A recurrent network model for the phase invariance of complex cell responses
Frances S. Chance, Sacha B. Nelson, L. F. Abbott
Neurocomputing3
2000 Dependence of firing pattern on intrinsic ionic conductances: Sensitive and insensitive combinations
Mark S. Goldman, Jorge Golowasch, Eve Marder, L. F. Abbott
Neurocomputing4
2000 Temporally asymmetric Hebbian learning and neuronal response variability
Sen Song, L. F. Abbott
Neurocomputing2
2000 Gain modulation of recurrent networks
Jian Zhang 0004, L. F. Abbott
Neurocomputing2
2000 Do Simple Cells in Primary Visual Cortex Form a Tight Frame?
abstract
Sets of neuronal tuning curves, which describe the responses of neurons as functions of a stimulus, can serve as a basis for approximating other functions of stimulus parameters. In a function-approximating network, synaptic weights determined by a correlation-based Hebbian rule are closely related to the coefficients that result when a function is expanded in an orthogonal basis. Although neuronal tuning curves typically are not orthogonal functions, the relationship between function approximation and correlation-based synaptic weights can be retained if the tuning curves satisfy the conditions of a tight frame. We examine whether the spatial receptive fields of simple cells in cat and monkey primary visual cortex (V1) form a tight frame, allowing them to serve as a basis for constructing more complicated extrastriate receptive fields using correlation-based synaptic weights. Our calculations show that the set of V1 simple cell receptive fields is not tight enough to account for the acuity observed psychophysically.
Emilio Salinas, L. F. Abbott
Neural Comput.2
1999 Decorrelation of spike trains by synaptic depression
Mark S. Goldman, Sacha B. Nelson, L. F. Abbott
Neurocomputing3
1999 The Effect of Correlated Variability on the Accuracy of a Population Code
abstract
We study the impact of correlated neuronal firing rate variability on the accuracy with which an encoded quantity can be extracted from a population of neurons. Contrary to widespread belief, correlations in the variabilities of neuronal firing rates do not, in general, limit the increase in coding accuracy provided by using large populations of encoding neurons. Furthermore, in some cases, but not all, correlations improve the accuracy of a population code.
L. F. Abbott, Peter Dayan
Neural Comput.1
1999 Network Stability from Activity-Dependent Regulation of Neuronal Conductances
abstract
Activity-dependent plasticity appears to play an important role in the modification of neurons and neural circuits that occurs during development and learning. Plasticity is also essential for the maintenance of stable patterns of activity in the face of variable environmental and internal conditions. Previous theoretical and experimental results suggest that neurons stabilize their activity by altering the number or characteristics of ion channels to regulate their intrinsic electrical properties. We present both experimental and modeling evidence to show that activity-dependent regulation of conductances, operating at the level of individual neurons, can also stabilize network activity. These results indicate that the stomatogastric ganglion of the crab can generate a characteristic rhythmic pattern of activity in two fundamentally different modes of operation. In one mode, the rhythm is strictly conditional on the presence of neuromodulatory afferents from adjacent ganglia. In the other, it is independent of neuromodulatory input but relies on newly developed intrinsic properties of the component neurons.
Jorge Golowasch, Michael Casey, L. F. Abbott, Eve Marder
Neural Comput.3
1998 Temporally Asymmetric Hebbian Learning, Spike liming and Neural Response Variability
L. F. Abbott, Sen Song
NIPS1
1998 Recurrent Cortical Amplification Produces Complex Cell Responses
Frances S. Chance, Sacha B. Nelson, L. F. Abbott
NIPS3
1996 A model of spatial map formation in the hippocampus of the rat
abstract
Using experimental facts about long-term potentiation (LTP) and hippocampal place cells, we model how a spatial map of the environment can be created in the rat hippocampus. Sequential firing of place cells during exploration induces, in the model, a pattern of LTP between place cells that shifts the location coded by their ensemble activity away from the actual location of the animal. These shifts provide a navigational map that, in a simulation of the Morris maze, can guide the animal toward its goal. The model demonstrates how behaviorally generated modifications of synaptic strengths can be read out to affect subsequent behavior. Our results also suggest a way that navigational maps can be constructed from experimental recordings of hippocampal place cells.
K. I. Blum, L. F. Abbott
Neural Comput.2
1995 Reduced Representation by Neural Networks with Restricted Receptive Fields
abstract
Model neural networks can perform dimensional reductions of input data sets using correlation-based learning rules to adjust their weights. Simple Hebbian learning rules lead to an optimal reduction at the single unit level but result in highly redundant network representations. More complex rules designed to reduce or remove this redundancy can develop optimal principal component representations, but they are not very compelling from a biological perspective. Neurons in biological networks have restricted receptive fields limiting their access to the input data space. We find that, within this restricted receptive field architecture, simple correlation-based learning rules can produce surprisingly efficient reduced representations. When noise is present, the size of the receptive fields can be optimally tuned to maximize the accuracy of reconstructions of input data from a reduced representation.
Marco Idiart, Barry Berk, L. F. Abbott
Neural Comput.3
1993 Analysis of Neuron Models with Dynamically Regulated Conductances
abstract
We analyze neuron models in which the maximal conductances of membrane currents are slowly varying dynamic variables regulated by the intracellular calcium concentration. These models allow us to study possible activity-dependent effects arising from processes that maintain and modify membrane channels in real neurons. Regulated model neurons maintain a constant average level of activity over a wide range of conditions by appropriately adjusting their conductances. The intracellular calcium concentration acts as a feedback element linking maximal conductances to electrical activity. The resulting plasticity of intrinsic characteristics has important implications for network behavior. We first study a simple two-conductance model, then introduce techniques that allow us to analyze dynamic regulation with an arbitrary number of conductances, and finally illustrate this method by studying a seven-conductance model. We conclude with an analysis of spontaneous differentiation of identical model neurons in a two-cell network.
L. F. Abbott, Gwendal Le Masson
Neural Comput.1
1992 Hybrid Circuits of Interacting Computer Model and Biological Neurons
Sylvie Renaud, Gwendal Le Masson, Eve Marder, L. F. Abbott
NIPS4
1991 Oscillating Networks: Control of Burst Duration by Electrically Coupled Neurons
abstract
The pyloric network of the stomatogastric ganglion in crustacea is a central pattern generator that can produce the same basic rhythm over a wide frequency range. Three electrically coupled neurons, the anterior burster (AB) neuron and two pyloric dilator (PD) neurons, act as a pacemaker unit for the pyloric network. The functional characteristics of the pacemaker network are the result of electrical coupling between neurons with quite different intrinsic properties, each contributing a basic feature to the complete circuit. The AB neuron, a conditional oscillator, plays a dominant role in rhythm generation. In the work described here, we manipulate the frequency of the AB neuron both isolated and electrically coupled to the PD neurons. Physiological and modeling studies indicate that the PD neurons play an important role in regulating the duration of the bursts produced by the pacemaker unit.
L. F. Abbott, Eve Marder, Scott L. Hooper
Neural Comput.1
1990 Oscillating networks: modeling the pyloric circuit of the stomatogastric ganglion
abstract
A preliminary report is presented on modeling studies of the pyloric circuit of the crustacean stomatogastric ganglion. The goal of this research is to understand how this small network is able to perform the dynamic adjustments needed to maintain a stable rhythmic pattern over a wide range of frequencies and conditions. A discussion is presented of models of individual cell behaviors and the procedure by which they may be reduced to a manageable form. Some indications of how these intrinsic characteristics may interact to produce the full network behavior are presented
L. F. Abbott, Scott L. Hooper, Thomas B. Kepler, Eve Marder
IJCNN1
1990 Order Reduction for Dynamical Systems Describing the Behavior of Complex Neurons
Thomas B. Kepler, L. F. Abbott, Eve Marder
NIPS2