paper-with-me

홈 › Papers

Using dynamic routing to extract intermediate features for developing scalable capsule networks

2019-07-13 · Bodhisatwa Mandal, Swarnendu Ghosh, Ritesh Sarkhel, Nibaran Das, Mita Nasipuri

Capsule networks have gained a lot of popularity in short time due to its unique approach to model equivariant class specific properties as capsules from images. However the dynamic routing algorithm comes with a steep computational complexity. In the proposed approach we aim to create scalable versions of the capsule networks that are much faster and provide better accuracy in problems with higher number of classes. By using dynamic routing to extract intermediate features instead of generating output class specific capsules, a large increase in the computational speed has been observed. Moreover, by extracting equivariant feature capsules instead of class specific capsules, the generalization capability of the network has also increased as a result of which there is a boost in accuracy.

📄 PDF Abstract BibTeX arXiv:1907.06062

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Neural Routing by Memory

2021-12-01 · NeurIPS 2021 12 · Kaipeng Zhang, Zhenqiang Li, Zhifeng Li, Wei Liu 외

Recent Convolutional Neural Networks (CNNs) have achieved significant success by stacking multiple convolutional blocks, named procedures in this paper, to extract semantic features. However, they use the same procedure …

Statistic-Augmented, Decoupled MoE Routing and Aggregating in Autonomous Driving

2025-12-07 · Wei-Bin Kou, Guangxu Zhu, Jingreng Lei, Chen Zhang 외 arxiv

Autonomous driving (AD) scenarios are inherently complex and diverse, posing significant challenges for a single deep learning model to effectively cover all possible conditions, such as varying weather, traffic densitie…

Semantic SegmentationAutonomous Driving

Dynamic Latent Routing

2026-05-14 · Fangyuan Yu, Xin Su, Amir Abdullah arxiv

We investigate the temporal concatenation of sub-policies in Markov Decision Processes (MDP) with time-varying reward functions. We introduce General Dijkstra Search (GDS), and prove that globally optimal goal-reaching p…

Hybrid Routing Transformer for Zero-Shot Learning

2022-03-29 · De Cheng, Gerong Wang, Bo wang, Qiang Zhang 외

Zero-shot learning (ZSL) aims to learn models that can recognize unseen image semantics based on the training of data with seen semantics. Recent studies either leverage the global image features or mine discriminative l…

AttributeDecoderZero-Shot Learning

Not All Tasks Are Equally Difficult: Multi-Task Deep Reinforcement Learning with Dynamic Depth Routing

2023-12-22 · Jinmin He, Kai Li, Yifan Zang, Haobo Fu 외

Multi-task reinforcement learning endeavors to accomplish a set of different tasks with a single policy. To enhance data efficiency by sharing parameters across multiple tasks, a common practice segments the network into…

AllDeep Reinforcement Learning