Exact Reduction of Huge Action Spaces in General Reinforcement Learning
Sultan Javed Majeed, Marcus Hutter

TL;DR
This paper introduces an exact method to reduce large action spaces in reinforcement learning by sequentializing actions, significantly improving the efficiency of state aggregation techniques like ESA.
Contribution
It provides explicit constructions and proofs for action-binarization, enabling exponential reduction of action-space size in non-Markovian RL problems.
Findings
Binarizing actions reduces state-space size logarithmically.
Exact equivalence proofs for the action-sequentialization process.
Improved bounds for Extreme State Aggregation (ESA) in large action spaces.
Abstract
The reinforcement learning (RL) framework formalizes the notion of learning with interactions. Many real-world problems have large state-spaces and/or action-spaces such as in Go, StarCraft, protein folding, and robotics or are non-Markovian, which cause significant challenges to RL algorithms. In this work we address the large action-space problem by sequentializing actions, which can reduce the action-space size significantly, even down to two actions at the expense of an increased planning horizon. We provide explicit and exact constructions and equivalence proofs for all quantities of interest for arbitrary history-based processes. In the case of MDPs, this could help RL algorithms that bootstrap. In this work we show how action-binarization in the non-MDP case can significantly improve Extreme State Aggregation (ESA) bounds. ESA allows casting any (non-MDP, non-ergodic,…
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.
Videos
Taxonomy
TopicsReinforcement Learning in Robotics · Advanced Software Engineering Methodologies · Evolutionary Algorithms and Applications
