Near-Optimal Distributionally Robust Reinforcement Learning with General $L_p$ Norms

Pierre Clavier, Laixi Shi, E. L. Pennec, Eric Mazumdar, Adam Wierman +1 more
2/3/2026

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

Semantic 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

MetaUAS: Universal Anomaly Segmentation with One-Prompt Meta-Learning

77% match1 repo902026

Doubly Robust Conformalized Survival Analysis with Right-Censored Data

77% match2026

Partial Label Unsupervised Domain Adaptation with Class-Prototype Alignment

77% match2026

Measuring Multimodal Mathematical Reasoning with MATH-Vision Dataset

77% match2026

Improving Spectral Snapshot Reconstruction with Spectral-Spatial Rectification

77% match2026

ColorPCR: Color Point Cloud Registration with Multi-Stage Geometric-Color Fusion

77% match1 repo332026

Cite this paper

@article{clavier2026nearoptimal,
  title  = {Near-Optimal Distributionally Robust Reinforcement Learning with General $L_p$ Norms},
  author = {Pierre Clavier and Laixi Shi and E. L. Pennec and Eric Mazumdar and Adam Wierman and Matthieu Geist},
  year   = {2026},
  url    = {https://www.semanticscholar.org/paper/6534ca21d434d2e2a71680333f71c3a41238723f},
  journal = {NEURIPS 2024 2024}
}

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/6534ca21d434d2e2a71680333f71c3a41238723f.svg)](https://codeofpaper.com/paper/6534ca21d434d2e2a71680333f71c3a41238723f)

Discussion