SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2310.14550 · 2023

Corruption-Robust Offline Reinforcement Learning with General Function Approximation

arXiv · PDF · Open in the Atlas

Code that ran

3 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 0 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/2310.14550.json · badge: /api/ran/2310.14550.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
yangrui2015/uwmsg canonical (classifier label)
classifier basis: census
3 ran · 0 no recorded run
FunctionStatusWhere it lives
asdict Ran
ran; our contract draft was wrong, not the code
yangrui2015/uwmsg/UWMSG.py
pointer only (licence: NONE); the stored copy get_code serves, from YangRui2015/RIQL, is pointer only (licence: NONE) · get_code("b7c0c6c1a8acecf2")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, yangrui2015/uwmsg 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. A run is recorded.

eval_actor Ran
ran, honoured the contract we drafted
yangrui2015/uwmsg/UWMSG.py
pointer only (licence: NONE) · get_code("433fa11651ba0f09")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, yangrui2015/uwmsg 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. A run is recorded.

wrap_env Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
yangrui2015/uwmsg/UWMSG.py
pointer only (licence: NONE) · get_code("4dd56ecf0f797666")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, yangrui2015/uwmsg 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. A run is 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 (2 with at least one paper dated earlier, 1 the same month, 2 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
wrap_env 6 other papers
2 dated earlier, 4 later
2305.09836 (2023-05)
Revisiting the Minimalist Approach to Offline Reinforcement Learning
2309.16973 (2023-09)
Towards Robust Offline-to-Online Reinforcement Learning via Uncertainty and Smoothness
2405.06192 (2024-05)
Contrastive Representation for Data Filtering in Cross-Domain Offline Reinforcement Learning
and 3 more not named here
eval_actor 2 other papers
1 dated earlier, 1 later
2309.16973 (2023-09)
Towards Robust Offline-to-Online Reinforcement Learning via Uncertainty and Smoothness
2405.16907 (2024-05)
GTA: Generative Trajectory Augmentation with Guidance for Offline Reinforcement Learning
asdict 1 other paper
1 the same month
2310.12955 (2023-10)
Towards Robust Offline Reinforcement Learning under Diverse Data Corruption

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

We investigate the problem of corruption robustness in offline reinforcement learning (RL) with general function approximation, where an adversary can corrupt each sample in the offline dataset, and the corruption level $ζ\geq0$ quantifies the cumulative corruption amount over $n$ episodes and $H$ steps. Our goal is to find a policy that is robust to such corruption and minimizes the suboptimality gap with respect to the optimal policy for the uncorrupted Markov decision processes (MDPs). Drawing inspiration from the uncertainty-weighting technique from the robust online RL setting \citep{he2022nearly,ye2022corruptionrobust}, we design a new uncertainty weight iteration procedure to efficiently compute on batched samples and propose a corruption-robust algorithm for offline RL. Notably, under the assumption of single policy coverage and the knowledge of $ζ$, our proposed algorithm achieves a suboptimality bound that is worsened by an additive factor of $\mathcal{O}(ζ(C(\widehat{\mathcal{F}},μ)n)^{-1})$ due to the corruption. Here $\widehat{\mathcal{F}}$ is the confidence set, and the dataset $\mathcal{Z}_n^H$, and $C(\widehat{\mathcal{F}},μ)$ is a coefficient that depends on $\widehat{\mathcal{F}}$ and the underlying data distribution $μ$. When specialized to linear MDPs, the corruption-dependent error term reduces to $\mathcal{O}(ζd n^{-1})$ with $d$ being the dimension of the feature map, which matches the existing lower bound for corrupted linear MDPs. This suggests that our analysis is tight in terms of the corruption-dependent term.

For agents

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

get_harvested_code_for_paper("2310.14550")
get_code_for_paper("2310.14550")
have("2310.14550")

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

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

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

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

Connect an agent — have() is free.