Issues with Measuring Task Complexity via Random Policies in Robotic Tasks
Reabetswe M. Nkhumise, Mohamed S. Talamali, Aditya Gilra

TL;DR
This paper critically evaluates existing complexity metrics in reinforcement learning for robotic tasks, revealing their contradictions with empirical understanding and emphasizing the need for improved measures.
Contribution
It demonstrates the limitations of current RWG-based metrics like PIC and POIC in accurately reflecting task complexity in robotic RL tasks.
Findings
PIC contradicts known task difficulty rankings
POIC favors sparse over dense reward tasks
Current metrics do not reliably measure task complexity
Abstract
Reinforcement learning (RL) has enabled major advances in fields such as robotics and natural language processing. A key challenge in RL is measuring task complexity, which is essential for creating meaningful benchmarks and designing effective curricula. While there are numerous well-established metrics for assessing task complexity in tabular settings, relatively few exist in non-tabular domains. These include (i) Statistical analysis of the performance of random policies via Random Weight Guessing (RWG), and (ii) information-theoretic metrics Policy Information Capacity (PIC) and Policy-Optimal Information Capacity (POIC), which are reliant on RWG. In this paper, we evaluate these methods using progressively difficult robotic manipulation setups, with known relative complexity, with both dense and sparse reward formulations. Our empirical results reveal that measuring complexity is…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobot Manipulation and Learning · Reinforcement Learning in Robotics · Machine Learning and Algorithms
