atlas

Research map / Reinforcement learning / Visual and representation RL

Going Beyond Heuristics by Imposing Policy Improvement as a Constraint

NeurIPS 2024 · Reinforcement learning › Visual and representation RL · approach: In-context and adaptive RL · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes HEPO, a constrained policy optimization method that trains a policy with task and heuristic rewards under the constraint that its task return is at least that of a heuristic-only policy, implemented on PPO.

Problem

Heuristic rewards speed up RL but bias policies and cause reward hacking; existing policy-invariance methods (PBRS) guarantee unbiasedness but do not improve task performance and need careful tuning of the task/heuristic trade-off.

Approach

Replace policy invariance with a policy-improvement constraint J(pi) >= J(pi_H) over the heuristic-trained policy, solved via Lagrangian min-max; the multiplier alpha reweights task reward adaptively, and both policies are trained concurrently on shared trajectories with PPO.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use HEPO instead of H-only with benchmark heuristic rewardsPPO on Isaac and Bi-Dex tasks · Isaac + Bi-Dex, 29 tasksprobability of improvement over H-only: 62%Helped
Use HEPO instead of J-onlyPPO on Isaac and Bi-Dex tasks · Isaac + Bi-Dex, 29 tasksIQM normalized returnHelped
Use HEPO instead of J+HPPO on Isaac and Bi-Dex tasks · Isaac + Bi-Dex, 29 tasksIQM normalized returnHelped
Use HEPO instead of PBRSPPO on Isaac and Bi-Dex tasks · Isaac + Bi-Dex, 29 taskstask returnHelped
Use HEPO instead of EIPOPPO on Isaac and Bi-Dex tasks · Isaac + Bi-Dex, 29 taskstask returnHelped
Use HEPO instead of HuRLPPO on Isaac and Bi-Dex tasks · Isaac + Bi-Dex, 29 taskstask returnHelped
Use HEPO rather than H-only with non-expert-designed heuristicsPPO on FrankaCabinet · FrankaCabinet, 12 human-designed heuristicsIQM normalized return: 0.44 (0.37, 0.52) -> 0.94 (0.85, 1.03)Helped
Use HEPO rather than H-only with non-expert-designed heuristicsPPO on FrankaCabinet · FrankaCabinet, 12 human-designed heuristicsprobability of improvement over H-only: 0.50 (0.49, 0.51) -> 0.73 (0.73, 0.74)Helped
Set the constraint reference policy to J-only rather than H-only (ablation)HEPO · Ant, FrankaCabinet, and AllegroHandtask returnHurt
Collect trajectories with an alternating policy rather than jointly from both policies (ablation)HEPO · Ant, FrankaCabinet, and AllegroHandtask returnHurt
Vary the heuristic-reward coefficient across a wide range (ablation)HEPO · Ant, FrankaCabinet, and AllegroHandtask returnNo clear effect
Vary the initial value of the Lagrangian multiplier (ablation)HEPO · Ant, FrankaCabinet, and AllegroHandtask returnNo clear effect

Surprising findings

Limitations

Experimental setup

Datasets: IsaacGym tasks (9) Bi-DexHands tasks (20)

Benchmarks: IsaacGym Bi-DexHands

Metrics: interquartile mean of normalized return probability of improvement task return

Baselines: H-only J-only J+H PBRS HuRL EIPO

Builds on: PPO EIPO potential-based reward shaping HuRL generalized advantage estimation

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy