Select High-Level Features: Efficient Experts from a Hierarchical Classification Network

André Kelm, Niels Hannemann, Bruno Heberle, Lucas Schmidt, Tim Rolff +3 more
3/8/2024
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

This study introduces a novel expert generation method that dynamically reduces task and computational complexity without compromising predictive performance. It is based on a new hierarchical classification network topology that combines sequential processing of generic low-level features with parallelism and nesting of high-level features. This structure allows for the innovative extraction technique: the ability to select only high-level features of task-relevant categories. In certain cases, it is possible to skip almost all unneeded high-level features, which can significantly reduce the inference cost and is highly beneficial in resource-constrained conditions. We believe this method paves the way for future network designs that are lightweight and adaptable, making them suitable for a wide range of applications, from compact edge devices to large-scale clouds. In terms of dynamic inference our methodology can achieve an exclusion of up to 88.7\,\% of parameters and 73.4\,\% fewer giga-multiply accumulate (GMAC) operations, analysis against comparative baselines showing an average reduction of 47.6\,\% in parameters and 5.8\,\% in GMACs across the cases we evaluated.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kelm2024select,
  title  = {Select High-Level Features: Efficient Experts from a Hierarchical Classification Network},
  author = {André Kelm and Niels Hannemann and Bruno Heberle and Lucas Schmidt and Tim Rolff and Christian Wilms and Ehsan Yaghoubi and Simone Frintrop},
  year   = {2024},
  eprint = {2403.05601},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.05601v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.05601.svg)](https://codeofpaper.com/paper/2403.05601)

Discussion