Rejoinder: New Objectives for Policy Learning
From MaRDI portal
Abstract: I provide a rejoinder for discussion of "More Efficient Policy Learning via Optimal Retargeting" to appear in the Journal of the American Statistical Association with discussion by Oliver Dukes and Stijn Vansteelandt; Sijia Li, Xiudi Li, and Alex Luedtkeand; and Muxuan Liang and Yingqi Zhao.
Recommendations
- Discussion of Kallus and Mo, Qi, and Liu: New Objectives for Policy Learning
- Discussion of Kallus (2020) and Mo, Qi, and Liu (2020): New Objectives for Policy Learning
- More efficient policy learning via optimal retargeting
- Discussion of: ``More efficient policy learning via optimal retargeting and ``Learning optimal distributionally robust individualized treatment rules
- Policy iterations for reinforcement learning problems in continuous time and space -- fundamental theory and methods
- Expected policy gradients for reinforcement learning
- Policy Improvement and the Newton–Raphson Algorithm for Renewal Reward Processes
- Reinforcement learning in sparse-reward environments with hindsight policy gradients
- Policy Improvement and the Newton-Raphson Algorithm
Cites work
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Data-driven robust optimization
- Performance guarantees for policy learning
- Recovering best statistical guarantees via the empirical divergence-based distributionally robust optimization
- Robust sample average approximation
- Semiparametric theory and missing data.
- Smooth discrimination analysis
- Structural nested models and G-estimation: the partially realized promise
Cited in
(2)
This page was built for publication: Rejoinder: New Objectives for Policy Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999146)
