RLDISCOVER: LLM-driven co-evolution of reinforcement learning algorithms — AI framework

Haoran Li, Zengle Ge, Xiaomin Yuan, Yui Lo, Songlin Zhou, Jiahua Ying, Haoxin Li, Qianhui Liu, Yuanhang Liu, Jiaqun Liu, Guokai Chen, Mingju Chen, Ruinan Wang, Annan Li, Jianmin Wu, Dawei Yin, Dou Shen/RLDISCOVER: LLM-driven co-evolution of reinforcement learning algorithmsUnknown

LLM-guided program evolution has enabled discoveries in mathematics and computational optimization, raising the prospect of reinforcement learning (RL) algorithms that self-evolve to improve how agents learn. However, realizing this prospect faces two obstacles. Joint search over coupled algorithmic components is difficult to scale: simultaneous changes can disrupt learning, while isolated changes overlook their dependencies. Evaluating candidate algorithms also requires costly training, with fitness remaining uncertain across random seeds. We introduce RLDiscover, a framework for the self-evolution of model-free deep RL algorithms. Progressive Co-Evolution advances from targeted component edits to joint evolution, while Progressive Probabilistic Evaluation balances search breadth and evaluation fidelity through staged training and repeated evaluation. Experiments across SAC, PPO, and DQN on four benchmark suites show substantial improvements in mean return, with per-family median gains of 32%-84% and a peak return ratio of approximately 363x over a near-zero baseline. These gains include transitions from failed learning to successful task completion, and improvements persist when evolution starts from stronger open-source implementations. On measured SAC locomotion runs, evaluation uses approximately one-fifteenth the estimated compute required to fully evaluate the same candidate pool. Remarkably, independent searches repeatedly discover interpretable combinations of adaptive robust losses, progress-dependent value targets, and running statistics, with selected programs transferring to unseen tasks. These findings point toward a broader role for self-evolution in AI: discovering interpretable algorithms that improve how agents learn.

framework

Stars0

Forks0

HF Downloads—30d

Last commit—

Refreshed7h ago

Project healthUnknownNo activity data.

Production readinessResearch / EarlyBest for exploration and prototyping.

Risk notesUnknown licenseVerify license before production use.

AgentHub Score

55 / 100

Composite score from 6 signals. How we score →

Active project

55Score

Growth

40C

Activity

30C

Documentation

70C+

Maturity

45C

Community

42C

Production

58C

GitHub stars · 0 days observed0 not enough history

snapshots

not enough history

Repository activity · 0 days observednot enough history from pushed_at

inactivepushed

not enough history

Practical assessment

Should you use it?

✓ Best for

Multi-agent orchestration
Production agentic workflows
Stateful long-running tasks

◎ Strengths

Stable API
Active release cadence
Strong GitHub community

✕ Not ideal for

Simple single-step automation
Teams without Python/ML expertise

⚠ Watch-outs

Breaking changes between minor versions
Ecosystem lock-in if tightly coupled

Technical details

What's inside

Language—

License—

Sourcearxiv

Open source✗ No

Commercial use—

Docs—

Demo—

PaperarXiv ↗

AgentHub Score

Score 55/100

Below average

Alternatives

OccuReward: LLM-Guided Occupant-Centric Reward Shaping for Demographic Equity in Grid-Interactive Buildings

0 · framework

CHAL: Council of Hierarchical Agentic Language

0 · framework

Think Twice, Act Once: Verifier-Guided Action Selection For Embodied Agents

0 · framework

Structuring agentic AI for HPC code modernization

0 · framework

55 Compare all →

Recent activity

Latest commit ——

Indexed by AgentHub crawler7h ago

Monitor for new releasesongoing