Methods › Reinforcement Learning › Policy Gradient Methods › MDPO
Mirror Descent Policy Optimization
MDPO
Introduced by Manan Tomar et al. in Mirror Descent Policy Optimization
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Mirror Descent Policy Optimization (MDPO) is a policy gradient algorithm based on the idea of iteratively solving a trust-region problem that minimizes a sum of two terms: a linearization of the standard RL objective function and a proximity term that restricts two consecutive updates to be close to each other. It is based on Mirror Descent, which is a general trust region method that attempts to keep consecutive iterates close to each other.
In Syntology about another paper, arXiv:2406.11839: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). About another paper: this answer is about arXiv:2406.11839, while the archive credits arXiv:2005.09814.
Origin paper of this answer, arXiv:2406.11839 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified (of 10 harvested samples) · 10 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.
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: 4 · with a code link: 2 · 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 4 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 4 of 4, 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.
-
Fast Convergence of Softmax Policy Mirror Ascent 18 Nov 2024 · 0 repositories · arXiv:2411.12042
-
mDPO: Conditional Preference Optimization for Multimodal Large Language Models 17 Jun 2024 · 1 repository · arXiv:2406.11839Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified (of 10 harvested samples) · 10 pointer-only (licence)
-
Model-Based Decentralized Policy Optimization 16 Feb 2023 · 0 repositories · arXiv:2302.08139
-
Mirror Descent Policy Optimization 20 May 2020 · 1 repository · arXiv:2005.09814
Tasks archive 2025-07-28
9 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Continuous Control | 1 |
| Hallucination | 1 |
| Language Modeling | 1 |
| Language Modelling | 1 |
| Large Language Model | 1 |
| MuJoCo | 1 |
| Reinforcement Learning (RL) | 1 |
| continuous-control | 1 |
| model | 1 |
Usage over time archive 2025-07-28
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
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