Papers › Eureka: Human-Level Reward Design via Coding Large Language Models

Eureka: Human-Level Reward Design via Coding Large Language Models

19 Oct 2023arXiv:2310.12931archive 2025-07-28

Yecheng Jason Ma, William Liang, Guanzhi Wang, De-An Huang, Osbert Bastani, Dinesh Jayaraman, Yuke Zhu, Linxi Fan, Anima Anandkumar

Large Language Models (LLMs) have excelled as high-level semantic planners for sequential decision-making tasks. However, harnessing them to learn complex low-level manipulation tasks, such as dexterous pen spinning, remains an open problem. We bridge this fundamental gap and present Eureka, a human-level reward design algorithm powered by LLMs. Eureka exploits the remarkable zero-shot generation, code-writing, and in-context improvement capabilities of state-of-the-art LLMs, such as GPT-4, to perform evolutionary optimization over reward code. The resulting rewards can then be used to acquire complex skills via reinforcement learning. Without any task-specific prompting or pre-defined reward templates, Eureka generates reward functions that outperform expert human-engineered rewards. In a diverse suite of 29 open-source RL environments that include 10 distinct robot morphologies, Eureka outperforms human experts on 83% of the tasks, leading to an average normalized improvement of 52%. The generality of Eureka also enables a new gradient-free in-context learning approach to reinforcement learning from human feedback (RLHF), readily incorporating human inputs to improve the quality and the safety of the generated rewards without model updating. Finally, using Eureka rewards in a curriculum learning setting, we demonstrate for the first time, a simulated Shadow Hand capable of performing pen spinning tricks, adeptly manipulating a pen in circles at rapid speed.

PaperPDFCodeCode Syntology ran

In Syntology 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="2310.12931")

Code

Syntology Ran 11 of 12 code samples harvested from 2 repositories linked to this paper; 1 has no recorded run. Of those that ran: 1 ran · violated contract; 2 ran · our draft was wrong; 8 ran with no contract checked.

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

eureka-research/Eureka officialmentioned on GitHubjaxMIT 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

12 samples harvested; 11 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · violated contract
2ran · our draft was wrong
8ran
1unverified

Licence: 0 of the 12 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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.

extract_class_info eureka-research/Eureka/eureka/utils/prune_env.py official repository ran MIT (permissive) · b2430468f620777e · report
extract_observation_code eureka-research/Eureka/eureka/utils/extract_task_code.py official repository ran MIT (permissive) · ace4148116adb7ef · report
extract_task_code eureka-research/Eureka/eureka/utils/extract_task_code.py official repository ran MIT (permissive) · 7edd71cf38a4ac85 · report
file_to_string eureka-research/Eureka/eureka/utils/extract_task_code.py official repository ran MIT (permissive) · ab6795497be8743a · report
filter_traceback eureka-research/Eureka/eureka/utils/misc.py official repository ran fingerprinted MIT (permissive) · 16b43ab11204e083 · report
find_files_with_substring eureka-research/Eureka/eureka/utils/file_utils.py official repository ran fingerprinted MIT (permissive) · 7e3ca15f72ec5048 · report
import_class_from_file eureka-research/Eureka/eureka/utils/file_utils.py official repository ran MIT (permissive) · f409fbe9be3b6b98 · report
load_tensorboard_logs eureka-research/Eureka/eureka/utils/file_utils.py official repository ran MIT (permissive) · dbeca344f569e3c3 · report
depth_image_to_point_cloud_GPU eureka-research/Eureka/eureka/envs/bidex/shadow_hand_block_stack.py official repository unverified MIT (permissive) · a03f028b2da7c641 · report
extract_answer_with_tags ModalMinds/MM-EUREKA/examples/scripts/reward_func_qwen_instruct.py community ran · our draft was wrong fingerprinted Apache-2.0 (permissive) · f7bb7fab758e88c6 · report
get_query_from_query ModalMinds/MM-EUREKA/examples/scripts/reward_func_qwen_instruct.py community ran · violated contract fingerprinted Apache-2.0 (permissive) · 4dbb9ce8ca054e5a · report
get_response_from_query ModalMinds/MM-EUREKA/examples/scripts/reward_func_qwen_instruct.py community ran · our draft was wrong fingerprinted Apache-2.0 (permissive) · 621fb76355aa5e4b · report

Tasks

Decision MakingIn-Context LearningSequential Decision Makingreinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutGPT-4Label SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

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