CoChat

Learning internal representations in an attractor neural network with analogue neurons

Amit, Daniel J, Brunel, Nicolas · 1995 · Network: Computation in Neural Systems
Cited by 76

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Abstract

A learning attractor neural network (LANN) with a double dynamics of neural activities and synaptic efficacies, operating on two different timescales is studied by simulations in preparation for an electronic implementation, The present network includes several quasi-realistic features: neurons are represented by their afferent currents and output spike rates; excitatory and inhibitory neurons are separated; attractor spike rates as well as coding levels in arriving stimuli are low; learning takes place only between excitatory units. Synaptic dynamics is an unsupervised, analogue Hebbian process, but long term memory in the absence of neural activity is maintained by a refresh mechanism which on long timescales discretizes the synaptic values, converting learning into asynchronous stochastic process induced by the stimuli on the synaptic efficacies.This network is intended to lean a set of amactors from the statistics of freely arriving stimuli, which are represented by extemal synaptic inputs injected into the excitatory neurons. In the simulations different types of sequences of many thousands of stimuli are presented to Ihe network, without distinguishing in the dynamics a leaming phase from retrieval. Stimulus sequences differ in pre-assigned global statistics (including time-dependent statistics); in orders of presentation of individual stimuli within a given statistics: in lengths of time intervals for each presentation and in the intervals separating one stimulus from another.We find that the network effectively learns a set of attractors representing the statistics of the stimuli. and is able to modify its amactors when the input staristics change. Moreover, as the global input statistics changes the network can also forget attracton related to stimulus classes no longer presented. Forgetting takes place only due to the arrival of new stimuli. The performance of the network and the statistics of he amactors are studied as a function of the inmt statistics. Mast of the large-scale characteristics of the leamina dynamics can be captured theoretically.This model modifies a previous implementation of a LANN composed of discrete neurons. in a nerwork of more redistic neurons. The different elements have been designed to facilitate their implementation in silicon.†On leave of absence from Racah Institute of Physics, Jerusalem, Israel.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/0954-898x_6_3_004

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 76

Metadata

Authors
Amit, D. J., & Brunel, N.
Venue
Network: Computation in Neural Systems
Published
1995-01
Volume
6
Issue
3
Pages
359-388
ISSN
  • 0954-898X (ISSN-L)
  • 1361-6536
OpenAlex
W2155612774
Cited by
76
References
3
FWCI
16.28
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Learning internal representations in an attractor neural network with analogue neurons. https://app.cochat.ai/papers/10.1088/0954-898x_6_3_004
The paper
Amit, D. J., & Brunel, N. (1995). Learning internal representations in an attractor neural network with analogue neurons. Network: Computation in Neural Systems. https://doi.org/10.1088/0954-898x_6_3_004

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.