Home Projects cleanrl
cleanrl
Python

cleanrl

High-quality single file implementation of Deep Reinforcement Learning algorithms with research-friendly features (PPO, DQN, C51, DDPG, TD3, SAC, PPG)

by vwxyzjn · GitHub
Stars
Forks
Created
Last commit
Category
Language
a2cactor-criticadvantage-actor-criticPython
View on GitHub
In plain words

Run and experiment with deep reinforcement learning algorithms using a simple, single-file implementation.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
cleanrl — GitHub preview card
📈 Star history
10.12k10.07k
2026-07-042026-08-31
📈 Track cleanrl

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

High-quality single file implementation of Deep Reinforcement Learning algorithms with research-friendly features (PPO, DQN, C51, DDPG, TD3, SAC, PPG)

cleanrl has 10.1k stars on GitHub. It has been forked 1.1k times. cleanrl is written mainly in Python. It has been in active development since 2019. Its main topics are a2c, actor-critic, advantage-actor-critic, ale.

Frequently asked questions

What is cleanrl?

High-quality single file implementation of Deep Reinforcement Learning algorithms with research-friendly features (PPO, DQN, C51, DDPG, TD3, SAC, PPG)

Is cleanrl open source?

cleanrl is an open-source project.

Is cleanrl free?

Yes. cleanrl is free and open source — you can use, modify and self-host it.

What language is cleanrl written in?

cleanrl is written mainly in Python.

🏅 Maintainer of this project?
olud.ai badge — cleanrl

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=vwxyzjn-cleanrl)](https://olud.ai/project/vwxyzjn-cleanrl.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.