- Rating
- 4(+1)
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper proposes Delta SNN, a time-variant synaptic framework designed to improve the spatiotemporal modeling capability of SNN. It introduces compact temporal weight modulation and binary synaptic routing to enhance temporal adaptability while maintaining computational efficiency. Extensive experiments on event-based dataset demonstrate consistent improvements over strong baselines.
Critical strengths
1.The paper identifies an important limitation of temporal weight sharing in SNNs, supported by feature and gradient similarity analyses. 2.The proposed compact temporal modulation and binary synaptic routing enhance temporal modeling while preserving computational efficiency. 3.Extensive experiments and ablation studies, comparisons with alternative temporal adaptation methods, and efficiency analyses provide convincing empirical support.
Critical weaknesses
- The proposed method uses time-dependent projection matrices , whereas the proof in Appendix A assumes a shared matrix . How does the theoretical bound on the effective dimension remain valid under the actual formulation?
- The proof of Theorem A.2 directly applies Lemma A.1, which concerns fixed-weight LIF neurons, to the time-varying setting. Could the authors justify why the same bound on the number of hyperplanes still holds?
- Equation (9) compares upper bounds rather than achievable expressivity. A larger upper bound does not necessarily imply greater expressive capacity. Could the authors provide a corresponding lower-bound analysis or revise this claim?
- The main text defines , but the example for uses instead of . The authors should reconcile these definitions and verify the subsequent calculations.
- The proposed method is interesting and empirically effective, and its practical contributions are sufficient to support acceptance. However, the theoretical analysis requires more rigorous justification. If the current theoretical claims cannot be rigorously established, I would encourage the authors to revise or remove the theoretical analysis rather than retain potentially unsupported conclusions.
Questions for authors
See weaknesses.
6 comments
Response to Reviewer xEmk — Part 2 of 4
W2. Extending the fixed-weight lemma to time-varying weights and counting hyperplanes
Thank you for this question. Our previous version omitted the treatment of , and we provide the complete derivation here. Specifically, we restrict the hyperplane count and subsequent combinatorial upper bound to the non-leaky case .
Handling time-dependent input offsets. For the input model in the main text,
each is fixed and independent of the variable whose space is partitioned. Defining
absorbs the time-dependent input offset into the affine constant term:
=w_{k,t}^{\top}x+b_{k,t}.$$ This treatment preserves both the time dependence of $w_{k,t}$ and the affine structure required for partitioning the input space. This connecting step is now included in Step 1 of the proof of Theorem A.2. **An independent counting proof for time-varying weights.** Under the soft-reset dynamics with $\beta=1$, expanding the recurrence gives $$s_k(t) =H\left( a_{k,t}^{\top}x+c_{k,t} -\vartheta\left[1+\sum_{\tau=1}^{t-1}s_k(\tau)\right] \right),$$ where $$a_{k,t}=\sum_{\tau=1}^{t}w_{k,\tau}, \qquad c_{k,t}=u_k(0)+\sum_{\tau=1}^{t}b_{k,\tau}.$$ The preceding spike history enters the threshold through the cumulative spike count $$m=\sum_{\tau=1}^{t-1}s_k(\tau) \in\lbrace 0,\ldots,t-1\rbrace.$$ Thus, timestep $t$ corresponds to at most the following $t$ candidate hyperplanes: $$a_{k,t}^{\top}x+c_{k,t} =\vartheta(1+m), \qquad m=0,\ldots,t-1.$$ The total number of candidate hyperplanes across all timesteps is therefore at most $$M(T)=\sum_{t=1}^{T}t=\frac{T(T+1)}2.$$ **This result follows directly from the dynamics with time-varying weights, without applying the fixed-weight lemma directly to the time-varying case.** The normal vectors can change across timesteps; coincident or degenerate hyperplanes and unreachable histories can only reduce the number of effective boundaries. Since every $a_{k,t}$ belongs to $\operatorname{span}\lbrace w_{k,1},\ldots,w_{k,T}\rbrace$, counting can be performed in the $r_k$-dimensional effective input space defined in W1. The upper bound on the number of regions in a hyperplane arrangement gives the following bound on the number of nonempty, full-dimensional activation regions of neuron $k$: $$N_k\le \sum_{j=0}^{r_k}\binom{M(T)}j.$$ Taking the common refinement of the partitions of $n$ neurons yields $$N_{\mathrm{layer}} \le \prod_{k=1}^{n} \left[ \sum_{j=0}^{r_k} \binom{M(T)}j \right], \qquad M(T)=\frac{T(T+1)}2.$$ Here, activation regions are the nonempty, full-dimensional realization sets of complete spike sequences. Each such set is convex, so the number of activation regions also satisfies $N_k\le2^T$. **The proof accommodates both fixed time-dependent input offsets and general time-dependent weights.** The $1+q$ dimension bound under a shared projection follows from the special case in W1. We have incorporated this derivation and its $\beta=1$ assumption into Theorem A.2 and its proof (Steps 1–4) in Appendix A. The revision will also incorporate this derivation and its $\beta=1$ assumption into the main theoretical section.Response to Reviewer xEmk — Part 3 of 4
W3. The upper-bound comparison in Equation (9), the theoretical conjecture, and realizable expressivity gains
Thank you for pointing out the need to distinguish upper-bound analysis more clearly from comparisons of realizable expressivity. We introduce Equation (9) to explain the potential expressivity improvements from temporal modulation, starting from the input-partitioning constraints of fixed-weight SNNs. Prior work discusses differences in the representational mechanisms of discrete-time SNNs and ANNs and characterizes the parallel-hyperplane constraint under shared weights [1]. Under the input encoding, network architecture, and temporal budget analyzed in this work, time-dependent weights relax this geometric constraint, making richer input partitioning a reasonable conjecture with a structural basis.
Equation (9) provides theoretical insight at the level of upper bounds to motivate this conjecture; it does not prove that either upper bound is attainable. We have clarified the distinction between upper-bound analysis and realizable gains in Remark A.5 and Proposition A.6 in Appendix A. The revision will retain the upper-bound comparison and its geometric interpretation while making the wording reflect this role more accurately. The revision will align Equation (9) with the parameterization and dynamical assumptions in W1 and W2, explicitly restricting expressions involving to the special case of a shared projection. The revision will replace expressions such as “establishes” and “confirms” with wording referring to potential gains, avoiding conflation of changes in upper bounds with a strict separation in realizable capability.
Building on this, we have added the following construction as Proposition A.6 in Appendix A to provide direct evidence of realizability for this conjecture.
Construction: strict separation with the same neuron count, input dimension, and number of timesteps. Under the above theoretical setting with , take
and set
Choose the shared projection and binary routing as
(1,0)^\top, \qquad U= (-1,1), \qquad (M_1,M_2,M_3)=(0,1,1).$$ This gives $$w_1= (1,0)^\top, \qquad w_2=w_3= (0,1)^\top.$$ **This construction satisfies the compact-modulation and binary-routing constraints**; a shared projection is also an admissible choice within the time-dependent projection parameterization. For any target spike sequence $$r=(r_1,r_2,r_3)\in\lbrace 0,1\rbrace^3,$$ choose the static vector repeated as input over the three timesteps: $$x(r)= \left(r_1+\frac12,\frac18+\frac12r_2+\frac14r_3\right)^\top.$$ Let $z$ denote the second coordinate. The first-step output is $s_1=r_1$, and the post-reset potential is $u_1=1/2$. At the second step, $$s_2=H\left(z-\frac12\right)=r_2,$$ because $z\le 3/8<1/2$ when $r_2=0$, whereas $z\ge 5/8>1/2$ when $r_2=1$. At the third step, $$s_3 =H\left(2z-r_2-\frac12\right) =H\left(\frac{2r_3-1}{4}\right) =r_3.$$ The threshold decisions at all three timesteps have strictly positive margins. Thus, each target spike sequence is realized on a nonempty open input region, giving at least $2^3=8$ distinct activation regions. For the fixed-weight model under the same conditions $n=1$, $d=2$, $T=3$, and $\beta=1$, the normal vectors of all candidate boundaries are parallel, so at most $M(3)=6$ hyperplanes induce at most $7$ regions. Therefore, $$N_{\Delta}\ge 8>7\ge N_{\mathrm{Const}}.$$ **By exhibiting a realizable lower bound exceeding the baseline's upper bound, this construction rigorously proves a gain in partitioning capability under the specified setting.** The upper-bound comparison continues to provide geometric interpretation and theoretical insight, while the construction provides independent evidence of realizability. The paragraph following the proof of Proposition A.6 in Appendix A now states the scope of this comparison explicitly and distinguishes it from the experimental evaluation of parameter and computational efficiency.
Response to Reviewer xEmk — Part 1 of 4
We thank the reviewer for recognizing the motivation, method design, and experimental results of this work, and for the specific suggestions on the theoretical analysis. Our analysis aims to explain the structural constraints imposed by temporal weight sharing and explore how compact temporal modulation alleviates these constraints. In response to your comments, we have revised Appendix A to further clarify the scope of each conclusion in the revision, add the counting derivation for time-dependent inputs and weights, and rigorously distinguish the theoretical insights offered by upper-bound analysis from constructive proofs of realizable expressivity. We respond point by point below.
Thank you for pointing out this distinction between the theoretical assumptions and the actual parameterization. The original 1+q dimension bound assumes a shared projection U, whereas the actual method allows a different Ut at each timestep. The revised Theorem A.2 formulates the result uniformly using the actual rank of the weight sequence, with the shared-projection result as a special case.
For neuron k, define
\left[w_{k,1},\ldots,w_{k,T}\right], \qquad r_k=\operatorname{rank}(B_k).$$ The input currents across all timesteps depend on $x$ only through $\lbrace w_{k,t}^{\top}x\rbrace_{t=1}^{T}$. Thus, after choosing a basis for the span of these weight vectors, the neuron's complete spike sequence can be expressed as a function of the corresponding $r_k$-dimensional projection, with $$r_k\le \min\lbrace d,T\rbrace.$$ For the actual parameterization $$w_{k,t}=w_k+U_t^\top\widehat m_{k,t},$$ the projection directions can differ across timesteps, giving the general bound $$r_k\le \min\lbrace d,T,1+Tq\rbrace.$$ When $U_t\equiv U$, the time-dependent $M_t$ can still produce time-varying weights, so **the shared-projection setting retains the core mechanism of temporal modulation**. In this case, all time-dependent weights lie in $\operatorname{span}\lbrace w_k,\operatorname{row}(U)\rbrace$, yielding $$r_k\le \min\lbrace d,T,1+q\rbrace.$$ Theorem A.2 now uses $r_k$ for the general case of time-dependent projections and explicitly restricts $1+q$ to the dimension bound under a shared projection. The revision will apply the same actual-rank formulation and shared-projection restriction to Theorem 4.1 in the main text. The independent counting derivation in W2 allows time-dependent weights and therefore combines directly with this actual-rank formulation.