SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2210.08153 · 2022

CUP: Critic-Guided Policy Reuse

arXiv · PDF · Open in the Atlas

Code that ran

2 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 2 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 0 failures of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2210.08153.json · badge: /api/ran/2210.08153.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
nagisazj/cup canonical (classifier label)
classifier basis not recorded on the link
2 ran · 1 no recorded run
FunctionStatusWhere it lives
np_float32 Ran
ran, honoured the contract we drafted
nagisazj/cup/mtrl/logger.py
pointer only (licence: MIT); the stored copy get_code serves, from niiceMing/CMTA, is pointer only (licence: NONE) · get_code("4ace26fa5ca4d1a4")
How it ran

The body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, nagisazj/cup, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

np_int64 Ran
ran, honoured the contract we drafted
nagisazj/cup/mtrl/logger.py
pointer only (licence: MIT); the stored copy get_code serves, from niiceMing/CMTA, is pointer only (licence: NONE) · get_code("cc77f6913f0f6c08")
How it ran

The body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, nagisazj/cup, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

serialize_log Not yet run
unverified (harvested, no recorded run)
nagisazj/cup/mtrl/logger.py
pointer only (licence: MIT); the stored copy get_code serves, from niiceMing/CMTA, is pointer only (licence: NONE) · get_code("d45df8c269288a39")
How it ran

The body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, nagisazj/cup, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
np_float32 1 other paper
1 later
2311.01075 (2023-11)
Contrastive Modules with Temporal Attention for Multi-Task Reinforcement Learning
np_int64 1 other paper
1 later
2311.01075 (2023-11)
Contrastive Modules with Temporal Attention for Multi-Task Reinforcement Learning
serialize_log 1 other paper
1 later
2311.01075 (2023-11)
Contrastive Modules with Temporal Attention for Multi-Task Reinforcement Learning

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

The ability to reuse previous policies is an important aspect of human intelligence. To achieve efficient policy reuse, a Deep Reinforcement Learning (DRL) agent needs to decide when to reuse and which source policies to reuse. Previous methods solve this problem by introducing extra components to the underlying algorithm, such as hierarchical high-level policies over source policies, or estimations of source policies' value functions on the target task. However, training these components induces either optimization non-stationarity or heavy sampling cost, significantly impairing the effectiveness of transfer. To tackle this problem, we propose a novel policy reuse algorithm called Critic-gUided Policy reuse (CUP), which avoids training any extra components and efficiently reuses source policies. CUP utilizes the critic, a common component in actor-critic methods, to evaluate and choose source policies. At each state, CUP chooses the source policy that has the largest one-step improvement over the current target policy, and forms a guidance policy. The guidance policy is theoretically guaranteed to be a monotonic improvement over the current target policy. Then the target policy is regularized to imitate the guidance policy to perform efficient policy search. Empirical results demonstrate that CUP achieves efficient transfer and significantly outperforms baseline algorithms.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2210.08153")
get_code_for_paper("2210.08153")
have("2210.08153")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2210.08153.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2210.08153.svg)](https://syntology.ai/paper/2210.08153)

Connect an agent — have() is free.