MixCaps: Capsules With Iteration Free Routing

Abstract

In this paper, we propose a new variant of Capsule Networks called MixCaps. It is a new architecture that significantly decreases the compute capability required to run capsule networks. Due to the nature of our modules, we propose a new routing algorithm that does not require multiple iterations. All routing models prior to this architecture uses multiple iterations. This decreases our model's memory requirements by a significant margin unlike previous methods. This also provides us with the advantage to use both Matrix and Vector Poses. The model learns better complex representations as an aftereffect. Despite all this, we also show that our model performs on par with all prior capsule architectures on complex datasets such as Cifar-10 and Cifar-100.