Pith. sign in

REVIEW 1 cited by

DreamSmooth: Improving Model-based Reinforcement Learning via Reward Smoothing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.01450 v2 pith:TN5XNVKK submitted 2023-11-02 cs.LG cs.AIcs.RO

classification cs.LGcs.AIcs.RO
keywords rewarddreamsmoothperformancebenchmarkslearnlearningmbrlmodel-based
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Model-based reinforcement learning (MBRL) has gained much attention for its ability to learn complex behaviors in a sample-efficient way: planning actions by generating imaginary trajectories with predicted rewards. Despite its success, we found that surprisingly, reward prediction is often a bottleneck of MBRL, especially for sparse rewards that are challenging (or even ambiguous) to predict. Motivated by the intuition that humans can learn from rough reward estimates, we propose a simple yet effective reward smoothing approach, DreamSmooth, which learns to predict a temporally-smoothed reward, instead of the exact reward at the given timestep. We empirically show that DreamSmooth achieves state-of-the-art performance on long-horizon sparse-reward tasks both in sample efficiency and final performance without losing performance on common benchmarks, such as Deepmind Control Suite and Atari benchmarks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learn A Flexible Exploration Model for Parameterized Action Markov Decision Processes

    cs.LG 2025-01 reject novelty 4.0 of 10

    FLEXplore combines an L2 dynamics loss with a Wasserstein-style critic loss, FGSM reward smoothing, and a mutual-information auxiliary reward to improve sample efficiency in parameterized-action MDPs.

Pith tools