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

Théo Vincent, Yogesh Tripathi, Tim Faust, Yaniv Oren, Jan Peters +1 more
6/4/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

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, target networks notoriously require additional memory and delay the propagation of Bellman updates compared to an ideal target-free approach. In this work, we step out of the binary choice between target-free and target-based algorithms. We introduce a new method that uses a copy of the last linear layer of the online network as a target network, while sharing the remaining parameters with the up-to-date online network. This simple modification enables us to keep the target-free's low-memory footprint while leveraging the target-based literature. We find that combining our approach with the concept of iterated Q-learning, which consists of learning consecutive Bellman updates in parallel, helps improve the sample-efficiency of target-free approaches. Our proposed method, iterated Shared Q-Learning (iS-QL), bridges the performance gap between target-free and target-based approaches across various problems, while using a single Q-network, thus being a step forward towards resource-efficient reinforcement learning algorithms.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{vincent2025bridging,
  title  = {Bridging the Performance Gap Between Target-Free and Target-Based Reinforcement Learning},
  author = {Théo Vincent and Yogesh Tripathi and Tim Faust and Yaniv Oren and Jan Peters and Carlo D'Eramo},
  year   = {2025},
  eprint = {2506.04398},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.04398v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.04398.svg)](https://codeofpaper.com/paper/2506.04398)

Discussion