A biologically plausible neural network for Slow Feature Analysis
Learning latent features from time series data is an important problem in both machine learning and brain function. One approach, called Slow Feature Analysis (SFA), leverages the slowness of many salient features relative to the rapidly varying input signals. Furthermore, when trained on naturalistic stimuli, SFA reproduces interesting properties of cells in the primary visual cortex and hippocampus, suggesting that the brain uses temporal slowness as a computational principle for learning latent features. However, despite the potential relevance of SFA for modeling brain function, there is currently no SFA algorithm with a biologically plausible neural network implementation, by which we mean an algorithm operates in the online setting and can be mapped onto a neural network with local synaptic updates. In this work, starting from an SFA objective, we derive an SFA algorithm, called Bio-SFA, with a biologically plausible neural network implementation. We validate Bio-SFA on naturalistic stimuli.
Code (1)
Tasks
HippocampusTime SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
A Dual Fast and Slow Feature Interaction in Biologically Inspired Visual Recognition of Human Action
Computational neuroscience studies that have examined human visual system through functional magnetic resonance imaging (fMRI) have identified a model where the mammalian brain pursues two distinct pathways (for recognit…
FormOptical Flow EstimationPairing cellular and synaptic dynamics into building blocks of rhythmic neural circuits
The purpose of this paper is trifold -- to serve as an instructive resource and a reference catalog for biologically plausible modeling with i) conductance-based models, coupled with ii) strength-varying slow synapse mod…
RhythmBeyond accuracy: generalization properties of bio-plausible temporal credit assignment rules
To unveil how the brain learns, ongoing work seeks biologically-plausible approximations of gradient descent algorithms for training recurrent neural networks (RNNs). Yet, beyond task accuracy, it is unclear if such lear…
Learning TheoryUnlocking the Potential of Similarity Matching: Scalability, Supervision and Pre-training
While effective, the backpropagation (BP) algorithm exhibits limitations in terms of biological plausibility, computational cost, and suitability for online learning. As a result, there has been a growing interest in dev…
Computational EfficiencyBiologically plausible single-layer networks for nonnegative independent component analysis
An important problem in neuroscience is to understand how brains extract relevant signals from mixtures of unknown sources, i.e., perform blind source separation. To model how the brain performs this task, we seek a biol…
blind source separation