Pith. sign in

REVIEW 2 cited by

Highly Efficient Self-Adaptive Reward Shaping for Reinforcement Learning

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 2408.03029 v4 pith:4KTZG6FV submitted 2024-08-06 cs.LG cs.AI

classification cs.LGcs.AI
keywords rewardsefficientrewardshapingbetadistributionsexploitationexploration
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Reward shaping is a technique in reinforcement learning that addresses the sparse-reward problem by providing more frequent and informative rewards. We introduce a self-adaptive and highly efficient reward shaping mechanism that incorporates success rates derived from historical experiences as shaped rewards. The success rates are sampled from Beta distributions, which dynamically evolve from uncertain to reliable values as data accumulates. Initially, the shaped rewards exhibit more randomness to encourage exploration, while over time, the increasing certainty enhances exploitation, naturally balancing exploration and exploitation. Our approach employs Kernel Density Estimation (KDE) combined with Random Fourier Features (RFF) to derive the Beta distributions, providing a computationally efficient, non-parametric, and learning-free solution for high-dimensional continuous state spaces. Our method is validated on various tasks with extremely sparse rewards, demonstrating notable improvements in sample efficiency and convergence stability over relevant baselines.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Meta-Learned Reward Shaping for Reinforcement Learning from Human Feedback

    cs.LG 2026-07 reject novelty 5.0 of 10

    Training a small multi-task reward-shaping network and adding it to the RLHF reward is claimed to improve LLaMA-3-8B alignment across four benchmarks, but the supporting theory is not established.

  2. Information-Based Exploration via Random Features for Reinforcement Learning

    cs.LG 2026-07 conditional novelty 4.0 of 10

    Random-feature Gaussian-process information gain is turned into a closed-form exploration bonus for PPO that matches RND/VIME/#Explo on 12 control, navigation, and sparse-locomotion tasks, with error bounds on the app...

Pith tools