Pith. sign in

REVIEW 1 cited by

Stable Learning Using Spiking Neural Networks Equipped With Affine Encoders and Decoders

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.04549 v3 pith:FTHYL7WA submitted 2024-04-06 cs.NE cs.LGmath.FAstat.ML

classification cs.NEcs.LGmath.FAstat.ML
keywords networksneuralspikingaffinegeneralizationlearningresultsapproximation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study the learning problem associated with spiking neural networks. Specifically, we focus on spiking neural networks composed of simple spiking neurons having only positive synaptic weights, equipped with an affine encoder and decoder; we refer to these as affine spiking neural networks. These neural networks are shown to depend continuously on their parameters, which facilitates classical covering number-based generalization statements and supports stable gradient-based training. We demonstrate that the positivity of the weights enables a wide range of expressivity results, including rate-optimal approximation of smooth functions and dimension-independent approximation of Barron regular functions. In particular, we show in theory and simulations that affine spiking neural networks are capable of approximating shallow ReLU neural networks. Furthermore, we apply these affine spiking neural networks to standard machine learning benchmarks and reach competitive results. Finally, we observe that from a generalization perspective, contrary to feedforward neural networks or previous results for general spiking neural networks, the depth has little to no adverse effect on the generalization capabilities.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Time to Spike? Understanding the Representational Power of Spiking Neural Networks in Discrete Time

    cs.LG 2025-05 conditional novelty 7.0 of 10

    Discrete-time LIF spiking networks realize piecewise constant functions on polyhedral regions, and each first-layer neuron generates only O(T^2) parallel hyperplanes over T time steps, not exponentially many.

Pith tools