Fast Dynamic Routing Based on Weighted Kernel Density Estimation

29Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Capsules as well as dynamic routing between them are most recently proposed structures for deep neural networks. A capsule groups data into vectors or matrices as poses rather than conventional scalars to represent specific properties of target instance. Besides of pose, a capsule should be attached with a probability (often denoted as activation) for its presence. The dynamic routing helps capsules achieve more generalization capacity with many fewer model parameters. However, the bottleneck that prevents widespread applications of capsule is the expense of computation during routing. To address this problem, we generalize existing routing methods within the framework of weighted kernel density estimation, and propose a fast routing methods. Our method prompts the time efficiency of routing by nearly 40% with negligible performance degradation. By stacking a hybrid of convolutional layers and capsule layers, we construct a network architecture to handle inputs at a resolution of pixels. The proposed models achieve a parallel performance with other leading methods in multiple benchmarks.

Cite

CITATION STYLE

APA

Zhang, S., Zhou, Q., & Wu, X. (2020). Fast Dynamic Routing Based on Weighted Kernel Density Estimation. In Studies in Computational Intelligence (Vol. 810, pp. 301–309). Springer Verlag. https://doi.org/10.1007/978-3-030-04946-1_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free