Searcharxiv⌕ Search

arXiv · cond-mat/0110070

The spike-timing-dependent learning rule to encode spatiotemporal patterns in a network of spiking neurons

Abstract

We study associative memory neural networks based on the Hodgkin-Huxley type of spiking neurons. We introduce the spike-timing-dependent learning rule, in which the time window with the negative part as well as the positive part is used to describe the biologically plausible synaptic plasticity. The learning rule is applied to encode a number of periodical spatiotemporal patterns, which are successfully reproduced in the periodical firing pattern of spiking neurons in the process of memory retrieval. The global inhibition is incorporated into the model so as to induce the gamma oscillation. The occurrence of gamma oscillation turns out to give appropriate spike timings for memory retrieval of discrete type of spatiotemporal pattern. The theoretical analysis to elucidate the stationary properties of perfect retrieval state is conducted in the limit of an infinite number of neurons and shows the good agreement with the result of numerical simulations. The result of this analysis indicates that the presence of the negative and positive parts in the form of the time window contributes to reduce the size of crosstalk term, implying that the time window with the negative and positive parts is suitable to encode a number of spatiotemporal patterns. We draw some phase diagrams, in which we find various types of phase transitions with change of the intensity of global inhibition.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Masahiko Yoshioka. 2001-10-03. The spike-timing-dependent learning rule to encode spatiotemporal patterns in a network of spiking neurons. https://doi.org/10.1103/physreve.65.011903. https://searcharxiv.com/abs/cond-mat/0110070

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Motif enrichment as a driver of scale-free behavior in rewired random regular graphs

We study the statistics of rewired random regular graphs (RRGs) in a mixed ensemble, where the average number of triangles is controlled by the fugacity $λ$, while the number of vertices and the vertex degree are fixed. This model exhibits a phase transition at critical fugacity $λ_{cr}$ from a triangle-poor phase (TPP), in which the number of triangles is independent of the system size, to a triangle-rich phase (TRP), in which the number of triangles scales linearly with the system size. We estimate $λ_{cr}$ by comparing the entropy of TPP with the energy of TRP. Above $λ_{cr}$, the RRG becomes a two-phase system in which dense clusters are connected by a sparse scale-free sub-network characterized by a degree distribution, $P(d) \sim d^{-γ}$, with $γ\approx 2$, independent of the size of the whole graph and its degree. We attribute this behavior to an "emergent preferential attachment" induced by triangle motifs, describe the mechanism underlying its formation, and derive the exponent $γ$ within a mean-field approach. Numerically the clusters and the inter-cluster subnetwork are identified through the Ollivier-Ricci curvature of the edges: it is positive inside clusters and negative on the links that form the inter-cluster subnetwork. We find that most inter-cluster triangles are isosceles, with the base lying inside one cluster and the apex belonging to the inter-cluster network. It is conjectured that a spanning inter-cluster scale-free network is stabilized against complete defragmentation into a disconnected set of cliques, by a sparse, structurally rigid "gas" of such apex-shared isosceles triads.

cond-mat.dis-nn↗

Graph neural networks and the energetic cavity method for combinatorial optimization

We study the use of graph neural networks (GNNs) for finding approximate ground states of Ising models. Efficiently finding these ground states is of broad significance because many combinatorial optimization problems can be formulated as an Ising model with the appropriate choice of couplings and fields. Exactly solving these problems is hard but there are many good heuristic methods. A lineage of these heuristics build from mean-field approximations: one approach uses the leading eigenvector of an appropriately defined matrix, another is the min-sum algorithm, also known as the energetic cavity method. Without modification, GNNs perform worse than both of these methods. We consider small modifications to the GNN to incorporate these heuristics and find that this considerably improves performance. While the modified approach is much stronger than other deep learning approaches, we still find that simulated annealing is generally as good for the same computational cost.

cond-mat.dis-nn↗

Contact-number hyperuniformity at glass close packing in infinite dimensions

We investigate contact-number fluctuations of harmonic spheres near glass close packing (GCP), the amorphous jamming endpoint reached by compressing an ideal glass. Using replica theory, we show that the Gardner-unstable region shrinks toward jamming as the spatial dimension increases, allowing GCP to be approached along a stable one-step replica symmetry breaking branch in the high-dimensional limit. By coupling an external field to the local contact number, we derive the variance of the total contact number and the wave-number-dependent structure factor directly from the microscopic interactions. At GCP, the structure factor vanishes quadratically at small scaled wave numbers, demonstrating contact-number hyperuniformity. Upon weak compression above GCP, the structure factor develops a low-wave-number plateau whose height is proportional to the excess coordination. These results provide an analytical description of contact-number hyperuniformity and its breakdown upon compression.

cond-mat.dis-nn↗