18/11/2020

Constrained reinforcement learning via policy splitting

Haoxian Chen, Henry Lam, Fengpei Li, Amirhossein Meisami

Keywords:

Abstract Paper Similar Papers

Abstract: We develop a model-free reinforcement learning approach to solve constrained Markov decision processes, where the objective and budget constraints are in the form of infinite-horizon discounted expectations, and the rewards and costs are learned sequentially from data. We propose a two-stage procedure where we first search over deterministic policies, followed by an aggregation with a mixture parameter search, that generates policies with simultaneous guarantees on near-optimality and feasibility. We also numerically illustrate our approach by applying it to an online advertising problem.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at ACML 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 18:11 
 0
 0
 0
 0
 13:30 
 0
 0
 0
 0
 13:10 
 0
 0
 0
 0
 8:00 
 0
 0
 0
 0
 16:57 
 0
 0
 0
 0
 4:10 
 0
 0
 0
 0
 15:18 
 0
 0
 0
 0
 15:07 
 0
 0
 0
 0
 15:04 
 0
 0
 0
 0
 3:11 
 0
 0
 0
 0
 13:11 
 0
 0
 0
 0
 14:31 
 0
 0
 0
 0
 13:35 
 0
 0
 0
 0
 13:47 
 0
 0
 0
 0
 5:15 
 0
 0
 0
 0
 14:18 
 0
 0
 0
 0
 14:12 
 0
 0
 0
 0
 14:36 
 1
 1
 0
 0
 15:53 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 17:07 
 0
 0
 0
 0
 17:04 
 0
 0
 0
 0
 12:49 
 0
 0
 0
 0
 10:54 
 0
 0
 0
 0
 14:22 
 0
 0
 0
 0
 11:20 
 0
 0
 0
 0
 5:09 
 0
 0
 0
 0
 4:55 
 0
 0
 0
 0
 5:15 
 0
 1
 1
 0
 12:25 
 0
 0
 0
 0
 14:49 
 0
 0
 0
 0
 12:26 
 0
 0
 0
 0
 15:26 
 0
 0
 0
 0
 5:43 
 0
 0
 0
 0
 8:19 
 0
 0
 0
 0
 5:24 
 0
 0
 0
 0
 5:36 
 0
 0
 0
 0
 3:24 
 0
 0
 0
 0
 12:24 
 0
 0
 0
 0
 3:20