Sign inGet started
Paper · arXiv

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

We study the expressivity of spiking neural networks, which provide a natural framework for asynchronous, event-driven computation complementary to conventional feedforward neural networks. We consider the time-to-first-spike model in a setting for which the input-output map is continuous and piecewise linear, with affine pieces governed by causal feasibility constraints that determine which presynaptic spikes occur before a neuron fires. We first show that each neuron's firing time admits a maxout-like representation with exponentially many, highly constrained affine pieces. We then formalize causal regions as polyhedral regions with fixed causal sets and derive upper and lower bounds on...

AuthorsManjot Singh, Guido Montúfar, Gitta Kutyniok
Primary categorycs.LG
Published10 September 2026
Last updated at source10 September 2026
cs.LGmath.CO
Embed this entry
<iframe src="https://silytics.si/embed/item/e3348ea9-8f2f-4322-9e95-b7c847397fd6" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.