Skip to content

Learning from the Unseen: Offline Reinforcement Learning with Hidden Actions

Jul 2026 · arXiv.org · Vol abs/2607.25241 · 0 citations
Mathematics Computer Science

TL;DR

This work leverages the next-state variable as a natural proxy for the unobserved action and proposes an influence-function-based estimator called LURE (Learning from the Unseen: Robust Estimator), which is multiply robust, remaining consistent under several combinations of correctly specified nuisance components, and is asymptotically normal, enabling valid statistical inference.

Abstract

Standard offline reinforcement learning (RL) algorithms typically assume that the actions in the dataset are observed without error. However, in many real-world applications, the true actions are unobserved and only noisy proxies are available, causing existing RL methods to yield biased and potentially misleading conclusions. We study off-policy evaluation in infinite-horizon discounted Markov decision processes with hidden actions. By leveraging the next-state variable as a natural proxy for the unobserved action, we establish identification of the policy value and propose an influence-function-based estimator called LURE (Learning from the Unseen: Robust Estimator). LURE is multiply robust, remaining consistent under several combinations of correctly specified nuisance components, and is asymptotically normal, enabling valid statistical inference. To our knowledge, this is the first work to address offline RL with hidden actions. We demonstrate LURE's effectiveness through simulations and a sepsis management application using the MIMIC-III database.

View source

Similar papers

Forecasting in Offline Reinforcement Learning for Non-stationary Environments

F orecasting in Non-stationary O ffline RL (F ORL), a framework that combines zero-shot forecasting with the agent’s experience, aims to bridge the gap between offline RL and the complexities of real-world, non-stationary environments.

Suzan Ece, Georg Martius, Emre Ugur et al. · 0 citations
#machine learning Preprint Sep 2026

Optimal Value Inference for Reinforcement Learning

Two new nuisances are derived as fixed points of a self-induced Bellman equation, in which they approximate the maximum Bellman operator by its softmax correspondence, and a debiased estimator is proposed through the Neyman orthogonality and established its asymptotic normality under diverging horizons.

Nan Lu, Ethan Lee, James M. Robins et al. · 0 citations
Preprint Sep 2026

Policy-Calibrated DAgger: Offline Calibrated Noise Injection for Imitation Learning

This work proposes Policy-Calibrated DAgger, a method that makes use of the properties of recent generative policies to estimate the policy's noise offline by using its own predicted action distribution, and shows that it surpasses policies trained with dataset aggregation without noising and matches the performance of...

Jenny Wang, George Kantor · 0 citations
Sep 2026

MAdam: MLMC Adam under Markovian Noise with Application to Average-Reward Policy Optimization

An algorithm MAdam is proposed, extending classical Adam for average-reward RL, providing the theoretical analysis for non-convex optimization problems and conducting experiments on challenging environments, indicating the qualitative performance of the approach.

Andrey Veprikov, V. Solodkin, A. Chernyavskiy et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.