Methods › Reinforcement Learning › Bayesian Reinforcement Learning › Bayesian REX

Bayesian Reward Extrapolation

Bayesian REX

1 paper tagged archive 2025-07-28

Introduced by Daniel S. Brown et al. in Safe Imitation Learning via Fast Bayesian Reward Inference from Preferences

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Bayesian Reward Extrapolation is a Bayesian reward learning algorithm that scales to high-dimensional imitation learning problems by pre-training a low-dimensional feature encoding via self-supervised tasks and then leveraging preferences over demonstrations to perform fast Bayesian inference.

PaperSource

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 1 entry in Syntology's graph carry it; the most cited is “Bayesian Reward Extrapolation (Bayesian REX)”, a method in the paper “Safe Imitation Learning via Fast Bayesian Reward Inference from Preferences” (arXiv:2002.09089, 117 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:2002.09089: its page on this site · ask the lookup about it.

Near matches the lookup lists, each a different name: Bayesian Reward Extrapolation (Bayesian REX); Rex; REX; REx; V-REx; T-Rex; t-ReX; t-ReX*.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 1 · with a code link: 1 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 1 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

3 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Atari Games1
Bayesian Inference1
Imitation Learning1

Usage over time archive 2025-07-28

Papers per year tagged with Bayesian REX: 2020 to 2020, peak 1 1 0 2020: 1 paper 2020
Papers per year the archive tags with this method, by the paper's archive date (1 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Bayesian Reinforcement Learning

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