mlsanityData to 7 Oct 2026

Value Enhancement of Reinforcement Learning via Efficient and Robust Trust Region Optimization

arXiv 2301.02220 ↗First posted 5 Jan 2023stat.ML cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Reinforcement learning (RL) is a powerful machine learning technique that enables an intelligent agent to learn an optimal policy that maximizes the cumulative rewards in sequential decision making. Most of methods in the existing literature are developed in textitonline settings where the data are easy to collect or simulate. Motivated by high stake domains such as mobile health studies with limited and pre-collected data, in this paper, we study textitoffline reinforcement learning methods. To efficiently use these datasets for policy optimization, we propose a novel value enhancement method to improve the performance of a given initial policy computed by existing state-of-the-art RL algorithms. Specifically, when the initial policy is not consistent, our method will output a policy whose value is no worse and often better than that of the initial policy. When the initial policy is consistent, under some mild conditions, our method will yield a policy whose value converges to the optimal one at a faster rate than the initial policy, achieving the desired ``value enhancement" property. The proposed method is generally applicable to any parametrized policy that belongs to certain pre-specified function class (e.g., deep neural networks). Extensive numerical studies are conducted to demonstrate the superior performance of our method.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 25 of its 69 references that are in the map. First posted on arXiv 5 Jan 2023.

Builds on

25 of 69 references.

References · 25

  1. 2015Trust Region Policy Optimizationcited by 2,503
  2. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  3. 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,777
  4. 2019Behavior Regularized Offline Reinforcement Learningcited by 654
  5. 2020MOPO: Model-based Offline Policy Optimizationcited by 630
  6. 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 337
  7. 2017Deep Reinforcement Learning: An Overviewcited by 327
  8. 2019Batch Policy Learning under Constraintscited by 242
  9. 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 226
  10. 2018A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximationcited by 225
  11. 2019A Theoretical Analysis of Deep Q-Learningcited by 212
  12. 2020Batch Policy Learning in Average Reward Markov Decision Processescited by 69
13 more
  1. 2016Estimating Dynamic Treatment Regimes in Mobile Health Using V-learningcited by 65
  2. 2020Statistical Inference of the Value Function for Reinforcement Learning in Infinite Horizon Settingscited by 65
  3. 2020OR-Gym: A Reinforcement Learning Library for Operations Research Problemscited by 50
  4. 2019Off-Policy Estimation of Long-Term Average Outcomes with Applications to Mobile Healthcited by 42
  5. 2020Accountable Off-Policy Evaluation With Kernel Bellman Statisticscited by 36
  6. 2021Deeply-Debiased Off-Policy Interval Estimationcited by 36
  7. 2022On Well-posedness and Minimax Optimal Rates of Nonparametric Q-function Estimation in Off-policy Evaluationcited by 33
  8. 2020Does the Markov Decision Process Fit the Data: Testing for the Markov Property in Sequential Decision Makingcited by 30
  9. 2020Statistically Efficient Off-Policy Policy Gradientscited by 24
  10. 2016Bounded, efficient and multiply robust estimation of average treatment effects using instrumental variablescited by 23
  11. 2021Projected State-action Balancing Weights for Offline Reinforcement Learningcited by 16
  12. 2020Personalized Policy Learning using Longitudinal Mobile Health Datacited by 10
  13. 2020Multiply robust estimation of causal effects under principal ignorabilitycited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 3; 2026: 2.

7 papers.