← Back to all news
arXiv Machine Learning By Manjot Singh, Guido Mont\'ufar, Gitta Kutyniok

Polyhedral Geometry of Time-to-First-Spike Neural Networks

Read the original on arXiv Machine Learning →

The paper investigates the expressivity of time-to-first-spike spiking neural networks, showing that each neuron's firing time can be represented in a maxout-like form with many constrained affine pieces. It formalizes causal regions as polyhedral sets defined by fixed causal spike sequences and derives bounds on the number of such regions for both shallow and multilayer networks. Experiments confirm that spiking networks can produce richer input-space partitions than conventional feedforward ReLU networks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
2d ago

Equivalence of approximation by networks of single- and multi-spike neurons

The paper demonstrates that for a broad class of spiking neuron models, including the leaky integrate‑and‑fire with subtractive reset, any approximation bound proven for multi‑spike networks can be translated to an equivalent single‑spike network with only a linear change in neuron count, and vice versa. This establishes that single‑spike and multi‑spike neural networks possess identical approximation capabilities for general machine learning tasks. Consequently, existing approximation results for single‑spike networks automatically extend to the multi‑spike case.

By Dominik Dold, Philipp Christian Petersen
More like this →