High-Level Parallelism and Nested Features for Dynamic Inference Cost and Top-Down Attention

André Peter Kelm, Niels Hannemann, Bruno Heberle, Lucas Schmidt, Tim Rolff +3 more
8/9/2023
cs.CV

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

Abstract

This paper introduces a novel network topology that seamlessly integrates dynamic inference cost with a top-down attention mechanism, addressing two significant gaps in traditional deep learning models. Drawing inspiration from human perception, we combine sequential processing of generic low-level features with parallelism and nesting of high-level features. This design not only reflects a finding from recent neuroscience research regarding - spatially and contextually distinct neural activations - in human cortex, but also introduces a novel "cutout" technique: the ability to selectively activate %segments of the network for task-relevant only network segments of task-relevant categories to optimize inference cost and eliminate the need for re-training. We believe this 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. Our proposed topology also comes with a built-in top-down attention mechanism, which allows processing to be directly influenced by either enhancing or inhibiting category-specific high-level features, drawing parallels to the selective attention mechanism observed in human cognition. Using targeted external signals, we experimentally enhanced predictions across all tested models. In terms of dynamic inference cost our methodology can achieve an exclusion of up to $73.48\,\%$ of parameters and $84.41\,\%$ fewer giga-multiply-accumulate (GMAC) operations, analysis against comparative baselines show an average reduction of $40\,\%$ in parameters and $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{kelm2023highlevel,
  title  = {High-Level Parallelism and Nested Features for Dynamic Inference Cost and Top-Down Attention},
  author = {André Peter Kelm and Niels Hannemann and Bruno Heberle and Lucas Schmidt and Tim Rolff and Christian Wilms and Ehsan Yaghoubi and Simone Frintrop},
  year   = {2023},
  eprint = {2308.05128},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.05128v3}
}

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/2308.05128.svg)](https://codeofpaper.com/paper/2308.05128)

Discussion