Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

21416282 · May 202619922001200920172026
48 results for Hebbian synaptic couplings

Paper introduces supervised and unsupervised TAM models for binary neurons.

problem Learning and retrieval of structured triplets of patterns in neural networks.
method Extends Hebbian paradigm to supervised and unsupervised protocols, using glassy statistical mechanical techniques.
result Obtained self-consistency equations for critical dataset sizes and retrieval performance.

The study reveals how synaptic correlations promote dimension reduction in neural networks.

problem Understanding how synaptic correlations affect neural correlations and dimension reduction in deep neural networks.
method A simplified model of dimension reduction considering pairwise correlations among synapses, using mathematical self-consistency for both binary and continuous synapses.
result Weakly-correlated synapses encourage dimension reduction compared to orthogonal synapses, and they also slow down the decorrelation process.

Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.

problem Learning higher-order correlations in biological neurons.
method Introduce and study generalized nonlinear Hebbian learning rules.
result Neurons can learn tensor eigenvectors of higher-order input correlation tensors.

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 …

2018-06-19abs ↗pdf ↗

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…

2019-03-02abs ↗pdf ↗

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…

2019-11-17abs ↗pdf ↗

Sleep-based regularization stabilizes STDP in recurrent neural networks.

problem Pathological weight dynamics in recurrent SNNs.
method Periodic offline phases with stochastic decay and spontaneous activity.
result Sleep-based renormalization prevents weight saturation and preserves learned structure.

Biological neural network mimics CCA for multi-channel data.

problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.

A model retains learned knowledge for longer by adding a plastic component to neural networks.

problem Catastrophic forgetting in neural networks when learning new tasks.
method Differentiable Hebbian Consolidation model with a DHP Softmax layer.
result Reduces forgetting in benchmarks like Permuted MNIST and Vision Datasets Mixture.

Analyzes unsupervised neural networks using statistical mechanics and Monte Carlo simulations.

problem Understanding computational capabilities of unsupervised neural networks.
method Statistical mechanics approach and Monte Carlo simulations.
result Obtained a phase diagram summarizing network performance.

Study on neural networks with non-normal interactions reveals unique spectral properties.

problem Understanding episodic memory encoding in the brain.
method Developed a neural network model with non-Hermitian couplings and applied random matrix theory.
result Spectral density of the model is non-uniform and can transition to chaos, providing computational benefits.

Bio-inspired neural networks use predictive coding for efficient weight updates.

problem Training artificial neural networks efficiently and biologically plausibly.
method Predictive Coding (PC) updates weights locally using only local information.
result PC provides theoretical advantages like automatic gradient scaling.

New learning rules from information bottleneck improve deep learning without precise labels.

problem Training deep neural networks with backpropagation is biologically implausible.
method Kernelized information bottleneck principle with 3-factor Hebbian structure.
result The new learning rules perform nearly as well as backpropagation on image classification tasks.

Identifies learning rules from neural network observables.

problem Determine the underlying plasticity rules governing learning in biological systems.
method Simulated idealized neuroscience experiments with artificial neural networks to generate a dataset of learning trajectories. Used linear and non-linear classifiers to identify learning rules from aggregate statistics of weights, activations, and activity changes.
result Different classes of learning rules can be separated solely on the basis of aggregate statistics of the weights, activations, or instantaneous layer-wise activity changes.

New algorithm shows neural networks can learn without full backpropagation.

problem Stochastic gradient descent with backpropagation is non-biologically plausible.
method Random and fixed backpropagation weights in a feedback alignment algorithm.
result Error converges to zero exponentially fast in overparameterized networks.

Dense neural networks learn efficiently with large datasets and noise.

problem Training neural networks with large, noisy datasets.
method Statistical mechanics and Monte Carlo simulations.
result Dense neural networks can handle large amounts of patterns and recognize patterns at high signal-to-noise ratios.

Unified approach for neural networks with multi-compartmental neurons and non-Hebbian plasticity.

problem Limited computational power of existing neural network models for multi-compartmental neurons and non-Hebbian plasticity.
method Unified extension of similarity matching approach to derive neural networks with multi-compartmental neurons and local, non-Hebbian learning rules.
result Unified approach facilitates understanding of multi-compartmental neuronal structures and non-Hebbian plasticity.

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…

2019-05-25abs ↗pdf ↗

Recently a daily routine for associative neural networks has been proposed: the network Hebbian-learns during the awake state (thus behaving as a standard Hopfield model), then, during its sleep state, optimizing information storage, it consolidates pure patterns and removes spurious ones: this forces the synaptic matr…

2018-12-21abs ↗pdf ↗

Brain uses synaptic failure to sample from posterior distributions.

problem Bayesian inference in the brain's probabilistic computations.
method Adapting synaptic failure to sample posterior predictive distributions.
result Synaptic failure enables sampling of complete posterior predictive distributions.

Artifical Neural Networks are a particular class of learning systems modeled after biological neural functions with an interesting penchant for Hebbian learning, that is "neurons that wire together, fire together". However, unlike their natural counterparts, artificial neural networks have a close and stringent couplin…

2017-12-22abs ↗pdf ↗

We consider the inverse Ising problem, i.e. the inference of network couplings from observed spin trajectories for a model with continuous time Glauber dynamics. By introducing two sets of auxiliary latent random variables we render the likelihood into a form, which allows for simple iterative inference algorithms with…

2017-09-04abs ↗pdf ↗

Convolutional Neural Networks(CNNs) are both computation and memory intensive which hindered their deployment in mobile devices. Inspired by the relevant concept in neural science literature, we propose Synaptic Pruning: a data-driven method to prune connections between input and output feature maps with a newly propos…

2018-11-06abs ↗pdf ↗

We propose a new cognitive framework for option price modelling, using quantum neural computation formalism. Briefly, when we apply a classical nonlinear neural-network learning to a linear quantum Schrödinger equation, as a result we get a nonlinear Schrödinger equation (NLS), performing as a quantum stochastic filter…

2009-03-04abs ↗pdf ↗

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…

2018-07-12abs ↗pdf ↗

Enhances SNNs for spatio-temporal feature extraction.

problem Insufficient temporal dependencies in existing SNN synaptic structures.
method Integrates temporal convolution and attention mechanisms into synaptic connections.
result Improves SNN performance on classification tasks.

Learning in neural networks poses peculiar challenges when using discretized rather then continuous synaptic states. The choice of discrete synapses is motivated by biological reasoning and experiments, and possibly by hardware implementation considerations as well. In this paper we extend a previous large deviations a…

2016-02-12abs ↗pdf ↗