- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper treats the relative order of first-spike times as a representation in spiking neural networks. For a population of neurons, the full firing order can in principle encode permutations, and an ordered prefix of the first neurons gives possible codes.
The authors first derive the analytical first-spike time of an LIF neuron. They then ask whether any target firing order can be reached by adjusting the input current or the neurons' intrinsic parameters. With six neurons, they report that all 720 permutations, and all pairwise transitions between them, are reachable. They also propose a simple target-aware optimizer that adjusts membrane time constants to produce a desired order, and apply it to populations of seven and eight neurons without retraining its two constants.
The second half looks at firing-order representations for classification. The authors start with the identity of the first neuron to classify six-class synthetic data and MotionSense. They then use the ordered identities of the first two neurons in a six-neuron population to represent 30 classes from an EMNIST subset. The best class-to-order assignment, built from training-set class centroids, reaches accuracy. The paper also reports several negative results and discusses the limits of the approach.
Critical strengths
1. The paper looks at an interesting and fairly underexplored representation: the identities and relative order of several first spikes.
Going beyond a single first-spike decision to ordered prefixes gives a natural combinatorial code space. The paper separates first-spike coding from top- ordered firing identities cleanly, and its controlled experiments do illustrate some properties of the representation.
2. The authors are refreshingly open about negative results and limitations.
They report failed experiments, preregistered criteria that were not met, the weaknesses of the supervised class-to-order construction, and a correction to an earlier implementation. That openness helps the reader judge what the experiments do and don't establish.
Critical weaknesses
1. The central controllability result tells us much less than the "factorial state space" framing suggests.
The analytical first-spike time is . In the setting used by the order optimizer, , so .
Getting an arbitrary firing order by independently changing the membrane time constants then boils down to choosing a set of continuous scalars whose ranking matches the target permutation. Given this, the fact that all permutations are reachable is close to what the formula already tells you. Exhaustively checking every permutation for six, seven, and eight neurons confirms that the implementation works as intended, but it doesn't show any non-trivial learning or representational property of an interacting SNN.
This takes a lot away from what I took to be one of the paper's main technical contributions.
2. More importantly, the main classification experiments don't convincingly show a benefit from spiking dynamics or from the factorial state space.
The paper says that all neurons in the classification model share , , and . Under exactly that condition, the paper's own derivation gives .
So in the main classification setting, the relative firing order is just the ranking of the learned input currents. You could describe the model as mapping the input to learned currents and then reading off the indices of the top-ranked outputs, with the LIF first-spike dynamics supplying only a monotonic transformation that leaves the ordering untouched.
That raises a basic question: what do the spiking dynamics actually contribute to the reported results? The fact that a factorial number of permutations exists mathematically doesn't mean a learning system can make good use of them. The experiments show as much. The best 30-class EMNIST result is only , against for the reported linear model, and that best result depends on a supervised, geometry-aligned class-to-pair assignment built from labeled training-set class centroids. The paper also says its attempt to find a useful factorial structure without such a label-derived code did not work.
All in all, I think studying multi-spike order is an interesting idea, but the current results don't show that the proposed factorial representation is a substantive learning mechanism or offers enough of an advantage to meet the bar for an ICLR contribution.
Questions for authors
Q1. Beyond ranking independently adjustable continuous variables, what non-trivial property do the factorial controllability experiments establish?
In the optimizer experiment, . If each can be set independently over a wide enough interval, it seems that any permutation follows directly by assigning the target ordering to the . Could the authors clarify which part of the exhaustive controllability result would not follow immediately from this monotonic relationship?
Q2. When all neurons share , , and , what role do the LIF dynamics play in the main classification results?
In this setting, the manuscript derives . Therefore, in terms of predicted ordering, the classifier appears equivalent to directly ranking the learned input currents. Is there any classification behavior in the reported experiments that cannot be reproduced by removing the LIF first-spike transformation and using the current rankings directly?
Q3. Can the authors show that the factorial firing-order representation is useful beyond a hand-designed class-to-code mapping?
The strongest 30-class result relies on a geometry-aligned assignment constructed from labeled training-set class centroids, while the label-free factorial self-organization experiment is reported as unsuccessful. The factorial representation also performs substantially worse than the reported linear baseline. Could the authors provide stronger evidence that useful factorial structure can emerge through learning itself, rather than being largely supplied by the class-to-order assignment?
These questions concern the central claims of the paper rather than suggestions for future work. My evaluation would depend on convincing evidence that the proposed representation exploits non-trivial spiking dynamics and provides functionality beyond ranking a small number of learned scalar outputs.