A model retains learned knowledge for longer by adding a plastic component to neural networks.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Unified approach for neural networks with multi-compartmental neurons and non-Hebbian plasticity.
Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.
How can we build agents that keep learning from experience, quickly and efficiently, after their initial training? Here we take inspiration from the main mechanism of learning in biological brains: synaptic plasticity, carefully tuned by evolution to produce efficient lifelong learning. We show that plasticity, just li…
Proposes a new neural network approach to credit assignment.
Sleep-based regularization stabilizes STDP in recurrent neural networks.
Oja's rule improves neural network training without engineered tricks.
Catastrophic forgetting/interference is a critical problem for lifelong learning machines, which impedes the agents from maintaining their previously learned knowledge while learning new tasks. Neural networks, in particular, suffer plenty from the catastrophic forgetting phenomenon. Recently there has been several eff…
Despite our extensive knowledge of biophysical properties of neurons, there is no commonly accepted algorithmic theory of neuronal function. Here we explore the hypothesis that single-layer neuronal networks perform online symmetric nonnegative matrix factorization (SNMF) of the similarity matrix of the streamed data. …
A dynamic Boltzmann machine (DyBM) has been proposed as a model of a spiking neural network, and its learning rule of maximizing the log-likelihood of given time-series has been shown to exhibit key properties of spike-timing dependent plasticity (STDP), which had been postulated and experimentally confirmed in the fie…
Olshausen and Field (OF) proposed that neural computations in the primary visual cortex (V1) can be partially modeled by sparse dictionary learning. By minimizing the regularized representation error they derived an online algorithm, which learns Gabor-filter receptive fields from a natural image ensemble in agreement …
Spike-timing dependent plasticity (STDP) which observed in the brain has proven to be important in biological learning. On the other hand, artificial neural networks use a different way to learn, such as Back-Propagation or Contrastive Hebbian Learning. In this work, we propose a new framework called mstdp that learn a…
VSML unifies meta learning concepts and enables simple backpropagation.
Physics-informed deep learning approximates strain gradient plasticity solutions.
Bio-inspired neural networks use predictive coding for efficient weight updates.
A federated model learns shared archetypes from heterogeneous clients in continual learning.
In this work we propose Hebbian-descent as a biologically plausible learning rule for hetero-associative as well as auto-associative learning in single layer artificial neural networks. It can be used as a replacement for gradient descent as well as Hebbian learning, in particular in online learning, as it inherits the…
In this paper, we derive a new model of synaptic plasticity, based on recent algorithms for reinforcement learning (in which an agent attempts to learn appropriate actions to maximize its long-term average reward). We show that these direct reinforcement learning algorithms also give locally optimal performance for the…
Introduces generalized almost plastic structures on manifolds.
Identifies learning rules from neural network observables.
BDH model learns like the brain, rivaling Transformer performance.
Model for material elasticity and plasticity using networks.
Biological neural network mimics CCA for multi-channel data.
Hebbian learning derived from maximum entropy principles.
Neural networks are commonly trained to make predictions through learning algorithms. Contrastive Hebbian learning, which is a powerful rule inspired by gradient backpropagation, is based on Hebb's rule and the contrastive divergence algorithm. It operates in two phases, the forward (or free) phase, where the data are …
This paper presents a new neural architecture that combines a modulated Hebbian network (MOHN) with DQN, which we call modulated Hebbian plus Q network architecture (MOHQA). The hypothesis is that such a combination allows MOHQA to solve difficult partially observable Markov decision process (POMDP) problems which impa…
Natural gradient learning improves synaptic plasticity in spiking neurons.
AANets balance stability and plasticity in CIL.
Flashback Learning balances model stability and plasticity in continual learning.
Neural network models of early sensory processing typically reduce the dimensionality of streaming input data. Such networks learn the principal subspace, in the sense of principal component analysis (PCA), by adjusting synaptic weights according to activity-dependent learning rules. When derived from a principled cost…
Improved neural ODEs learn adaptable flows.
Vision transformers benefit from non-smooth components in adaptation.
Metric anomalies arising from a distribution of point defects (intrinsic interstitials, vacancies, point stacking faults), thermal deformation, biological growth, etc. are well known sources of material inhomogeneity and internal stress. By emphasizing the geometric nature of such anomalies we seek their representation…
Learning and memory in the brain are implemented by complex, time-varying changes in neural circuitry. The computational rules according to which synaptic weights change over time are the subject of much research, and are not precisely understood. Until recently, limitations in experimental methods have made it challen…
We unify recent neural approaches to one-shot learning with older ideas of associative memory in a model for metalearning. Our model learns jointly to represent data and to bind class labels to representations in a single shot. It builds representations via slow weights, learned across tasks through SGD, while fast wei…
Enhanced BCPNN learns hidden representations without labels.
For many years, a combination of principal component analysis (PCA) and independent component analysis (ICA) has been used for blind source separation (BSS). However, it remains unclear why these linear methods work well with real-world data that involve nonlinear source mixtures. This work theoretically validates that…
Unified framework for strain-gradient plasticity from dislocations.
Selective reinitialization improves adaptability of neural bandits in dynamic environments.
This paper presents a method to improve continual learning stability and plasticity.
Machine learning (ML) classifiers always benefit from more informative input features. We seek to auto-generate stronger feature sets in order to address the difficulty that ML methods often experience given limited training data. A wide range of biological neural nets (BNNs) excel at fast learning, implying that they …
This paper suggests a learning-theoretic perspective on how synaptic plasticity benefits global brain functioning. We introduce a model, the selectron, that (i) arises as the fast time constant limit of leaky integrate-and-fire neurons equipped with spiking timing dependent plasticity (STDP) and (ii) is amenable to the…
Elite ONNs learn better with synaptic plasticity, improving performance over CNNs.
New derivation shows how a three-factor learning rule is derived from Oja's rule.
Paper introduces supervised and unsupervised TAM models for binary neurons.
Dropout helps a stable network learn new tasks without forgetting old ones.
Recently, a novel family of biologically plausible online algorithms for reducing the dimensionality of streaming data has been derived from the similarity matching principle. In these algorithms, the number of output dimensions can be determined adaptively by thresholding the singular values of the input data matrix. …
Develops a new method for solving generalized eigenvalue problems efficiently.