EDBT 2026 Demo / reviewers in the wild / expert
Bernd Porr
dblp:36/6215
· DBLP profile ↗
29ranked-venue papers
11as first author
2since 2021 · last 2025
0000-0001-8157-998XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 23 · 11 first-author · 1 since 2021Systems, architecture and hardware · 4 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1
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
4 papers |
Motion planning and robot control · 31% Legged, aerial and field robots · 21% Reinforcement learning · 19% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Emerging computing paradigms · 94% Hardware accelerators and domain-specific architectures · 6% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 16 heaviest of 18, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning
hebbian learning |
0.1 | 1 | 2008 | On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor · NIPS 2008 |
Machine learning › Reinforcement learning
temporal difference learning |
0.1 | 1 | 2008 | On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor · NIPS 2008 |
Robotics › Legged, aerial and field robots › legged robots
biped robot |
0.1 | 1 | 2005 | Fast biped walking with a reflexive controller and real-time policy searching · NIPS 2005 |
Robotics › Legged, aerial and field robots
dynamic walking |
0.1 | 1 | 2005 | Fast biped walking with a reflexive controller and real-time policy searching · NIPS 2005 |
Robotics › Motion planning and robot control
robot control |
0.1 | 1 | 2005 | Fast biped walking with a reflexive controller and real-time policy searching · NIPS 2005 |
Emerging computing paradigms
neuromorphic computing |
0.1 | 1 | 2005 | Temporally changing synaptic plasticity · NIPS 2005 |
Emerging computing paradigms › neuromorphic computing › synaptic plasticity
spike-timing-dependent plasticity |
0.1 | 1 | 2005 | Temporally changing synaptic plasticity · NIPS 2005 |
Emerging computing paradigms › neuromorphic computing
synaptic plasticity |
0.1 | 1 | 2005 | Temporally changing synaptic plasticity · NIPS 2005 |
Bioinformatics and computational biology
computational neuroscience |
0.0 | 1 | 2003 | Analytical Solution of Spike-timing Dependent Plasticity Based on Synaptic Biophysics · NIPS 2003 |
Bioinformatics and computational biology › computational neuroscience › synaptic plasticity
spike-timing-dependent plasticity |
0.0 | 1 | 2003 | Analytical Solution of Spike-timing Dependent Plasticity Based on Synaptic Biophysics · NIPS 2003 |
Bioinformatics and computational biology › computational neuroscience
synaptic plasticity |
0.0 | 1 | 2003 | Analytical Solution of Spike-timing Dependent Plasticity Based on Synaptic Biophysics · NIPS 2003 |
Robotics › Motion planning and robot control › robot control › controller design
feedforward control |
0.0 | 1 | 2002 | Learning a Forward Model of a Reflex · NIPS 2002 |
Robotics › Robot navigation and mapping
forward model learning |
0.0 | 1 | 2002 | Learning a Forward Model of a Reflex · NIPS 2002 |
Robotics › Motion planning and robot control › robot control › behavior-based control
reflex control |
0.0 | 1 | 2002 | Learning a Forward Model of a Reflex · NIPS 2002 |
Robotics › Motion planning and robot control › robot learning
sensorimotor learning |
0.0 | 1 | 2002 | Learning a Forward Model of a Reflex · NIPS 2002 |
Machine learning › Reinforcement learning › policy optimization
policy gradient |
0.0 | 1 | 2005 | Fast biped walking with a reflexive controller and real-time policy searching · NIPS 2005 |
Methods — techniques the papers use, named apart from their topics
local modulatory signal · 0.1correlation-based learning · 0.1stereoscopic depth analysis · 0.1winner-take-all · 0.1reflexive neuronal control · 0.1policy gradient reinforcement learning · 0.1differential hebbian learning · 0.1analytical derivation · 0.0linear learning algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Model checking with memoisation for fast overtaking planningabstractFast and reliable trajectory planning is a key requirement of autonomous vehicles. In this paper we introduce a novel technique for planning the route of an autonomous vehicle on a straight, traffic-heavy rural road using the SPIN model checker. We show how we can combine SPIN's ability to identify paths violating temporal properties with sensor information from a 3D Unity simulation of an autonomous vehicle, to plan and perform consecutive overtaking manoeuvres. This involves discretising the sensory information and combining multiple sequential SPIN models with a Linear-time Temporal Logic specification to generate an error path. This path provides the autonomous vehicle with an action plan. The entire process is fast (using no precomputed data) and the action plan is tailored for individual scenarios. Our experiments demonstrate that the simulated autonomous vehicle implementing our approach can drive a median of 37 km and overtake a median of 187 vehicles before experiencing a collision - which is usually caused by inaccuracies in the sensory system. We also describe a memoisation approach which helps to mitigate one of the drawbacks of our approach - the cost of model compilation. Our novel approach demonstrates a potentially powerful future tool for efficient trajectory planning for autonomous vehicles. Alice Miller 0001, Bernd Porr, Ivaylo Valkov, Douglas Fraser, Daumantas Pagojus |
Sci. Comput. Program. | 2 |
| 2023 | Touch if it's Transparent! ACTOR: Active Tactile-Based Category-Level Transparent Object ReconstructionabstractAccurate shape reconstruction of transparent ob-jects is a challenging task due to their non-Lambertian surfaces and yet necessary for robots for accurate pose perception and safe manipulation. As vision-based sensing can produce erroneous measurements for transparent objects, the tactile modality is not sensitive to object transparency and can be used for reconstructing the object's shape. We propose AC-TOR, a novel framework for ACtive tactile-based category-level Transparent Object Reconstruction. ACTOR leverages large datasets of synthetic object with our proposed self-supervised learning approach for object shape reconstruction as the collection of real-world tactile data is prohibitively expensive. ACTOR can be used during inference with tactile data from category-level unknown transparent objects for reconstruction. Furthermore, we propose an active-tactile object exploration strategy as probing every part of the object surface can be sample inefficient. We also demonstrate tactile-based category-level object pose estimation task using ACTOR. We perform an extensive evaluation of our proposed methodology with real-world robotic experiments with comprehensive comparison studies with state-of-the-art approaches. Our proposed method outperforms these approaches in terms of tactile-based object reconstruction and object pose estimation. Prajval Kumar Murali, Bernd Porr, Mohsen Kaboli |
IROS | 2 |
| 2020 | Closed-Loop Deep Learning: Generating Forward Models With BackpropagationabstractA reflex is a simple closed-loop control approach that tries to minimize an error but fails to do so because it will always react too late. An adaptive algorithm can use this error to learn a forward model with the help of predictive cues. For example, a driver learns to improve steering by looking ahead to avoid steering in the last minute. In order to process complex cues such as the road ahead, deep learning is a natural choice. However, this is usually achieved only indirectly by employing deep reinforcement learning having a discrete state space. Here, we show how this can be directly achieved by embedding deep learning into a closed-loop system and preserving its continuous processing. We show in z-space specifically how error backpropagation can be achieved and in general how gradient-based approaches can be analyzed in such closed-loop scenarios. The performance of this learning paradigm is demonstrated using a line follower in simulation and on a real robot that shows very fast and continuous learning. Sama Daryanavard, Bernd Porr |
Neural Comput. | 2 |
| 2016 | Model checking learning agent systems using Promela with embedded C code and abstractionabstractAbstract As autonomous systems become more prevalent, methods for their verification will become more widely used. Model checking is a formal verification technique that can help ensure the safety of autonomous systems, but in most cases it cannot be applied by novices, or in its straight “off-the-shelf” form. In order to be more widely applicable it is crucial that more sophisticated techniques are used, and are presented in a way that is reproducible by engineers and verifiers alike. In this paper we demonstrate in detail two techniques that are used to increase the power of model checking using the model checker S pin . The first of these is the use of embedded C code within Promela specifications, in order to accurately reflect robot movement. The second is to use abstraction together with a simulation relation to allow us to verify multiple environments simultaneously. We apply these techniques to a fairly simple system in which a robot moves about a fixed circular environment and learns to avoid obstacles. The learning algorithm is inspired by the way that insects learn to avoid obstacles in response to pain signals received from their antennae. Crucially, we prove that our abstraction is sound for our example system—a step that is often omitted but is vital if formal verification is to be widely accepted as a useful and meaningful approach. Ryan F. Kirwan, Alice Miller 0001, Bernd Porr |
Formal Aspects Comput. | 3 |
| 2013 | Formal Modeling of Robot Behavior with LearningabstractWe present formal specification and verification of a robot moving in a complex network, using temporal sequence learning to avoid obstacles. Our aim is to demonstrate the benefit of using a formal approach to analyze such a system as a complementary approach to simulation. We first describe a classical closed-loop simulation of the system and compare this approach to one in which the system is analyzed using formal verification. We show that the formal verification has some advantages over classical simulation and finds deficiencies our classical simulation did not identify. Specifically we present a formal specification of the system, defined in the Promela modeling language and show how the associated model is verified using the Spin model checker. We then introduce an abstract model that is suitable for verifying the same properties for any environment with obstacles under a given set of assumptions. We outline how we can prove that our abstraction is sound: any property that holds for the abstracted model will hold in the original (unabstracted) model. Ryan F. Kirwan, Alice Miller 0001, Bernd Porr, Paolo Di Prodi |
Neural Comput. | 3 |
| 2011 | How feedback inhibition shapes spike-timing-dependent plasticity and its implications for recent Schizophrenia models
Bernd Porr, Lynsey McCabe, Paolo Di Prodi, Christoph Kolodziejski, Florentin Wörgötter |
Neural Networks | 1 |
| 2009 | On the Asymptotic Equivalence Between Differential Hebbian and Temporal Difference LearningabstractIn this theoretical contribution, we provide mathematical proof that two of the most important classes of network learning-correlation-based differential Hebbian learning and reward-based temporal difference learning-are asymptotically equivalent when timing the learning with a modulatory signal. This opens the opportunity to consistently reformulate most of the abstract reinforcement learning framework from a correlation-based perspective more closely related to the biophysics of neurons. Christoph Kolodziejski, Bernd Porr, Florentin Wörgötter |
Neural Comput. | 2 |
| 2008 | On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factorabstractIn this theoretical contribution we provide mathematical proof that two of the most important classes of network learning - correlation-based differential Hebbian learning and reward-based temporal difference learning - are asymptotically equivalent when timing the learning with a local modulatory signal. This opens the opportunity to consistently reformulate most of the abstract reinforcement learning framework from a correlation based perspective that is more closely related to the biophysics of neurons. Christoph Kolodziejski, Bernd Porr, Minija Tamosiunaite, Florentin Wörgötter |
NIPS | 2 |
| 2007 | The RunBot Architecture for Adaptive, Fast, Dynamic WalkingabstractIn this paper the authors present the architecture of the planar biped robot "RunBot". It has been developed on the basis of three hierarchical levels: biomechanical, local and central. The biomechanical level concerns an appropriate biomechanical design of RunBot which utilizes some principles of passive walkers to ensure stability. The local level is a low-level neuronal structure which generates dynamically stable gaits as well as fast motions with some degree of self-stabilization to guarantee basic robustness. In the central level, we simulate a mechanism for synaptic plasticity which allows RunBot to autonomously learn to adapt its locomotion to different terrains, e.g. level floor versus up or down a ramp. As a result, the structural coupling of all these levels generates adaptive, fast dynamic walking of RunBot. Poramate Manoonpong, Tao Geng, Bernd Porr, Florentin Wörgötter |
ISCAS | 3 |
| 2007 | An Undersampling Digital MicrophoneabstractAs negative feedback in control systems is often not applicable and/or produces undesirable effects, this paper presents the analysis and simulation of a digital microphone using a sigma delta A/D converter comprising of a voltage controlled oscillator (VCO) and sampling D-FF to digitize data. The sigma delta modulator (SDM) is analyzed mathematically and then used in a digital microphone application. A new approach is taken utilizing undersampling to convert the high frequency bandpass signal to lower frequency digital signal and also to increase the frequency modulation with respect to the center frequency. The combination of high frequencies and undersampling can easily be implemented on a completely integrated circuit. Sven Soell, Bernd Porr |
ISCAS | 2 |
| 2007 | Development of receptive fields in a closed-loop behavioural system
Tomas Kulvicius, Bernd Porr, Florentin Wörgötter |
Neurocomputing | 2 |
| 2007 | Improved stability and convergence with three factor learning
Bernd Porr, Tomas Kulvicius, Florentin Wörgötter |
Neurocomputing | 1 |
| 2007 | Learning with "Relevance": Using a Third Factor to Stabilize Hebbian LearningabstractIt is a well-known fact that Hebbian learning is inherently unstable because of its self-amplifying terms: the more a synapse grows, the stronger the postsynaptic activity, and therefore the faster the synaptic growth. This unwanted weight growth is driven by the autocorrelation term of Hebbian learning where the same synapse drives its own growth. On the other hand, the cross-correlation term performs actual learning where different inputs are correlated with each other. Consequently, we would like to minimize the autocorrelation and maximize the cross-correlation. Here we show that we can achieve this with a third factor that switches on learning when the autocorrelation is minimal or zero and the cross-correlation is maximal. The biological counterpart of such a third factor is a neuromodulator that switches on learning at a certain moment in time. We show in a behavioral experiment that our three-factor learning clearly outperforms classical Hebbian learning. Bernd Porr, Florentin Wörgötter |
Neural Comput. | 1 |
| 2007 | Adaptive, Fast Walking in a Biped Robot under Neuronal Control and LearningabstractHuman walking is a dynamic, partly self-stabilizing process relying on the interaction of the biomechanical design with its neuronal control. The coordination of this process is a very difficult problem, and it has been suggested that it involves a hierarchy of levels, where the lower ones, e.g., interactions between muscles and the spinal cord, are largely autonomous, and where higher level control (e.g., cortical) arises only pointwise, as needed. This requires an architecture of several nested, sensori-motor loops where the walking process provides feedback signals to the walker's sensory systems, which can be used to coordinate its movements. To complicate the situation, at a maximal walking speed of more than four leg-lengths per second, the cycle period available to coordinate all these loops is rather short. In this study we present a planar biped robot, which uses the design principle of nested loops to combine the self-stabilizing properties of its biomechanical design with several levels of neuronal control. Specifically, we show how to adapt control by including online learning mechanisms based on simulated synaptic plasticity. This robot can walk with a high speed (>3.0 leg length/s), self-adapting to minor disturbances, and reacting in a robust way to abruptly induced gait changes. At the same time, it can learn walking on different terrains, requiring only few learning experiences. This study shows that the tight coupling of physical with neuronal control, guided by sensory feedback from the walking pattern itself, combined with synaptic learning may be a way forward to better understand and solve coordination problems in other complex motor tasks. Poramate Manoonpong, Tao Geng, Tomas Kulvicius, Bernd Porr, Florentin Wörgötter |
PLoS Comput. Biol. | 4 |
| 2007 | Correction: Adaptive, Fast Walking in a Biped Robot under Neuronal Control and LearningabstractIn Figure The incorrect Froude number given for human walking (0.24) corresponds to 1.5m/s, which is closer to the preferred speed of human walking. The correct number now given (2.4) corresponds to a speed of about 4.6m/s. Poramate Manoonpong, Tao Geng, Tomas Kulvicius, Bernd Porr, Florentin Wörgötter |
PLoS Comput. Biol. | 4 |
| 2006 | A Reflexive Neural Network for Dynamic Biped Walking ControlabstractBiped walking remains a difficult problem, and robot models can greatly facilitate our understanding of the underlying biomechanical principles as well as their neuronal control. The goal of this study is to specifically demonstrate that stable biped walking can be achieved by combining the physical properties of the walking robot with a small, reflex-based neuronal network governed mainly by local sensor signals. Building on earlier work (Taga, 1995; Cruse, Kindermann, Schumm, Dean, & Schmitz, 1998), this study shows that human-like gaits emerge without specific position or trajectory control and that the walker is able to compensate small disturbances through its own dynamical properties. The reflexive controller used here has the following characteristics, which are different from earlier approaches: (1) Control is mainly local. Hence, it uses only two signals (anterior extreme angle and ground contact), which operate at the interjoint level. All other signals operate only at single joints. (2) Neither position control nor trajectory tracking control is used. Instead, the approximate nature of the local reflexes on each joint allows the robot mechanics itself (e.g., its passive dynamics) to contribute substantially to the overall gait trajectory computation. (3) The motor control scheme used in the local reflexes of our robot is more straightforward and has more biological plausibility than that of other robots, because the outputs of the motor neurons in our reflexive controller are directly driving the motors of the joints rather than working as references for position or velocity control. As a consequence, the neural controller and the robot mechanics are closely coupled as a neuromechanical system, and this study emphasizes that dynamically stable biped walking gaits emerge from the coupling between neural computation and physical computation. This is demonstrated by different walking experiments using a real robot as well as by a Poincaré map analysis applied on a model of the robot in order to assess its stability. Tao Geng, Bernd Porr, Florentin Wörgötter |
Neural Comput. | 2 |
| 2006 | Strongly Improved Stability and Faster Convergence of Temporal Sequence Learning by Using Input Correlations OnlyabstractCurrently all important, low-level, unsupervised network learning algorithms follow the paradigm of Hebb, where input and output activity are correlated to change the connection strength of a synapse. However, as a consequence, classical Hebbian learning always carries a potentially destabilizing autocorrelation term, which is due to the fact that every input is in a weighted form reflected in the neuron's output. This self-correlation can lead to positive feedback, where increasing weights will increase the output, and vice versa, which may result in divergence. This can be avoided by different strategies like weight normalization or weight saturation, which, however, can cause different problems. Consequently, in most cases, high learning rates cannot be used for Hebbian learning, leading to relatively slow convergence. Here we introduce a novel correlation-based learning rule that is related to our isotropic sequence order (ISO) learning rule (Porr & Wörgötter, 2003a), but replaces the derivative of the output in the learning rule with the derivative of the reflex input. Hence, the new rule uses input correlations only, effectively implementing strict heterosynaptic learning. This looks like a minor modification but leads to dramatically improved properties. Elimination of the output from the learning rule removes the unwanted, destabilizing autocorrelation term, allowing us to use high learning rates. As a consequence, we can mathematically show that the theoretical optimum of one-shot learning can be reached under ideal conditions with the new rule. This result is then tested against four different experimental setups, and we will show that in all of them, very few (and sometimes only one) learning experiences are needed to achieve the learning goal. As a consequence, the new learning rule is up to 100 times faster and in general more stable than ISO learning. Bernd Porr, Florentin Wörgötter |
Neural Comput. | 1 |
| 2005 | Self-stabilized biped walking under control of a novel reflexive networkabstractBiologically inspired reflexive controllers have been implemented on various walking robots. However, due to the natural instability of biped walking, up to date, there has not existed a biped robot that depends exclusively on reflexive controllers for its dynamically stable walking control. In this paper, we present our design and experiments of a planar biped robot under control of a pure reflexive controller that includes only local extensor and flexor reflexes (no any other reflexes for explicit stability control). The reflexive controller is built with biologically inspired stretch receptors and model neurons. It requires fewer phasic feedbacks than those reflexive controllers of multilegged robots, and does not employ any kind of position or velocity control algorithm even on its low level. Instead, the approximate property of this reflexive controller has allowed our biped robot to substantially exploit its own passive dynamics in some stages of its walking gait cycle. Due to the interaction of the reflexive controller and the properly designed mechanics of the robot, the biped robot works as a closely coupled neuromechanical system, and demonstrates self-stabilizing property in the experiments of slightly perturbed walking, shallow slope walking, and various speed walking. Moreover, our biped robot can walk stably at a relatively high speed (nearly three leg-lengths per second). We know of no other biped robots that could attain such a high relative speed. Tao Geng, Bernd Porr, Florentin Wörgötter |
IROS | 2 |
| 2005 | Fast biped walking with a reflexive controller and real-time policy searchingabstractIn this paper, we present our design and experiments of a planar biped robot ("RunBot") under pure reflexive neuronal control. The goal of this study is to combine neuronal mechanisms with biomechanics to obtain very fast speed and the on-line learning of circuit parameters. Our controller is built with biologically inspired sensor- and motor-neuron models, including local reflexes and not employing any kind of position or trajectory-tracking control algorithm. Instead, this reflexive controller allows RunBot to exploit its own natural dynamics during critical stages of its walking gait cycle. To our knowledge, this is the first time that dynamic biped walking is achieved using only a pure reflexive controller. In addition, this structure allows using a policy gradient reinforcement learning algorithm to tune the parameters of the reflexive controller in real-time during walking. This way RunBot can reach a relative speed of 3.5 leg-lengths per second after a few minutes of online learning, which is faster than that of any other biped robot, and is also comparable to the fastest relative speed of human walking. In addition, the stability domain of stable walking is quite large supporting this design strategy. Tao Geng, Bernd Porr, Florentin Wörgötter |
NIPS | 2 |
| 2005 | Temporally changing synaptic plasticityabstractRecent experimental results suggest that dendritic and back-propagating spikes can influence synaptic plasticity in different ways [1]. In this study we investigate how these signals could temporally interact at dendrites leading to changing plasticity properties at local synapse clusters. Similar to a previous study [2], we employ a differential Hebbian plasticity rule to emulate spike-timing dependent plasticity. We use dendritic (D-) and back-propagating (BP-) spikes as post-synaptic signals in the learning rule and investigate how their interaction will influence plasticity. We will analyze a situation where synapse plasticity characteristics change in the course of time, depending on the type of post-synaptic activity momentarily elicited. Starting with weak synapses, which only elicit local D-spikes, a slow, unspecific growth process is induced. As soon as the soma begins to spike this process is replaced by fast synaptic changes as the consequence of the much stronger and sharper BP-spike, which now dominates the plasticity rule. This way a winner-take-all-mechanism emerges in a two-stage process, enhancing the best-correlated inputs. These results suggest that synaptic plasticity is a temporal changing process by which the computational properties of dendrites or complete neurons can be substantially augmented. Minija Tamosiunaite, Bernd Porr, Florentin Wörgötter |
NIPS | 2 |
| 2005 | Temporal Sequence Learning, Prediction, and Control: A Review of Different Models and Their Relation to Biological MechanismsabstractIn this review, we compare methods for temporal sequence learning (TSL) across the disciplines machine-control, classical conditioning, neuronal models for TSL as well as spike-timing-dependent plasticity (STDP). This review introduces the most influential models and focuses on two questions: To what degree are reward-based (e.g., TD learning) and correlation-based (Hebbian) learning related? and How do the different models correspond to possibly underlying biological mechanisms of synaptic plasticity? We first compare the different models in an open-loop condition, where behavioral feedback does not alter the learning. Here we observe that reward-based and correlation-based learning are indeed very similar. Machine control is then used to introduce the problem of closed-loop control (e.g., actor-critic architectures). Here the problem of evaluative (rewards) versus nonevaluative (correlations) feedback from the environment will be discussed, showing that both learning approaches are fundamentally different in the closed-loop condition. In trying to answer the second question, we compare neuronal versions of the different learning architectures to the anatomy of the involved brain structures (basal-ganglia, thalamus, and cortex) and the molecular biophysics of glutamatergic and dopaminergic synapses. Finally, we discuss the different algorithms used to model STDP and compare them to reward-based learning rules. Certain similarities are found in spite of the strongly different timescales. Here we focus on the biophysics of the different calcium-release mechanisms known to be involved in STDP. Florentin Wörgötter, Bernd Porr |
Neural Comput. | 2 |
| 2004 | How the Shape of Pre- and Postsynaptic Signals Can Influence STDP: A Biophysical ModelabstractSpike-timing-dependent plasticity (STDP) is described by long-term potentiation (LTP), when a presynaptic event precedes a postsynaptic event, and by long-term depression (LTD), when the temporal order is reversed. In this article, we present a biophysical model of STDP based on a differential Hebbian learning rule (ISO learning). This rule correlates presynaptically the NMDA channel conductance with the derivative of the membrane potential at the synapse as the postsynaptic signal. The model is able to reproduce the generic STDP weight change characteristic. We find that (1) The actual shape of the weight change curve strongly depends on the NMDA channel characteristics and on the shape of the membrane potential at the synapse. (2) The typical antisymmetrical STDP curve (LTD and LTP) can become similar to a standard Hebbian characteristic (LTP only) without having to change the learning rule. This occurs if the membrane depolarization has a shallow onset and is long lasting. (3) It is known that the membrane potential varies along the dendrite as a result of the active or passive backpropagation of somatic spikes or because of local dendritic processes. As a consequence, our model predicts that learning properties will be different at different locations on the dendritic tree. In conclusion, such site-specific synaptic plasticity would provide a neuron with powerful learning capabilities. Ausra Saudargiene, Bernd Porr, Florentin Wörgötter |
Neural Comput. | 2 |
| 2003 | Analytical Solution of Spike-timing Dependent Plasticity Based on Synaptic BiophysicsabstractSpike timing plasticity (STDP) is a special form of synaptic plasticity where the relative timing of post- and presynaptic activity determines the change of the synaptic weight. On the postsynaptic side, active back- propagating spikes in dendrites seem to play a crucial role in the induc- tion of spike timing dependent plasticity. We argue that postsynaptically the temporal change of the membrane potential determines the weight change. Coming from the presynaptic side induction of STDP is closely related to the activation of NMDA channels. Therefore, we will calculate analytically the change of the synaptic weight by correlating the deriva- tive of the membrane potential with the activity of the NMDA channel. Thus, for this calculation we utilise biophysical variables of the physi- ological cell. The final result shows a weight change curve which con- forms with measurements from biology. The positive part of the weight change curve is determined by the NMDA activation. The negative part of the weight change curve is determined by the membrane potential change. Therefore, the weight change curve should change its shape de- pending on the distance from the soma of the postsynaptic cell. We find temporally asymmetric weight change close to the soma and temporally symmetric weight change in the distal dendrite. Bernd Porr, Ausra Saudargiene, Florentin Wörgötter |
NIPS | 1 |
| 2003 | ISO Learning Approximates a Solution to the Inverse-Controller Problem in an Unsupervised Behavioral ParadigmabstractIn "Isotropic Sequence Order Learning" (pp. 831-864 in this issue), we introduced a novel algorithm for temporal sequence learning (ISO learning). Here, we embed this algorithm into a formal nonevaluating (teacher free) environment, which establishes a sensor-motor feedback. The system is initially guided by a fixed reflex reaction, which has the objective disadvantage that it can react only after a disturbance has occurred. ISO learning eliminates this disadvantage by replacing the reflex-loop reactions with earlier anticipatory actions. In this article, we analytically demonstrate that this process can be understood in terms of control theory, showing that the system learns the inverse controller of its own reflex. Thereby, this system is able to learn a simple form of feedforward motor control. Bernd Porr, Christian von Ferber, Florentin Wörgötter |
Neural Comput. | 1 |
| 2003 | Isotropic Sequence Order LearningabstractIn this article, we present an isotropic unsupervised algorithm for temporal sequence learning. No special reward signal is used such that all inputs are completely isotropic. All input signals are bandpass filtered before converging onto a linear output neuron. All synaptic weights change according to the correlation of bandpass-filtered inputs with the derivative of the output. We investigate the algorithm in an open- and a closed-loop condition, the latter being defined by embedding the learning system into a behavioral feedback loop. In the open-loop condition, we find that the linear structure of the algorithm allows analytically calculating the shape of the weight change, which is strictly heterosynaptic and follows the shape of the weight change curves found in spike-time-dependent plasticity. Furthermore, we show that synaptic weights stabilize automatically when no more temporal differences exist between the inputs without additional normalizing measures. In the second part of this study, the algorithm is is placed in an environment that leads to closed sensor-motor loop. To this end, a robot is programmed with a prewired retraction reflex reaction in response to collisions. Through isotropic sequence order (ISO) learning, the robot achieves collision avoidance by learning the correlation between his early range-finder signals and the later occurring collision signal. Synaptic weights stabilize at the end of learning as theoretically predicted. Finally, we discuss the relation of ISO learning with other drive reinforcement models and with the commonly used temporal difference learning algorithm. This study is followed up by a mathematical analysis of the closed-loop situation in the companion article in this issue, "ISO Learning Approximates a Solution to the Inverse-Controller Problem in an Unsupervised Behavioral Paradigm" (pp. 865-884). Bernd Porr, Florentin Wörgötter |
Neural Comput. | 1 |
| 2002 | Learning a Forward Model of a ReflexabstractWe develop a systems theoretical treatment of a behavioural system that interacts with its environment in a closed loop situation such that its mo- tor actions influence its sensor inputs. The simplest form of a feedback is a reflex. Reflexes occur always “too late”; i.e., only after a (unpleas- ant, painful, dangerous) reflex-eliciting sensor event has occurred. This defines an objective problem which can be solved if another sensor input exists which can predict the primary reflex and can generate an earlier reaction. In contrast to previous approaches, our linear learning algo- rithm allows for an analytical proof that this system learns to apply feed- forward control with the result that slow feedback loops are replaced by their equivalent feed-forward controller creating a forward model. In other words, learning turns the reactive system into a pro-active system. By means of a robot implementation we demonstrate the applicability of the theoretical results which can be used in a variety of different areas in physics and engineering. Bernd Porr, Florentin Wörgötter |
NIPS | 1 |
| 2002 | A VLSI-Compatible Computer Vision Algorithm for Stereoscopic Depth Analysis in Real-Time
Bernd Porr, Bernd Nürenberg, Florentin Wörgötter |
Int. J. Comput. Vis. | 1 |
| 2002 | Predictive learning in rate-coded neuronal networks: a theoretical approach towards classical conditioning
Bernd Porr, Florentin Wörgötter |
Neurocomputing | 1 |
| 2001 | Temporal Hebbian Learning in Rate-Coded Neural Networks: A Theoretical Approach towards Classical Conditioning
Bernd Porr, Florentin Wörgötter |
ICANN | 1 |