paper-with-me

Papers

Keeping Your Distance: Solving Sparse Reward Tasks Using Self-Balancing Shaped Rewards

2019-11-04 · NeurIPS 2019 12 · Alexander Trott, Stephan Zheng, Caiming Xiong, Richard Socher

While using shaped rewards can be beneficial when solving sparse reward tasks, their successful application often requires careful engineering and is problem specific. For instance, in tasks where the agent must achieve some goal state, simple distance-to-goal reward shaping often fails, as it renders learning vulnerable to local optima. We introduce a simple and effective model-free method to learn from shaped distance-to-goal rewards on tasks where success depends on reaching a goal state. Our method introduces an auxiliary distance-based reward based on pairs of rollouts to encourage diverse exploration. This approach effectively prevents learning dynamics from stabilizing around local optima induced by the naive distance-to-goal reward shaping and enables policies to efficiently solve sparse reward tasks. Our augmented objective does not require any additional reward engineering or domain expertise to implement and converges to the original sparse objective as the agent learns to solve the task. We demonstrate that our method successfully solves a variety of hard-exploration tasks (including maze navigation and 3D construction in a Minecraft environment), where naive distance-based reward shaping otherwise fails, and intrinsic curiosity and reward relabeling strategies exhibit poor performance.

📄 PDF Abstract BibTeX arXiv:1911.01417

Code (1)

salesforce/sibling-rivalry pytorch

Tasks

Minecraft

Similar Papers 제목 키워드 기반

Reinforcement Learning with Goal-Distance Gradient

2020-01-01 · Kai Jiang, XiaoLong Qin

Reinforcement learning usually uses the feedback rewards of environmental to train agents. But the rewards in the actual environment are sparse, and even some environments will not rewards. Most of the current methods ar…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Align Your Intents: Offline Imitation Learning via Optimal Transport

2024-02-20 · Maksim Bobrin, Nazar Buzun, Dmitrii Krylov, Dmitry V. Dylov

Offline Reinforcement Learning (RL) addresses the problem of sequential decision-making by learning optimal policy through pre-collected data, without interacting with the environment. As yet, it has remained somewhat im…

D4RLDecision MakingImitation LearningOffline RL+2

DISCOVER: Automated Curricula for Sparse-Reward Reinforcement Learning

2025-05-26 · Leander Diaz-Bone, Marco Bagatella, Jonas Hübotter, Andreas Krause

Sparse-reward reinforcement learning (RL) can model a wide range of highly complex tasks. Solving sparse-reward tasks is RL's core premise - requiring efficient exploration coupled with long-horizon credit assignment - a…

Efficient Explorationreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Driving Beyond Privilege: Distilling Dense-Reward Knowledge into Sparse-Reward Policies

2025-12-03 · Feeza Khan Khanzada, Jaerock Kwon arxiv

We study how to exploit dense simulator-defined rewards in vision-based autonomous driving without inheriting their misalignment with deployment metrics. In realistic simulators such as CARLA, privileged state (e.g., lan…

Reinforcement LearningAutonomous Driving

Zero Shot Coordination for Sparse Reward Tasks with Diverse Reward Shapings

2026-04-28 · Keenan Powell, Peihong Yu, Pratap Tokekar arxiv

Many Multi-Agent Reinforcement Learning (MARL) agents fail to adapt properly to cooperating with agents trained with the same objectives but different seeds, algorithms, or other training differences. This is the problem…

Multi-agent Reinforcement Learning