43,875 research outputs found
Event-Driven Contrastive Divergence for Spiking Neuromorphic Systems
Restricted Boltzmann Machines (RBMs) and Deep Belief Networks have been
demonstrated to perform efficiently in a variety of applications, such as
dimensionality reduction, feature learning, and classification. Their
implementation on neuromorphic hardware platforms emulating large-scale
networks of spiking neurons can have significant advantages from the
perspectives of scalability, power dissipation and real-time interfacing with
the environment. However the traditional RBM architecture and the commonly used
training algorithm known as Contrastive Divergence (CD) are based on discrete
updates and exact arithmetics which do not directly map onto a dynamical neural
substrate. Here, we present an event-driven variation of CD to train a RBM
constructed with Integrate & Fire (I&F) neurons, that is constrained by the
limitations of existing and near future neuromorphic hardware platforms. Our
strategy is based on neural sampling, which allows us to synthesize a spiking
neural network that samples from a target Boltzmann distribution. The recurrent
activity of the network replaces the discrete steps of the CD algorithm, while
Spike Time Dependent Plasticity (STDP) carries out the weight updates in an
online, asynchronous fashion. We demonstrate our approach by training an RBM
composed of leaky I&F neurons with STDP synapses to learn a generative model of
the MNIST hand-written digit dataset, and by testing it in recognition,
generation and cue integration tasks. Our results contribute to a machine
learning-driven approach for synthesizing networks of spiking neurons capable
of carrying out practical, high-level functionality.Comment: (Under review
Simulation of networks of spiking neurons: A review of tools and strategies
We review different aspects of the simulation of spiking neural networks. We
start by reviewing the different types of simulation strategies and algorithms
that are currently implemented. We next review the precision of those
simulation strategies, in particular in cases where plasticity depends on the
exact timing of the spikes. We overview different simulators and simulation
environments presently available (restricted to those freely available, open
source and documented). For each simulation tool, its advantages and pitfalls
are reviewed, with an aim to allow the reader to identify which simulator is
appropriate for a given task. Finally, we provide a series of benchmark
simulations of different types of networks of spiking neurons, including
Hodgkin-Huxley type, integrate-and-fire models, interacting with current-based
or conductance-based synapses, using clock-driven or event-driven integration
strategies. The same set of models are implemented on the different simulators,
and the codes are made available. The ultimate goal of this review is to
provide a resource to facilitate identifying the appropriate integration
strategy and simulation tool to use for a given modeling problem related to
spiking neural networks.Comment: 49 pages, 24 figures, 1 table; review article, Journal of
Computational Neuroscience, in press (2007
Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks
Stochastic simulations are one of the cornerstones of the analysis of
dynamical processes on complex networks, and are often the only accessible way
to explore their behavior. The development of fast algorithms is paramount to
allow large-scale simulations. The Gillespie algorithm can be used for fast
simulation of stochastic processes, and variants of it have been applied to
simulate dynamical processes on static networks. However, its adaptation to
temporal networks remains non-trivial. We here present a temporal Gillespie
algorithm that solves this problem. Our method is applicable to general Poisson
(constant-rate) processes on temporal networks, stochastically exact, and up to
multiple orders of magnitude faster than traditional simulation schemes based
on rejection sampling. We also show how it can be extended to simulate
non-Markovian processes. The algorithm is easily applicable in practice, and as
an illustration we detail how to simulate both Poissonian and non-Markovian
models of epidemic spreading. Namely, we provide pseudocode and its
implementation in C++ for simulating the paradigmatic
Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and
a Susceptible-Infected-Recovered model with non-constant recovery rates. For
empirical networks, the temporal Gillespie algorithm is here typically from 10
to 100 times faster than rejection sampling.Comment: Minor changes and updates to reference
Learning and Forecasting Opinion Dynamics in Social Networks
Social media and social networking sites have become a global pinboard for
exposition and discussion of news, topics, and ideas, where social media users
often update their opinions about a particular topic by learning from the
opinions shared by their friends. In this context, can we learn a data-driven
model of opinion dynamics that is able to accurately forecast opinions from
users? In this paper, we introduce SLANT, a probabilistic modeling framework of
opinion dynamics, which represents users opinions over time by means of marked
jump diffusion stochastic differential equations, and allows for efficient
model simulation and parameter estimation from historical fine grained event
data. We then leverage our framework to derive a set of efficient predictive
formulas for opinion forecasting and identify conditions under which opinions
converge to a steady state. Experiments on data gathered from Twitter show that
our model provides a good fit to the data and our formulas achieve more
accurate forecasting than alternatives
- …