activity
20192026
most citedSharing Knowledge in Multi-Task Deep Reinforcement Learning

62 citations · 126 across the 27 of their papers we have counts for

collaborators
Showing cs.LGShow all

24 papers · 1 filter

cs.LG2026

Continual Graph Multi-Agent Reinforcement Learning

Tommaso Marzi, Ahmed Hendawy, Jan Peters +3

In Continual Multi-Agent Reinforcement Learning (CMARL), agents learn cooperative policies across sequences of tasks, aiming to adapt effectively to new tasks while preserving the…

cs.LG2026

Do Not Imitate, Reinforce: Iterative Classification via Belief Refinement

Mahdi Kallel, Johannes Tölle, Ahmed Hendawy +1

Standard supervised classification trains models to imitate the exact labels provided by a perfect oracle. This imitation happens in a single pass, restricting the model to a fixed…

cs.LG2026

Gradient Iterated Temporal-Difference Learning

Théo Vincent, Kevin Gerhardt, Yogesh Tripathi +5

Temporal-difference (TD) learning is highly effective at controlling and evaluating an agent's long-term outcomes. Most approaches in this paradigm implement a semi-gradient update…

cs.LG2025

Use the Online Network If You Can: Towards Fast and Stable Reinforcement Learning

Ahmed Hendawy, Henrik Metternich, Théo Vincent +3

The use of target networks is a popular approach for estimating value functions in deep Reinforcement Learning (RL). While effective, the target network remains a compromise soluti…

cs.LG2025

-Level Policy Gradients for Multi-Agent Reinforcement Learning

Aryaman Reddi, Gabriele Tiboni, Jan Peters +1

Actor-critic algorithms for deep multi-agent reinforcement learning (MARL) typically employ a policy update that responds to the current strategies of other agents. While being str…

cs.LG2025

Bridging the Performance Gap Between Target-Free and Target-Based Reinforcement Learning

Théo Vincent, Yogesh Tripathi, Tim Faust +5

The use of target networks in deep reinforcement learning is a widely popular solution to mitigate the brittleness of semi-gradient approaches and stabilize learning. However, targ…

cs.LG2025

Eau De -Network: Adaptive Distillation of Neural Networks in Deep Reinforcement Learning

Théo Vincent, Tim Faust, Yogesh Tripathi +2

Recent works have successfully demonstrated that sparse deep reinforcement learning agents can be competitive against their dense counterparts. This opens up opportunities for rein…

cs.LG2024

Deterministic Exploration via Stationary Bellman Error Maximization

Sebastian Griesbach, Carlo D'Eramo

Exploration is a crucial and distinctive aspect of reinforcement learning (RL) that remains a fundamental open problem. Several methods have been proposed to tackle this challenge.…

cs.LG2024★ 2 cited

Machine Learning with Physics Knowledge for Prediction: A Survey

Joe Watson, Chen Song, Oliver Weeger +12

This survey examines the broad suite of methods and models for combining machine learning with physics knowledge for prediction and forecast, with a focus on partial differential e…

cs.LG2024

Augmented Bayesian Policy Search

Mahdi Kallel, Debabrota Basu, Riad Akrour +1

Deterministic policies are often preferred over stochastic ones when implemented on physical systems. They can prevent erratic and harmful behaviors while being easier to implement…

cs.LG2024

Adaptive -Network: On-the-fly Target Selection for Deep Reinforcement Learning

Théo Vincent, Fabian Wahren, Jan Peters +2

Deep Reinforcement Learning (RL) is well known for being highly sensitive to hyperparameters, requiring practitioners substantial efforts to optimize them for the problem at hand.…

cs.LG2024

Iterated -Network: Beyond One-Step Bellman Updates in Deep Reinforcement Learning

Théo Vincent, Daniel Palenicek, Boris Belousov +2

The vast majority of Reinforcement Learning methods is largely impacted by the computation effort and data requirements needed to obtain effective estimates of action-value functio…

