SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2511.02567 · NeurIPS · 2025

Adaptive Neighborhood-Constrained Q Learning for Offline Reinforcement Learning

Qi Wang, Xiangyang Ji, Yun Qu, Yixiu Mao

arXiv · PDF · Open in the Atlas

Code that ran

4 of 4 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; 0 honoured the contract we drafted, 0 violated it and 3 have no contract verdict; 1 failure of our instrument; 0 no recorded run), measured 2026-11-22; 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/2511.02567.json · badge: /api/ran/2511.02567.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
thu-rllab/ANQ community
Papers with Code archive
4 ran · 0 no recorded run
FunctionStatusWhere it lives
ANQ Ran
ran on a synthesized input
thu-rllab/ANQ/ANQ.py
pointer only (licence: NONE) · get_code("0eb3fda3c4865a8d")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thu-rllab/ANQ 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.

AuxiliaryActor Ran
ran on a synthesized input
thu-rllab/ANQ/ANQ.py
pointer only (licence: NONE) · get_code("2451cf631d895342")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thu-rllab/ANQ 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.

ValueCritic Ran
ran on a synthesized input
thu-rllab/ANQ/ANQ.py
pointer only (licence: NONE) · get_code("6f069c7aae92edd6")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thu-rllab/ANQ 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.

expectile_loss Ran
ran; our contract draft was wrong, not the code
thu-rllab/ANQ/ANQ.py
pointer only (licence: NONE) · get_code("aeac8b96e388243c")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thu-rllab/ANQ 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 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 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, 1 later) and 3 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
ValueCritic
brick of this paper's assembly: model
2 other papers
1 dated earlier, 1 later · 2 only as an assembly brick
2411.07934 (2024-11)
Doubly Mild Generalization for Offline Reinforcement Learning
2608.03108 (2026-08)
Convex-Hull-Neighborhood Smooth Dual Generalization: Controlling Local Correction Propagation in Offline RL

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

Offline reinforcement learning (RL) suffers from extrapolation errors induced by out-of-distribution (OOD) actions. To address this, offline RL algorithms typically impose constraints on action selection, which can be systematically categorized into density, support, and sample constraints. However, we show that each category has inherent limitations: density and sample constraints tend to be overly conservative in many scenarios, while the support constraint, though least restrictive, faces challenges in accurately modeling the behavior policy. To overcome these limitations, we propose a new neighborhood constraint that restricts action selection in the Bellman target to the union of neighborhoods of dataset actions. Theoretically, the constraint not only bounds extrapolation errors and distribution shift under certain conditions, but also approximates the support constraint without requiring behavior policy modeling. Moreover, it retains substantial flexibility and enables pointwise conservatism by adapting the neighborhood radius for each data point. In practice, we employ data quality as the adaptation criterion and design an adaptive neighborhood constraint. Building on an efficient bilevel optimization framework, we develop a simple yet effective algorithm, Adaptive Neighborhood-constrained Q learning (ANQ), to perform Q learning with target actions satisfying this constraint. Empirically, ANQ achieves state-of-the-art performance on standard offline RL benchmarks and exhibits strong robustness in scenarios with noisy or limited data. 39th Conference on Neural Information Processing Systems (NeurIPS 2025).

For agents

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

get_harvested_code_for_paper("2511.02567")
get_code_for_paper("2511.02567")
have("2511.02567")

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

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

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

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

Connect an agent — have() is free.