Methods › Reinforcement Learning › Density Ratio Learning › GradientDICE

GradientDICE

1 paper tagged archive 2025-07-28

Introduced by Shangtong Zhang et al. in GradientDICE: Rethinking Generalized Offline Estimation of Stationary Values

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

GradientDICE is a density ratio learning method for estimating the density ratio between the state distribution of the target policy and the sampling distribution in off-policy reinforcement learning. It optimizes a different objective from GenDICE by using the Perron-Frobenius theorem and eliminating GenDICE’s use of divergence, such that nonlinearity in parameterization is not necessary for GradientDICE, which is provably convergent under linear function approximation.

PaperSource

Papers archive 2025-07-28

1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

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

TaskPapers
Reinforcement Learning1

Usage over time archive 2025-07-28

Papers per year tagged with GradientDICE: 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

Density Ratio 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