Provably Efficient Offline Reinforcement Learning in Regular Decision Processes

Roberto Cipollone, Anders Jonsson, Alessandro Ronca, M. S. Talebi
2/12/2026

No confident code implementation found for this paper. 3 possible matches can be shown below.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Manifold Constraint Reduces Exposure Bias in Accelerated Diffusion Sampling

100% match1 repo2026

Knowledge Graph Finetuning Enhances Knowledge Manipulation in Large Language Models

100% match1 repo2652026

Effectively Using Public Data in Privacy Preserving Machine Learning

100% match2026

Dynamic Facility Location in High Dimensional Euclidean Spaces

100% match2026

On Feature Learning in Structured State Space Models

100% match2026

Leveraging Offline Data in Linear Latent Contextual Bandits

100% match2026

Cite this paper

@article{cipollone2026provably,
  title  = {Provably Efficient Offline Reinforcement Learning in Regular Decision Processes},
  author = {Roberto Cipollone and Anders Jonsson and Alessandro Ronca and M. S. Talebi},
  year   = {2026},
  doi    = {10.52202/075280-1711},
  url    = {https://doi.org/10.52202/075280-1711},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/68718b5bfbd2f20967d53e5dbd76b495c7761e78.svg)](https://codeofpaper.com/paper/68718b5bfbd2f20967d53e5dbd76b495c7761e78)

Discussion