Skip to content
Open access

Spike-Aware Propagation Approximation for Conductance-Based LIF Equations

Aug 2026 · Axioms · Vol 15, pp. 632 · 0 citations · 39 references

TL;DR

This work introduces a spike-aware propagation approximation method that combines exact receptor-trace updates, analytic homogeneous membrane propagation, Gauss–Legendre quadrature, and spike localization, improving the accuracy–efficiency Pareto frontier and establishing an error bound and conditional convergence under consistent refinement for the proposed SAP.

Abstract

Large-scale spiking neural network simulation requires numerical integration that preserves membrane dynamics and spike timing without making fine-resolution updates prohibitively expensive. This balance is difficult for conductance-based leaky integrate-and-fire (LIF) networks because synaptic decay, threshold crossings, resets, and refractory periods form a hybrid dynamical system. To address this difficulty, we introduce a spike-aware propagation (SAP) approximation method that combines exact receptor-trace updates, analytic homogeneous membrane propagation, Gauss–Legendre quadrature, and spike localization, improving the accuracy–efficiency Pareto frontier. We establish an error bound and conditional convergence under consistent refinement for the proposed SAP. At h = 1 ms, the single-realization T = 1000 ms comparison showed a lower voltage RMSE for SAP than for Euler at the same width in the two high-activity regimes. The five-seed T = 200 ms robustness experiment likewise showed lower voltage RMSE for SAP than for NEST at the same width. At the highest drive, the paired mean reduction was 3.91 mV (95% CI, 3.85–3.97 mV). This quantified gain supports SAP as a practical route to an improved accuracy–efficiency balance in large-scale conductance-based LIF simulation while underscoring the method’s configuration-dependent and regime-dependent scope.

Read PDF

Similar papers

Open access Aug 2026

Why temporal spike order reversal drops spiking network accuracy and how to partially mitigate it

This study identifies a critical vulnerability in SNNs on recently established bit-based codes: consistent performance degradation when temporal spike encoding orders are reversed, and measures the per-timestep class-mutual-information profile of six encodings directly and shows that the resulting concordance ordering...

N. T. Luu, Trung Duong Trung Luu, N. Pham et al. · 0 citations
#machine learning Preprint Sep 2026

A Gradient-based yet Spike-Timing-Dependent Solution to the Feedback Learning Problem in Neural Microcircuits

This work reformulates temporal credit assignment as a state separation problem: extracting task-required components induced by historical perturbations directly from the current neural state, which enables an online feedback learning framework for NMCs through a gradient tunneling algorithm and the lead-lag expansion...

Xiang-Nan Zhang, Jing-Xin Liu, Ran-Qi Lu et al. · 0 citations
Aug 2026

Accuracy-Efficiency Trade-offs of Temporal Enrichment in Spiking Neural Networks

Spiking neural networks (SNNs) promise energyefficient temporal processing, but the choice of neuron model affects both task accuracy and hardware cost. We compare three mechanisms for enriching temporal processing in SNNs- heterogeneity, adaptation, and synaptic delays-on auditory benchmarks (SHD, SSC) under controlle...

Soumyajit Mandal, Yi-Hui Ren, Vishal Saxena · 0 citations
Preprint Aug 2026

BASC : Behavior-Aligned Quantization and Pruning for Low-Bit Spiking Neural Networks

Extensive experiments on static and neuromorphic benchmarks show that lower-bit BASC models match or outperform higher-bit baselines and retain this accuracy advantage after structured pruning, while further reducing model storage and synaptic operations.

Linliang Chen, Yan Zhong, Xin Liu et al. · 0 citations
Preprint Aug 2026

Noisy group neurons with synchronous resetting for high-performance spiking neural networks

This work proposes a noisy group neuron (NGN) model, which incorporates population-level synchronous resetting and neural stochasticity as fundamental computational mechanisms, and develops the NGN method as a framework that combines the NGN model with backpropagation learning based on mean-field dynamics.

Yajie Zhai, Yanmei Kang, Meng Li et al. · 0 citations
Preprint Aug 2026

Lapis: Laplacian Spiking Attention via First-Spike Timing and Membrane Leakage

Lapis is proposed, a spiking attention mechanism that scores each token pair by the L1 distance between its query and key first-spike latency vectors under time-to-first-spike coding, and maps this distance to an affinity through a Laplacian kernel.

Kaiwen Tang, Jiaqi Zheng, Zi-Xuan Zhu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.