Generative Modelling of Stochastic Actions with Arbitrary Constraints in Reinforcement Learning
Changyu Chen, Ramesha Karunasena, Thanh Hong Nguyen, Arunesh Sinha,, Pradeep Varakantham

TL;DR
This paper introduces a novel reinforcement learning approach that uses conditional normalizing flows and invalid action rejection to efficiently handle large, constrained, and stochastic action spaces in resource allocation problems.
Contribution
It proposes a new method combining conditional normalizing flows with an invalid action rejection mechanism for constrained stochastic policies in RL.
Findings
Scalable to large action spaces.
Enforces arbitrary state-conditional constraints.
Outperforms prior methods in experiments.
Abstract
Many problems in Reinforcement Learning (RL) seek an optimal policy with large discrete multidimensional yet unordered action spaces; these include problems in randomized allocation of resources such as placements of multiple security resources and emergency response units, etc. A challenge in this setting is that the underlying action space is categorical (discrete and unordered) and large, for which existing RL methods do not perform well. Moreover, these problems require validity of the realized action (allocation); this validity constraint is often difficult to express compactly in a closed mathematical form. The allocation nature of the problem also prefers stochastic optimal policies, if one exists. In this work, we address these challenges by (1) applying a (state) conditional normalizing flow to compactly represent the stochastic policy -- the compactness arises due to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsReinforcement Learning in Robotics
MethodsBalanced Selection
