[KongchangAI]
ConceptReinforcement Learning with Decomposed Subtasks

RLDS

A reinforcement learning method that improves credit assignment by decomposing trajectory rewards along subtask dimensions. Its core component, the Subtask Decomposition Advantage Estimator (SDAE), replaces the scalar GRPO advantage function to provide more precise token-level gradient signals.

Timeline (last 90 days)

Sep 24

For tasks with homogeneous skill composition and relatively dense feedback, the value of fine-grained reward decomposition is limited.

Unverified50%
Sep 24

An arXiv paper proposes the RLDS (Reinforcement Learning with Decomposed Subtasks) method, whose core argument is that trajectory rewards should be decomposed along the subtask dimension before entering the policy update.

Unverified50%
Sep 24

The core component of RLDS is the Subtask-Decomposed Advantage Estimation (SDAE), designed as a replacement for the scalar GRPO advantage function.

Unverified50%
Sep 24

The authors evaluated RLDS on four agent benchmarks: FrozenLake, HotpotQA, ScienceWorld, and DeepResearch.

Unverified50%
Sep 24

RLDS achieved an improvement of +11.5 points on ScienceWorld (95% confidence interval [+9.8, +13.3]) and +9.8 points on FrozenLake ([+7.0, +12.8]).

Unverified50%
Sep 24

The improvements of RLDS on HotpotQA and DeepResearch fall within the noise range, consistent with the diagnostic prediction that these two tasks have limited recoverable information.

Unverified50%
Sep 24

The gains from RLDS are amplified as subtask heterogeneity increases, with the most significant improvements on high-heterogeneity tasks.

Unverified50%
Sep 24

RLDS reduces wall-clock time per step on ScienceWorld by 10.9% compared to scalar GRPO, because long trajectories amortize the fixed overhead of reflection and scoring.

Unverified50%
Aug 29

RLDS(Reinforcement Learning Datasets)是Google DeepMind提出的基于TFRecord的标准化格式,用于存储强化学习和机器人学习的交互数据

Unverified50%

All Facts (9)

Unverified

For tasks with homogeneous skill composition and relatively dense feedback, the value of fine-grained reward decomposition is limited.

50%
Unverified

An arXiv paper proposes the RLDS (Reinforcement Learning with Decomposed Subtasks) method, whose core argument is that trajectory rewards should be decomposed along the subtask dimension before entering the policy update.

50%
Unverified

The core component of RLDS is the Subtask-Decomposed Advantage Estimation (SDAE), designed as a replacement for the scalar GRPO advantage function.

50%
Unverified

The authors evaluated RLDS on four agent benchmarks: FrozenLake, HotpotQA, ScienceWorld, and DeepResearch.

50%
Unverified

RLDS achieved an improvement of +11.5 points on ScienceWorld (95% confidence interval [+9.8, +13.3]) and +9.8 points on FrozenLake ([+7.0, +12.8]).

50%
Unverified

The improvements of RLDS on HotpotQA and DeepResearch fall within the noise range, consistent with the diagnostic prediction that these two tasks have limited recoverable information.

50%
Unverified

The gains from RLDS are amplified as subtask heterogeneity increases, with the most significant improvements on high-heterogeneity tasks.

50%
Unverified

RLDS reduces wall-clock time per step on ScienceWorld by 10.9% compared to scalar GRPO, because long trajectories amortize the fixed overhead of reflection and scoring.

50%
Unverified

RLDS(Reinforcement Learning Datasets)是Google DeepMind提出的基于TFRecord的标准化格式,用于存储强化学习和机器人学习的交互数据

50%

Source Articles