Papers › CrossQ: Batch Normalization in Deep Reinforcement Learning for Greater Sample...

CrossQ: Batch Normalization in Deep Reinforcement Learning for Greater Sample Efficiency and Simplicity

14 Feb 2019arXiv:1902.05605archive 2025-07-28

Aditya Bhatt, Daniel Palenicek, Boris Belousov, Max Argus, Artemij Amiranashvili, Thomas Brox, Jan Peters

Sample efficiency is a crucial problem in deep reinforcement learning. Recent algorithms, such as REDQ and DroQ, found a way to improve the sample efficiency by increasing the update-to-data (UTD) ratio to 20 gradient update steps on the critic per environment sample. However, this comes at the expense of a greatly increased computational cost. To reduce this computational burden, we introduce CrossQ: A lightweight algorithm for continuous control tasks that makes careful use of Batch Normalization and removes target networks to surpass the current state-of-the-art in sample efficiency while maintaining a low UTD ratio of 1. Notably, CrossQ does not rely on advanced bias-reduction schemes used in current methods. CrossQ's contributions are threefold: (1) it matches or surpasses current state-of-the-art methods in terms of sample efficiency, (2) it substantially reduces the computational cost compared to REDQ and DroQ, (3) it is easy to implement, requiring just a few lines of code on top of SAC.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

adityab/crossq officialmentioned in paperjaxNOASSERTIONSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous control (arXiv:2405.16158; that paper's own run record: 11 ran (of which 7 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified); nothing checks that they implement this paper's method. report
markub3327/rl-toolkit mentioned on GitHubtfMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Smooth Exploration for Robotic Reinforcement Learning (arXiv:2005.05719; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
DLR-RM/stable-baselines3 pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Hyperparameter Trajectory Inference with Conditional Lagrangian Optimal Transport (arXiv:2603.01771; that paper's own run record: 6 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
Ipsedo/EvoMotion pytorchSyntology: not harvested report
araffin/sbx jaxSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to SimBa: Simplicity Bias for Scaling Up Parameters in Deep Reinforcement Learning (arXiv:2410.09754; that paper's own run record: 6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Continuous ControlDeep Reinforcement LearningReinforcement LearningReinforcement Learning (RL)continuous-controlreinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdamBatch NormalizationClipped Double Q-learningConvolutionDDPGDense ConnectionsExperience ReplayReLUTD3Target Policy SmoothingWeight Decay

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections