Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiency
Taisuke Kobayashi, Takumi Aotani

TL;DR
This paper introduces Bit-RNF, a restricted normalizing flow model for stochastic policies in reinforcement learning, balancing expressiveness and computational efficiency, and demonstrating superior performance in benchmarks and real robot experiments.
Contribution
It proposes a novel restricted normalizing flow (Bit-RNF) that analytically computes the mean and enhances expressiveness using a bimodal student-t distribution.
Findings
Bit-RNF outperforms previous models in RL benchmarks.
The model achieves real-time applicability in robot control.
Experimental validation on a real robot demonstrates effectiveness.
Abstract
This paper proposes a new design method for a stochastic control policy using a normalizing flow (NF). In reinforcement learning (RL), the policy is usually modeled as a distribution model with trainable parameters. When this parameterization has less expressiveness, it would fail to acquiring the optimal policy. A mixture model has capability of a universal approximation, but it with too much redundancy increases the computational cost, which can become a bottleneck when considering the use of real-time robot control. As another approach, NF, which is with additional parameters for invertible transformation from a simple stochastic model as a base, is expected to exert high expressiveness and lower computational cost. However, NF cannot compute its mean analytically due to complexity of the invertible transformation, and it lacks reliability because it retains stochastic behaviors…
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.
