Sign in
NeurosciencePLoS Computational Biology
Peer-reviewed journal article

Continual familiarity decoding from recurrent connections in spiking networks

Viktoria ZemliakiD, Gordon PipaiD, Pascal NietersiD

Abstract

Familiarity memory enables recognition of previously encountered inputs as familiar without recalling detailed stimuli information, which supports adaptive behavior across various timescales. We present a spiking neural network model with lateral connectivity shaped by unsupervised spike-timing-dependent plasticity (STDP) that encodes familiarity via local plasticity events. We show that familiarity can be decoded from network activity using both frequency (spike count) and temporal (spike synchrony) characteristics of spike trains. Temporal coding demonstrates enhanced performance under sparse input conditions, consistent with the principles of sparse coding observed in the brain. We also show how connectivity structure supports each decoding strategy, revealing different plasticity regimes. Our approach outperforms LSTM in temporal generalizability on the continual familiarity detection task, with input stimuli being naturally encoded in the recurrent connectivity without a separate training stage.

PDFDOI

02 /Specification & Classification

Click any tag to browse matching papers
Citations
1
FWCI
0.57
Field percentile
top 35%

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISZemliak '25Pokorny '19Kim '18Ballintyn '19Tyulmankov '21Dehghani-Ha '25
77% semantic matchNeuroscience