Skip to content
aiqbench takeAI Research

aiqbench analysis

This study establishes a rigorous analytical framework for comparing the energy efficiency of artificial neural networks (ANNs) and spiking neural networks (SNNs) based on matched representational capacity. The findings reveal that SNNs do not universally outperform ANNs in energy consumption; instead, their advantage is confined to specific architectural regimes defined by network width, spike sparsity, and depth scaling. For practitioners designing event-driven temporal models, these thresholds provide critical guidelines for selecting the most efficient computational paradigm without relying on unverified assumptions about hardware savings.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Towards an Expressivity-Normalized Energy-Demand Comparison of ANNs and SNNs

arXiv2 min read

arXiv:2608.29869v1 Announce Type: new Abstract: Spiking neural networks (SNNs) are often regarded as energy-efficient alternatives to artificial neural networks (ANNs), yet their advantage depends critically on both network architecture and data properties. We develop an analytical framework to compare fully-connected ReLU ANNs and integrate-and-fire SNNs for time-series data with respect to their theoretical energy efficiency at matched expressive capacity. By relating an inference-energy model to theoretical bounds on representational expressivity, we derive an expressivity-normalized efficiency ratio and explicit thresholds in network width, spike sparsity, and ANN depth scaling. Our analysis characterizes the regimes in which event-driven computation offsets the temporal overhead of SNNs, providing capacity-aware principles for designing energy-efficient temporal networks. It shows that ANNs exceed SNNs in expressivity-normalized efficiency only in specific regimes.

Abstract:Spiking neural networks (SNNs) are often regarded as energy-efficient alternatives to artificial neural networks (ANNs), yet their advantage depends critically on both network architecture and data properties. We develop an analytical framework to compare fully-connected ReLU ANNs and integrate-and-fire SNNs for time-series data with respect to their theoretical energy efficiency at matched expressive capacity. By relating an inference-energy model to theoretical bounds on representational expressivity, we derive an expressivity-normalized efficiency ratio and explicit thresholds in network width, spike sparsity, and ANN depth scaling. Our analysis characterizes the regimes in which event-driven computation offsets the temporal overhead of SNNs, providing capacity-aware principles for designing energy-efficient temporal networks. It shows that ANNs exceed SNNs in expressivity-normalized efficiency only in specific regimes.

Machine Learning (cs.LG)

arXiv:2608.29869 [cs.LG]

(or arXiv:2608.29869v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2608.29869 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 213 words

Related coverage