Furong Huang, Yanchao Sun, Yongyuan Liang, Xiangyu Liu, Chenghao Deng
None of the 2 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (2 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/2402.12673.json · badge: /api/ran/2402.12673.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.
| Repository | Role | Ran |
|---|---|---|
| umd-huang-lab/protected | marked official in Papers with Code Papers with Code archive |
0 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| robust_ppo_step | Not yet run unverified (harvested, no recorded run) |
umd-huang-lab/protected/policy_gradients/steps.py pointer only (licence: NONE) · get_code("a41b550a8ff5fe84") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, umd-huang-lab/protected when it was checked. 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. |
| value_step | Not yet run unverified (harvested, no recorded run) |
umd-huang-lab/protected/policy_gradients/steps.py pointer only (licence: NONE) · get_code("ceb1c5e7ed63f591") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, umd-huang-lab/protected when it was checked. 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. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 0 later) and 1 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| robust_ppo_step brick of this paper's assembly: entry |
1 other paper 1 dated earlier |
2101.08452 (2021-01) Robust Reinforcement Learning on State Observations with Learned Optimal Adversary |
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.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In light of the burgeoning success of reinforcement learning (RL) in diverse realworld applications, considerable focus has been directed towards ensuring RL policies are robust to adversarial attacks during test time. Current approaches largely revolve around solving a minimax problem to prepare for potential worstcase scenarios. While effective against strong attacks, these methods often compromise performance in the absence of attacks or the presence of only weak attacks. To address this, we study policy robustness under the well-accepted stateadversarial attack model, extending our focus beyond only worst-case attacks. We first formalize this task at test time as a regret minimization problem and establish its intrinsic hardness in achieving sublinear regret when the baseline policy is from a general continuous policy class, Π. This finding prompts us to refine the baseline policy class Π prior to test time, aiming for efficient adaptation within a finite policy class Π, which can resort to an adversarial bandit subroutine. In light of the importance of a small, finite Π, we propose a novel training-time algorithm to iteratively discover non-dominated policies, forming a near-optimal and minimal Π, thereby ensuring both robustness and test-time efficiency. Empirical validation on the Mujoco corroborates the superiority of our approach in terms of natural and robust performance, as well as adaptability to various attack scenarios.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.12673")
get_code_for_paper("2402.12673")
have("2402.12673")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2402.12673.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2402.12673)
Connect an agent — have() is free.