paper-with-me

홈 › Papers

Dopamine-driven synaptic credit assignment in neural networks

2025-10-25 · Saranraj Nambusubramaniyan, Shervin Safavi, Raja Guru, Andreas Knoblauch arxiv

Solving the synaptic Credit Assignment Problem(CAP) is central to learning in both biological and artificial neural systems. Finding an optimal solution for synaptic CAP means setting the synaptic weights that assign credit to each neuron for influencing the final output and behavior of neural networks or animals. Gradient-based methods solve this problem in artificial neural networks using back-propagation, however, not in the most efficient way. For instance, back-propagation requires a chain of top-down gradient computations. This leads to an expensive optimization process in terms of computing power and memory linked with well-known weight transport and update locking problems. To address these shortcomings, we take a NeuroAI approach and draw inspiration from neural Reinforcement Learning to develop a derivative-free optimizer for training neural networks, Dopamine. Dopamine is developed for Weight Perturbation (WP) learning that exploits stochastic updating of weights towards optima. It achieves this by minimizing the regret, a form of Reward Prediction Error (RPE) between the expected outcome from the perturbed model and the actual outcome from the unperturbed model. We use this RPE to adjust the learning rate in the network (i.e., creating an adaptive learning rate strategy, similar to the role of dopamine in the brain). We tested the Dopamine optimizer for training multi-layered perceptrons for XOR tasks, and recurrent neural networks for chaotic time series forecasting. Dopamine-trained models demonstrate accelerated convergence and outperform standard WP, and give comparable performance to gradient-based algorithms, while consuming significantly less computation and memory. Overall, the Dopamine optimizer not only finds robust solutions and comparable performance to the state-of-the-art Machine Learning optimizers but is also neurobiologically more plausible.

📄 PDF Abstract BibTeX arXiv:2510.22178

Code (0)

등록된 구현이 없습니다.

Tasks

Time Series ForecastingReinforcement Learning

Similar Papers 제목 키워드 기반

Temporal-Difference Learning Using Distributed Error Signals

2024-11-06 · Jonas Guan, Shon Eduard Verch, Claas Voelcker, Ethan C. Jackson 외

A computational problem in biological reward-based learning is how credit assignment is performed in the nucleus accumbens (NAc). Much research suggests that NAc dopamine encodes temporal-difference (TD) errors for learn…

Q-Learning

Learning credit assignment

2020-01-10 · Chan Li, Haiping Huang

Deep learning has achieved impressive prediction accuracies in a variety of scientific and industrial domains. However, the nested non-linear feature of deep learning makes the learning highly non-transparent, i.e., it i…

Decision MakingDeep Learning

Learning From the Past with Cascading Eligibility Traces

2025-06-17 · Tokiniaina Raharison Ralambomihanta, Ivan Anokhin, Roman Pogodin, Samira Ebrahimi Kahou 외

Animals often receive information about errors and rewards after a significant delay. For example, there is typically a delay of tens to hundreds of milliseconds between motor actions and visual feedback. The standard ap…

Meta-learning three-factor plasticity rules for structured credit assignment with sparse feedback

2025-12-10 · Dimitra Maoutsa arxiv

Biological neural networks learn complex behaviors from sparse, delayed feedback using local synaptic plasticity, yet the mechanisms enabling structured credit assignment remain elusive. In contrast, artificial recurrent…

Biologically-plausible backpropagation through arbitrary timespans via local neuromodulators

2022-06-02 · Yuhan Helena Liu, Stephen Smith, Stefan Mihalas, Eric Shea-Brown 외

The spectacular successes of recurrent neural network models where key parameters are adjusted via backpropagation-based gradient descent have inspired much thought as to how biological neuronal networks might solve the …