- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes X-SPK for causal discovery from multivariate time series. Each variable is processed by a fixed recurrent reservoir and converted into spikes at a shared target rate. A winner-take-all rule accumulates evidence from spike timing to score directed edges, without backpropagation. The authors provide a theoretical argument connecting event-timing asymmetry to causal direction under specific assumptions. Results show promising edge ranking on some nonlinear datasets.
Critical strengths
The combination of fixed reservoirs, equal-rate spike encoding, and competitive temporal updates provides a good way to score directed relationships without backpropagation. The self-channel competition is an useful design choice: it makes other channels compete against the target’s own recent activity when assigning credit. The comparison with a simple event-precedence score on identical reservoir features is informative. X-SPK improves AUROC on seven of eight tested TimeGraph settings, providing evidence that the competitive trace mechanism adds useful ranking information beyond the reservoir representation alone. This supports the proposed readout, although the gains in thresholded graph recovery are less consistent.
Critical weaknesses
-
Each reservoir state is reduced to its norm and then a binary spike. The paper does not show that this preserves causal direction. Lemma 3.1 assumes the cause increases the effect’s reservoir norm, without establishing when this holds after random encoding.
-
Winners depend only on fixed spike traces and self-bias, never on the learned weights. Training therefore accumulates discounted win counts. Synthetic pretraining changes the initial scores but not subsequent credit assignment, making its claimed role in learning causal discrimination unclear.
-
The main proof fails in the two-variable case. It requires , which exceeds one when . It also treats each true parent as the strongest external competitor, although the preceding lemma only compares it against non-causal variables. The argument therefore does not establish the result for either two-variable or general multi-parent systems.
-
Equation 22 treats weights as cumulative counts, while Equation 7 discounts previous updates. With fixed decay, more data does not generally make the estimate concentrate as a sample average would. The later claim of asymptotically correct orientation is therefore unsupported.
5.Each target event credits only one channel, even when several variables jointly cause it. A stronger parent can suppress a weaker one, and an independent distractor can change existing edge scores. The paper does not establish when this competition preserves the causal graph.
- Every time step above threshold produces a spike, so sustained excursions generate repeated spikes and large traces. Equal spike rates do not remove this difference. Controls that vary persistence while keeping the causal graph fixed are needed to distinguish this effect from the proposed causal mechanism.
Questions for authors
-
How should the proof of Theorem 3.3 be corrected for , where it requires , and for multiple parents, where a true parent need not be the strongest competitor? Does the claimed result still hold under the stated assumptions?
-
Equation 22 omits the weight decay used in Equation 7. What guarantee holds for the actual discounted estimator, and does the claim of correct orientation with probability approaching one survive fixed decay?
-
Under what conditions does a causal relationship in the original variables produce the reservoir-norm increase required by Lemma 3.1? Do the existing experiments distinguish this mechanism from differences in autocorrelation or above-threshold excursion duration?
-
Do the gate weights affect any later credit assignments in the implementation? If not, how does synthetic pretraining improve causal discrimination beyond changing the initial edge scores?
Corrected proof and the exact zero-lag condition (persistence ordering)
Thank you. Your points are precise and four identify real errors: Theorem 3.3 at D=2 and with several parents, Eq. 22, the description of the gate, and the persistence confound.
1. Lemma 3.1 (does thresholding preserve direction?) Not unconditionally, and the appendix does not prove it. We replace it by an explicit assumption (A4): the cause raises the effect's spike probability lag by lag, and a channel with no causal path to the target stays at its base rate. We make no claim for arbitrary nonlinear or inhibitory encodings.
2. Gate weights and pretraining. You are right. The winner at a firing of j is the argmax of the decayed traces (plus a self bias) and never reads W, so W is a write-only accumulator of decayed win counts. More training cannot change who wins; pretraining only shifts the initial W. We describe X-SPK as a decayed precedence statistic with competitive credit, not as a system that learns its dynamics, and report pretraining as an optional prior with an ablation.
3. Theorem 3.3. Both objections hold. At D=2, pi_ij = pi_ji = 1, so "pi_ij > 1/(D-1)" is false. The trace-dominance lemma beats only non-causal externals, so it fails when j has another parent of equal or larger elevation. And "self is independent of the externals" fails, since i's spikes drive j's own. Revision (new appendix): the theorem is stated for D >= 3, i a leading parent of j and j not upstream of i; a swap-coupling lemma conditional on self losing replaces the false step; the conclusion is that i beats j in win probability and, in the population limit, in the thresholded ratio W_ij/W_jj. Two assumptions are idealizations: self-decoupling and comparable self-predictability q_j <= q_i. Self-decoupling fails in part: over 168 unidirectional true edges the Spearman correlation between the target's self trace and the parent's trace at the target's firings has mean 0.11 but ranges from -0.53 (Lorenz) to 0.43-0.70 (TimeGraph c-series). At D=2 it reduces to q_j < q_i; several parents are covered only for a leading parent.
4. Eq. 22 vs Eq. 7. Agreed. Eq. 7 applies a column decay (1 - lambda), lambda = 5e-4, at every firing of j; Eq. 22 omits it. We replace Eq. 22 by the decayed sum; W_ij and W_jj share the discounts, so the ratio compares equally discounted counts. "Orientation probability -> 1" is restricted to N_j << 1/lambda = 2000 firings (about 100 here; omitted factor about 0.95).
5. One credited channel per event. A stated limit: credit is a shared budget, so a strong parent can suppress a weaker one. The competition is an explaining-away heuristic tested empirically, not guaranteed.
6. Persistence. You are right, and the issue is larger than posed. Mechanism: channels fire equally often, so at lag 0 a pair differs only in clustering. In our SCM (effect = cause + independent noise) the cause keeps long bursts (about 4.3 spikes), a fast-noise effect is fragmented (1.5-2), and the gate credits the persistent channel. The effect's first spike is not later (-0.3 steps), so our original explanation (a noisier effect spikes later) is withdrawn. Condition: at zero lag direction is correct when the observed cause is more persistent than the observed effect and reversed otherwise (exact: the effect's autocorrelation is a variance-weighted average of the cause's and the noise's). At fixed SNR it falls from 0.95 to 0.25 (driver AR 0.9) and from 0.80 to 0.05 (AR 0.5) as the effect's noise becomes as coherent as the cause; a plain autocorrelation comparison matches X-SPK at zero lag. Benchmarks: that ordering, with no adjacency information, matches or beats X-SPK's off-diagonal AUROC on Lorenz (1.00 vs 1.00) and Mackey-Glass (0.98/0.84/0.58/0.79/0.69 vs 0.65/0.66/0.57/0.69/0.52 across the five topologies): the source is the more persistent channel on 86-100% of true edges (68% in one), so these benchmarks are persistence-sortable like varsortability. We add the baseline everywhere. TimeGraph is not explained by it (0.41-0.48 vs 0.54-0.74) but is weak evidence (5 windows per set). Where precedence helps: with lag >= 1 inside the trace memory it is an independent cue (white driver, L=1-2: 0.90-1.00 vs 0.50-0.70 for autocorrelation rules), but this is not a comparison with a lead-lag baseline, and we claim no advantage beyond persistence. What stands: the repaired theorem and the identifying condition give a checkable account of when direction is right, and the condition correctly predicts the reversal (0.95 to 0.25). Given event times, the competition recovers direction irrespective of response waveform (AUROC 1.00 at lag 2, robust to 20% missed and 20% false events), which is what the event interface is for.
Questions. Q1, Q2: see 3 and 4. Q3: see 1 and 6. Q4: see 2.