Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Julian Lemmel

dblp:323/4655 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0002-3517-2860ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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
1 paper
Reinforcement learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
biologically plausible reinforcement learning
0.912025
Real-Time Recurrent Reinforcement Learning · AAAI 2025
Machine learning › Reinforcement learning
partially observable reinforcement learning
0.912025
Real-Time Recurrent Reinforcement Learning · AAAI 2025
Machine learning › Reinforcement learning
meta-reinforcement learning
0.312025
Real-Time Recurrent Reinforcement Learning · AAAI 2025

Methods — techniques the papers use, named apart from their topics

temporal difference learning · 0.9recurrent neural network · 0.9online automatic differentiation · 0.9eligibility traces · 0.9
YearPublicationVenuePosition
2025 Real-Time Recurrent Reinforcement Learning
abstract
We introduce a biologically plausible RL framework for solving tasks in partially observable Markov decision processes (POMDPs). The proposed algorithm combines three integral parts: (1) A Meta-RL architecture, resembling the mammalian basal ganglia; (2) A biologically plausible reinforcement learning algorithm, exploiting temporal difference learning and eligibility traces to train the policy and the value-function; (3) An online automatic differentiation algorithm for computing the gradients with respect to parameters of a shared recurrent network backbone. Our experimental results show that the method is capable of solving a diverse set of partially observable reinforcement learning tasks. The algorithm we call real-time recurrent reinforcement learning (RTRRL) serves as a model of learning in biological neural networks, mimicking reward pathways in the basal ganglia.
Julian Lemmel, Radu Grosu
AAAI1
2025 Scalable Offline Reinforcement Learning for Mean Field Games
Axel Brunnbauer, Julian Lemmel, Zahra Babaiee, Sophie A. Neubauer, Radu Grosu
AAMAS2
2025 Online Fine-Tuning of Carbon Emission Predictions using Real-Time Recurrent Learning for State Space Models
Julian Lemmel, Manuel Kranzl, Adam Lamine, Philipp Neubauer, Radu Grosu, Sophie A. Neubauer
SMC1