Lapis: Laplacian Spiking Attention via First-Spike Timing and Membrane Leakage
arXiv:2608.11865
2026
Architecture
2 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper supplies a hardware-oriented replacement for query-key dot products in spiking attention: compare first-spike latency vectors with an l1 metric and convert the distance into a Laplacian affinity. This is more than a generic similarity choice because the exponential kernel has a direct interpretation as the decay of a leaky integrate-and-fire membrane, tying the attention bandwidth to a physical neuron time constant. The resulting score path uses subtraction, absolute value, accumulation, and normalization rather than channelwise multiplication, and power-of-two normalization can make the latter a shift operation. The most promising transfer is a latency-coded attention module for spiking or event-driven transformers, with a second experiment testing whether fixed-point and power-of-two approximations preserve accuracy while materially reducing energy.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Replace multiplicative query-key attention scores with an affinity based on the l1 distance between first-spike latency vectors. For each query token and key token, small latency differences produce large affinity and distant timings decay exponentially, yielding a locality-sensitive attention pattern naturally compatible with leaky spiking neurons.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Make Laplacian latency attention hardware-friendly by quantizing the exponential decay and row normalization to powers of two. Exponentials and divisions can then be implemented with lookup tables and integer shifts, enabling a low-bit attention kernel for neuromorphic and edge accelerators.
Useful6/10
Difficulty4/10
Novelty7/10