DiPRL: Learning Discrete Programmatic Policies via Architecture Entropy Regularization
Chengpeng Hu, Yingqian Zhang, Hendrik Baier

TL;DR
DiPRL is a novel reinforcement learning method that learns nearly discrete, interpretable programmatic policies during training, avoiding performance loss from post-hoc discretization.
Contribution
It introduces architecture entropy regularization to enable smooth training of nearly discrete policies without needing post-hoc fine-tuning.
Findings
DiPRL achieves strong performance on multiple RL tasks.
It maintains policy interpretability with nearly discrete programs.
The method mitigates performance drops associated with post-hoc discretization.
Abstract
Programmatic reinforcement learning (PRL) offers an interpretable alternative to deep reinforcement learning by representing policies as human-readable and -editable programs. While gradient-based methods have been developed to optimize continuous relaxations of programs, they face a significant performance drop when converting the continuous relaxations back into discrete programs. Post-hoc discretization can discard optimized branches and parameters in a program, which results in a collapse of policy expressivity and lowered task performance, leading in turn to a need for additional fine-tuning. To overcome these limitations, we propose Differentiable Discrete Programmatic Reinforcement Learning (DiPRL), a method that learns programmatic policies that become nearly discrete during training, avoiding a separate post-hoc fine-tuning stage. We first analyze the inherent risks of…
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.
