Pith. sign in

REVIEW 1 cited by

Exact Gradients for Stochastic Spiking Neural Networks Driven by Rough Signals

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 2405.13587 v1 pith:ISVVIX4H submitted 2024-05-22 stat.ML cs.LGmath.PR

classification stat.MLcs.LGmath.PR
keywords eventroughgradientsssnnsstochasticdrivenframeworkintroduce
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We introduce a mathematically rigorous framework based on rough path theory to model stochastic spiking neural networks (SSNNs) as stochastic differential equations with event discontinuities (Event SDEs) and driven by c\`adl\`ag rough paths. Our formalism is general enough to allow for potential jumps to be present both in the solution trajectories as well as in the driving noise. We then identify a set of sufficient conditions ensuring the existence of pathwise gradients of solution trajectories and event times with respect to the network's parameters and show how these gradients satisfy a recursive relation. Furthermore, we introduce a general-purpose loss function defined by means of a new class of signature kernels indexed on c\`adl\`ag rough paths and use it to train SSNNs as generative models. We provide an end-to-end autodifferentiable solver for Event SDEs and make its implementation available as part of the $\texttt{diffrax}$ library. Our framework is, to our knowledge, the first enabling gradient-based training of SSNNs with noise affecting both the spike timing and the network's dynamics.

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. Rough kernel hedging

    math.FA 2025-01 conditional novelty 6.0 of 10

    A signature-kernel and operator-valued-kernel framework for hedging is proved to have a unique global minimizer with an explicit formula, and it approximates the delta hedge on a GBM example.

Pith tools