Double reinforcement learning for efficient off-policy evaluation in Markov decision processes
From MaRDI portal
(Redirected from Publication:5148951)
Recommendations
- Efficiently Breaking the Curse of Horizon in Off-Policy Evaluation with Double Reinforcement Learning
- Proximal reinforcement learning: efficient off-policy evaluation in partially observed Markov decision processes
- Reliable off-policy evaluation for reinforcement learning
- Projected state-action balancing weights for offline reinforcement learning
- Off-policy evaluation in partially observed Markov decision processes under sequential ignorability
Cites work
- \(\text{Q}(\lambda)\) with off-policy corrections
- 10.1162/1532443041827907
- A matrix extension of the Cauchy-Schwarz inequality
- A new approach to causal inference in mortality studies with a sustained exposure period—application to control of the healthy worker survivor effect
- Adjusting for Nonignorable Drop-Out Using Semiparametric Nonresponse Models
- Asymptotic Statistics
- Bias and variance approximation in value function estimates
- Consistent estimation of the influence function of locally asymptotically linear estimators
- Constructing dynamic treatment regimes over indefinite time horizons
- Double/debiased machine learning for treatment and structural parameters
- Doubly robust policy evaluation and optimization
- Efficient Estimation of Average Treatment Effects Using the Estimated Propensity Score
- Efficient Estimation of Models with Conditional Moment Restrictions Containing Unknown Functions
- Efficient estimation of panel data models with sequential moment restrictions
- Estimating dynamic treatment regimes in mobile health using V-learning
- scientific article; zbMATH DE number 1181283 (Why is no real title available?)
- scientific article; zbMATH DE number 1487685 (Why is no real title available?)
- scientific article; zbMATH DE number 1827860 (Why is no real title available?)
- scientific article; zbMATH DE number 6542809 (Why is no real title available?)
- Introduction to empirical processes and semiparametric inference
- Large Sample Properties of Generalized Method of Moments Estimators
- Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
- Local Rademacher complexities
- Marginal Mean Models for Dynamic Regimes
- Nonparametric econometrics. Theory and practice.
- On differentiable functionals
- On methods of sieves and penalization
- On the Role of the Propensity Score in Efficient Semiparametric Estimation of Average Treatment Effects
- Optimal Dynamic Treatment Regimes
- Reinforcement learning. An introduction
- Robust estimation of optimal dynamic treatment regimes for sequential treatment decisions
- Robust inference on the average treatment effect using the outcome highly adaptive Lasso
- Semiparametric theory and missing data.
- Statistical methods for dynamic treatment regimes. Reinforcement learning, causal inference, and personalized medicine
- The semiparametric efficiency bound for models of sequential moment restrictions containing unknown functions
- The use of polynomial splines and their tensor products in multivariate function estimation. (With discussion)
- Unified methods for censored longitudinal data and causality
Cited in
(20)- Toward theoretical understandings of robust Markov decision processes: sample complexity and asymptotics
- Batch policy learning in average reward Markov decision processes
- scientific article; zbMATH DE number 7625206 (Why is no real title available?)
- Efficiently Breaking the Curse of Horizon in Off-Policy Evaluation with Double Reinforcement Learning
- Statistically Efficient Advantage Learning for Offline Reinforcement Learning in Infinite Horizons
- Off-policy evaluation in partially observed Markov decision processes under sequential ignorability
- Projected state-action balancing weights for offline reinforcement learning
- Off-policy evaluation for tabular reinforcement learning with synthetic trajectories
- Settling the sample complexity of model-based offline reinforcement learning
- Reliable off-policy evaluation for reinforcement learning
- Proximal reinforcement learning: efficient off-policy evaluation in partially observed Markov decision processes
- Optimal policy evaluation using kernel-based temporal difference methods
- On the statistical complexity for offline and low-adaptive reinforcement learning with structures
- Counterfactual inference in sequential experiments
- Bounding the difference between the values of robust and non-robust Markov decision problems
- Asymptotic inference for multi-stage stationary treatment policy with variable selection
- Randomization inference when N equals one
- Off-Policy Evaluation in Doubly Inhomogeneous Environments
- Evaluation of active feature acquisition methods for time-varying feature settings
- Dynamic covariate balancing: estimating treatment effects over time with potential local projections
This page was built for publication: Double reinforcement learning for efficient off-policy evaluation in Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148951)
