EDBT 2026 Demo / reviewers in the wild / expert
Jaldert O. Rombouts
dblp:14/8656
· DBLP profile ↗
6ranked-venue papers
4as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Deep learning architectures and training · 54% Reinforcement learning · 30% Knowledge representation and reasoning · 9% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
biologically plausible learning |
0.1 | 1 | 2012 | Neurally Plausible Reinforcement Learning of Working Memory Tasks · NIPS 2012 |
Machine learning › Reinforcement learning › memory architectures
working memory |
0.1 | 1 | 2012 | Neurally Plausible Reinforcement Learning of Working Memory Tasks · NIPS 2012 |
Machine learning › Deep learning architectures and training
spiking neural network |
0.1 | 1 | 2010 | Fractionally Predictive Spiking Neurons · NIPS 2010 |
Machine learning › Representation and self-supervised learning › computational neuroscience
neural coding |
0.0 | 1 | 2010 | Fractionally Predictive Spiking Neurons · NIPS 2010 |
Methods — techniques the papers use, named apart from their topics
synaptic tagging · 0.1reward-based learning · 0.1neuromodulation · 0.1thresholding spiking neuron · 0.1power-law kernel approximation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | How Attention Can Create Synaptic Tags for the Learning of Working Memories in Sequential TasksabstractIntelligence is our ability to learn appropriate responses to new stimuli and situations. Neurons in association cortex are thought to be essential for this ability. During learning these neurons become tuned to relevant features and start to represent them with persistent activity during memory delays. This learning process is not well understood. Here we develop a biologically plausible learning scheme that explains how trial-and-error learning induces neuronal selectivity and working memory representations for task-relevant information. We propose that the response selection stage sends attentional feedback signals to earlier processing levels, forming synaptic tags at those connections responsible for the stimulus-response mapping. Globally released neuromodulators then interact with tagged synapses to determine their plasticity. The resulting learning rule endows neural networks with the capacity to create new working memory representations of task relevant information as persistent activity. It is remarkably generic: it explains how association neurons learn to store task-relevant information for linear as well as non-linear stimulus-response mappings, how they become tuned to category boundaries or analog variables, depending on the task demands, and how they learn to integrate probabilistic evidence for perceptual decisions. Jaldert O. Rombouts, Sander M. Bohté, Pieter R. Roelfsema |
PLoS Comput. Biol. | 1 |
| 2014 | Learning resets of neural working memory
Jaldert O. Rombouts, Pieter R. Roelfsema, Sander M. Bohté |
ESANN | 1 |
| 2014 | Spiking AGREL
Davide Zambrano, Jaldert O. Rombouts, Cecilia Laschi, Sander M. Bohté |
ESANN | 2 |
| 2012 | Biologically Plausible Multi-dimensional Reinforcement Learning in Neural Networks
Jaldert O. Rombouts, Arjen van Ooyen, Pieter R. Roelfsema, Sander M. Bohté |
ICANN (1) | 1 |
| 2012 | Neurally Plausible Reinforcement Learning of Working Memory TasksabstractA key function of brains is undoubtedly the abstraction and maintenance of information from the environment for later use. Neurons in association cortex play an important role in this process: during learning these neurons become tuned to relevant features and represent the information that is required later as a persistent elevation of their activity. It is however not well known how these neurons acquire their task-relevant tuning. Here we introduce a biologically plausible learning scheme that explains how neurons become selective for relevant information when animals learn by trial and error. We propose that the action selection stage feeds back attentional signals to earlier processing levels. These feedback signals interact with feedforward signals to form synaptic tags at those connections that are responsible for the stimulus-response mapping. A globally released neuromodulatory signal interacts with these tagged synapses to determine the sign and strength of plasticity. The learning scheme is generic because it can train networks in different tasks, simply by varying inputs and rewards. It explains how neurons in association cortex learn to (1) temporarily store task-relevant information in non-linear stimulus-response mapping tasks and (2) learn to optimally integrate probabilistic evidence for perceptual decision making. Jaldert O. Rombouts, Sander M. Bohté, Pieter R. Roelfsema |
NIPS | 1 |
| 2010 | Fractionally Predictive Spiking NeuronsabstractRecent experimental work has suggested that the neural firing rate can be interpreted as a fractional derivative, at least when signal variation induces neural adaptation. Here, we show that the actual neural spike-train itself can be considered as the fractional derivative, provided that the neural signal is approximated by a sum of power-law kernels. A simple standard thresholding spiking neuron suffices to carry out such an approximation, given a suitable refractory response. Empirically, we find that the online approximation of signals with a sum of power-law kernels is beneficial for encoding signals with slowly varying components, like long-memory self-similar signals. For such signals, the online power-law kernel approximation typically required less than half the number of spikes for similar SNR as compared to sums of similar but exponentially decaying kernels. As power-law kernels can be accurately approximated using sums or cascades of weighted exponentials, we demonstrate that the corresponding decoding of spike-trains by a receiving neuron allows for natural and transparent temporal signal filtering by tuning the weights of the decoding kernel. Sander M. Bohté, Jaldert O. Rombouts |
NIPS | 2 |