mlsanityData to 14 Oct 2026

Semi-Parametric Efficient Policy Learning with Continuous Actions

arXiv 1905.10116 ↗First posted 24 May 2019econ.EM cs.LG math.STcited by 26

Not on the map. Why?

Abstract (arXiv)

We consider off-policy evaluation and optimization with continuous action spaces. We focus on observational data where the data collection policy is unknown and needs to be estimated. We take a semi-parametric approach where the value function takes a known parametric form in the treatment, but we are agnostic on how it depends on the observed contexts. We propose a doubly robust off-policy estimate for this setting and show that off-policy optimization based on this estimate is robust to estimation errors of the policy function or the regression model. Our results also apply if the model does not satisfy our semi-parametric form, but rather we measure regret in terms of the best projection of the true value function to this functional space. Our work extends prior approaches of policy optimization from observational data that only considered discrete actions. We provide an experimental evaluation of our method in a synthetic data example motivated by optimal personalized pricing and costly resource allocation.

Key facts. Cited by 26 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 3; 2022: 3; 2023: 9; 2024: 3; 2025: 3; 2026: 5.

26 papers.

Sort:

By area:

  1. 2021Adapting to Misspecification in Contextual Banditscited by 81
  2. 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 54
  3. 2022Contextual Bandits with Large Action Spaces: Made Practicalcited by 33
  4. 2024Applied Causal Inference Powered by ML and AIcited by 30
  5. 2021Policy Learning with Adaptively Collected Datacited by 21
  6. 2021Minimax Kernel Machine Learning for a Class of Doubly Robust Functionals with Application to Proximal Causal Inferencecited by 20
  7. 2022PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Banditscited by 17
  8. 2024Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learningcited by 16
  9. 2023Reliable Off-Policy Learning for Dosage Combinationscited by 15
  10. 2023Oracle-Efficient Pessimism: Offline Policy Optimization in Contextual Banditscited by 15
  11. 2024Learning treatment effects while treating those in needcited by 8
  12. 2023Sequential Counterfactual Risk Minimizationcited by 6
14 more
  1. 2023Individualized Policy Evaluation and Learning under Clustered Network Interferencecited by 6
  2. 2023Efficient and robust transfer learning of optimal individualized treatment regimes with right-censored survival datacited by 5
  3. 2023Balanced Off-Policy Evaluation for Personalized Pricingcited by 5
  4. 2026Taming the Monster Every Context: Complexity Measure and Unified Framework for Offline-Oracle Efficient Contextual Banditscited by 4
  5. 2023STEEL: Singularity-aware Reinforcement Learningcited by 3
  6. 2023Learning to Generate All Feasible Actionscited by 2
  7. 2025Doubly Robust Fusion of Many Treatments for Policy Learningcited by 2
  8. 2026Functional Natural Policy Gradientscited by 1
  9. 2023Mind the Gap: Optimal and Equitable Encouragement Policiescited by 0
  10. 2025Deep Learning of Continuous and Structured Policies for Aggregated Heterogeneous Treatment Effectscited by 0
  11. 2025Fast Best-in-Class Regret for Contextual Banditscited by 0
  12. 2026Efficient Exploration for Iterative Nash Preference Optimizationcited by 0
  13. 2026Wasserstein Policy Learning for Distributional Outcomescited by 0
  14. 2026Weighted Spline-Expanded Networks with Distributional Balancing for Continuous Treatment Effectscited by 0