Papers › On Learning Intrinsic Rewards for Policy Gradient Methods

On Learning Intrinsic Rewards for Policy Gradient Methods

17 Apr 2018NeurIPS 2018 12arXiv:1804.06459archive 2025-07-28

Zeyu Zheng, Junhyuk Oh, Satinder Singh

In many sequential decision making tasks, it is challenging to design reward functions that help an RL agent efficiently learn behavior that is considered good by the agent designer. A number of different formulations of the reward-design problem, or close variants thereof, have been proposed in the literature. In this paper we build on the Optimal Rewards Framework of Singh et.al. that defines the optimal intrinsic reward function as one that when used by an RL agent achieves behavior that optimizes the task-specifying or extrinsic reward function. Previous work in this framework has shown how good intrinsic reward functions can be learned for lookahead search based planning agents. Whether it is possible to learn intrinsic reward functions for learning agents remains an open problem. In this paper we derive a novel algorithm for learning intrinsic rewards for policy-gradient based learning agents. We compare the performance of an augmented agent that uses our algorithm to provide additive intrinsic rewards to an A2C-based policy learner (for Atari games) and a PPO-based policy learner (for Mujoco domains) with a baseline agent that uses the same policy learners but with only extrinsic rewards. Our results show improved performance on most but not all of the domains.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1804.06459")

Code

Syntology Ran 2 of 10 code samples harvested from 1 repository linked to this paper; 8 have no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran with no contract checked.

By repository: official repository: 10 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Hwhitetooth/lirpg officialmentioned in papermentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 2 ran; 1 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

1ran · honoured contract
1ran
8unverified

Licence: 10 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from Hwhitetooth/lirpg. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

profile Hwhitetooth/lirpg/baselines/logger.py official repository ran MIT recorded; this copy not marked cleared · pointer only · 98948fae5be7e92e · report
safemean Hwhitetooth/lirpg/baselines/a2c/a2c.py official repository ran · honoured contract fingerprinted MIT recorded; this copy not marked cleared · pointer only · a7b323241cd70612 · report
cat_entropy Hwhitetooth/lirpg/baselines/a2c/utils.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · a3b4038f4e9b9479 · report
cat_entropy_softmax Hwhitetooth/lirpg/baselines/a2c/utils.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 7082b4bbc0d9384f · report
make_output_format Hwhitetooth/lirpg/baselines/logger.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 5eee517402b390d5 · report
read_json Hwhitetooth/lirpg/baselines/logger.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 88ef5a17fc986d9a · report
rolling_window Hwhitetooth/lirpg/baselines/results_plotter.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 895ca4b776fb6d6d · report
sample Hwhitetooth/lirpg/baselines/a2c/utils.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 178099b1f8fb2b9d · report
ts2xy Hwhitetooth/lirpg/baselines/results_plotter.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 8c5b970d902942f8 · report
window_func Hwhitetooth/lirpg/baselines/results_plotter.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 43741b9339bd80da · report

Tasks

Atari GamesDecision MakingMuJoCoPolicy Gradient MethodsSequential Decision Making

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections