Energy Complexity of Fully-Connected Layers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Energy Complexity of Fully-Connected Layers

Jiří Šíma

Résumé

The energy efficiency of processing convolutional neural networks (CNNs) is crucial for their deployment on low-power mobile devices. In our previous work, a simplified theoretical hardware-independent model of energy complexity for CNNs has been introduced. This model has been experimentally shown to asymptotically fit the power consumption estimates of CNN hardware implementations on different platforms. Here, we pursue the study of this model from a theoretically perspective in the context of fully-connected layers. We present two dataflows and compute their associated energy costs to obtain upper bounds on the optimal energy. Using the weak duality theorem, we further prove a matching lower bound when the buffer memory is divided into two fixed parts for inputs and outputs. The optimal energy complexity for fully-connected layers in the case of partitioned buffer ensues. These results are intended to be generalized to the case of convolutional layers.
Fichier non déposé

Dates et versions

hal-04279755 , version 1 (10-11-2023)

Identifiants

Citer

Jiří Šíma, Jérémie Cabessa. Energy Complexity of Fully-Connected Layers. 17th International Work-Conference on Artificial Neural Networks, IWANN 2023, Jun 2023, Ponta Delgada, Portugal. ⟨10.1007/978-3-031-43085-5_1⟩. ⟨hal-04279755⟩
5 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More