Order-Sensitive Fast-Synapse Limits in Sparse Excitatory-Inhibitory Threshold-Reset Networks
arXiv:2608.16701
2026
Dynamics
2 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper identifies a concrete failure mode of collapsing signed fast inputs into their weak limit: threshold-reset dynamics can retain the microscopic order of excitatory and inhibitory arrivals even when both synaptic kernels converge to the same impulse at zero. The key transferable asset is the exact firing interval x+a-b<theta<=x+a, which characterizes states where excitatory-first and inhibitory-first processing produce different outputs, together with persistence under strict perturbation margins and sparse random aggregation. This suggests neural modules that preserve causal E/I event order inside a nominal timestep rather than summing all signed inputs, as well as a training regularizer that controls sensitivity to unresolved event ordering. The most direct targets are event-driven or discretized spiking recurrent networks.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Replace signed-input aggregation in a spiking recurrent cell with a causal micro-event queue that processes excitatory and inhibitory arrivals in timestamp order, applying threshold and reset after each event. This preserves computations that disappear when all events in a timestep are replaced by one net current, particularly near threshold.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Train a threshold-reset recurrent network to suppress dependence on unresolved excitatory/inhibitory arrival order. Penalize states that fall in the paper's order-sensitive firing interval, or augment training with excitatory-first and inhibitory-first counterfactuals and enforce consistent outputs.
Useful6/10
Difficulty4/10
Novelty8/10