cs.LG2024★ 62 cited

Sharing Knowledge in Multi-Task Deep Reinforcement Learning

Carlo D'Eramo, Davide Tateo, Andrea Bonarini +2

We study the benefit of sharing representations among tasks to enable the effective use of deep neural networks in Multi-Task Reinforcement Learning. We leverage the assumption tha…

cs.LG2023★ 1 cited

Parameterized Projected Bellman Operator

Théo Vincent, Alberto Maria Metelli, Boris Belousov +3

Approximate value iteration (AVI) is a family of algorithms for reinforcement learning (RL) that aims to obtain an approximation of the optimal value function. Generally, AVI algor…

cs.LG2023★ 1 cited

Robust Adversarial Reinforcement Learning via Bounded Rationality Curricula

Aryaman Reddi, Maximilian Tölle, Jan Peters +2

Robustness against adversarial attacks and distribution shifts is a long-standing goal of Reinforcement Learning (RL). To this end, Robust Adversarial Reinforcement Learning (RARL)…

cs.LG2023★ 3 cited

Multi-Task Reinforcement Learning with Mixture of Orthogonal Experts

Ahmed Hendawy, Jan Peters, Carlo D'Eramo

Multi-Task Reinforcement Learning (MTRL) tackles the long-standing problem of endowing agents with skills that generalize across a variety of problems. To this end, sharing represe…

cs.LG2023★ 2 cited

Domain Randomization via Entropy Maximization

Gabriele Tiboni, Pascal Klink, Jan Peters +3

Varying dynamics parameters in simulation is a popular Domain Randomization (DR) approach for overcoming the reality gap in Reinforcement Learning (RL). Nevertheless, DR heavily hi…

cs.LG2023★ 8 cited

On the Benefit of Optimal Transport for Curriculum Reinforcement Learning

Pascal Klink, Carlo D'Eramo, Jan Peters +1

Curriculum reinforcement learning (CRL) allows solving complex tasks by generating a tailored sequence of learning tasks, starting from easy ones and subsequently increasing their…

cs.LG2021

A Probabilistic Interpretation of Self-Paced Learning with Applications to Reinforcement Learning

Pascal Klink, Hany Abdulsamad, Boris Belousov +3

Across machine learning, the use of curricula has shown strong empirical potential to improve learning from data by avoiding local optima of training objectives. For reinforcement…

cs.LG2020★ 1 cited

Convex Regularization in Monte-Carlo Tree Search

Tuan Dam, Carlo D'Eramo, Jan Peters +1

Monte-Carlo planning and Reinforcement Learning (RL) are essential to sequential decision making. The recent AlphaGo and AlphaZero algorithms have shown how to successfully combine…

cs.LG2020★ 1 cited

Self-Paced Deep Reinforcement Learning

Pascal Klink, Carlo D'Eramo, Jan Peters +1

Curriculum reinforcement learning (CRL) improves the learning speed and stability of an agent by exposing it to a tailored series of tasks throughout learning. Despite empirical su…

cs.LG2020★ 1 cited

Deep Reinforcement Learning with Weighted Q-Learning

Andrea Cini, Carlo D'Eramo, Jan Peters +1

Reinforcement learning algorithms based on Q-learning are driving Deep Reinforcement Learning (DRL) research towards solving complex problems and achieving super-human performance…

cs.LG2020★ 35 cited

MushroomRL: Simplifying Reinforcement Learning Research

Carlo D'Eramo, Davide Tateo, Andrea Bonarini +2

MushroomRL is an open-source Python library developed to simplify the process of implementing and running Reinforcement Learning (RL) experiments. Compared to other available libra…

cs.LG2020★ 8 cited

Long-Term Visitation Value for Deep Exploration in Sparse Reward Reinforcement Learning

Simone Parisi, Davide Tateo, Maximilian Hensel +3

Reinforcement learning with sparse rewards is still an open challenge. Classic methods rely on getting feedback via extrinsic rewards to train the agent, and in situations where th…