Methods › Reinforcement Learning › Reinforcement Learning Frameworks › POMO

POMO

6 papers tagged archive 2025-07-28

Introduced by Yeong-Dae Kwon et al. in POMO: Policy Optimization with Multiple Optima for Reinforcement Learning

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

The archive carries no description for this method.

PaperSource

In Syntology verified reference implementation at level V3; retrieve with get_reference_implementation(name='POMO'). This answer is about arXiv:2010.16011, the paper the archive credits with this method.

Origin paper of this answer, arXiv:2010.16011 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified (of 8 harvested samples) · 8 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.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

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

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

Page 1 of 1: papers 1 to 6 of 6, 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

11 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
Combinatorial Optimization4
Reinforcement Learning3
reinforcement-learning3
Deep Reinforcement Learning2
Reinforcement Learning (RL)2
Benchmarking1
Computational Efficiency1
Evolutionary Algorithms1
Management1
Navigate1
Traveling Salesman Problem1

Usage over time archive 2025-07-28

Papers per year tagged with POMO: 2020 to 2025, peak 2 2 0 2020: 1 paper 2020 2021: 0 papers 2021 2022: 1 paper 2022 2023: 2 papers 2023 2024: 0 papers 2024 2025: 2 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (6 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

Reinforcement Learning Frameworks

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