- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes UPCSD, to use the first 30s of unlabeled neural recording to infer statistics of new days and achieve robust cross-day performance. UPCSD is evaluated offline on Link dataset over long recording days and online on edge-computing chip.
Critical strengths
- The method is straightforward yet shows robust long-term decoding performance on public datasets.
- Evaluation is conducted on edge-computing chip.
- Ablation study is conducted over major components.
Critical weaknesses
- The method section is difficult to read with many terminologies, and it is unclear what are the differences between the proposed components and common strategy like z-scoring and random noise injection.
- The related work is lacking and more recent neural decoder models need to be compared, rather than generic models like transformer and LSTM. E.g. NDT3, POSSM, POYO and SPINT
- The on-chip results section shows comparison between GPU and an edge-computing chip, rather than between different methods. It is unclear if benefit comes from the proposed methods or from using the chip.
[NDT3] Ye et.al. A Generalist Intracortical Motor Decoder. NeurIPS 2025
[POSSM] Ryoo et. al. Generalizable, real-time neural decoding with hybrid state-space models. NeurIPS 2025
[POYO] Azabou et.al. A Unified, Scalable Framework for Neural Population Decoding. NeurIPS 2023
[SPINT] Le et al. SPINT: Spatial Permutation-Invariant Neural Transformer for Consistent Intracortical Motor Decoding. NeurIPS 2025
Questions for authors
- In the ablation study why w/o State & Dynamic is close to the full model but worse than w/o State or w/o Dynamic.
- Please explain the difference between PFDC and z-scoring with the first 30s. Does normalization result in the drift reduction in Figure3?
- Are RDA doing similar augmentation as random masking and random noise injection? What are the reasons to use two white noise in RDA?
- Please explain the underlying motivation of state-dynamic tokenization. Why use linear mapping? And the choice of k seems arbitrary, is there hyperparameter tuning on the k?
- How does the recently proposed decoder models work with PFDC? All NDT3, POSSM and POYO are trained or evaluated with the similar dataset as indy-RTT.
- Are the benefits in GPU-HE200 comparison from UPCSD or the chip?
- Please define acronym at the first use, in the first section of methods.
5 comments
Response to reviewer qvFg (Part 2/5)
Q2. Please explain the difference between PFDC and z-scoring with the first 30s. Does normalization result in the drift reduction in Figure3?
A2. We thank the reviewer for this question. We would like to clarify that PFDC employs channel-wise normalization based on Z-scoring, and its contribution does not lie in introducing a new normalization operation, but rather in identifying and validating its effectiveness for long-term cross-day neural drift correction.
Specifically, PFDC uses only the first 30 s of unlabeled neural activity from each test day to estimate channel-wise means and standard deviations. These calibration statistics are then fixed and applied to all subsequent decoding, without requiring behavioral labels, future neural observations, or model parameter updates.
The drift reduction shown in Fig. 3A indeed results directly from this normalization procedure. More importantly, this reduction in statistical drift is accompanied by improvements in decoding performance. As shown in the ablation study in Table 3, removing PFDC decreases the mean daily by 0.313, 0.285, 0.302, and 0.119 across the four datasets, respectively, further supporting its contribution to robust long-term cross-day decoding.
Therefore, we emphasize that the value of PFDC lies not only in reducing cross-day statistical differences but also in improving long-term unlabeled cross-day decoding performance with minimal calibration overhead.
Q3. Are RDA doing similar augmentation as random masking and random noise injection? What are the reasons to use two white noise in RDA?
We thank the reviewer for this question. RDA is designed to simulate residual neural variability that remains after PFDC correction, thereby improving the robustness of long-term cross-day decoding. As defined in Eqs. (5)–(6), RDA combines four perturbations: channel dropout to simulate electrode channel loss, gain perturbation to simulate changes in signal amplitude, bias perturbation to simulate baseline shifts, and Gaussian noise to simulate random observation noise.
Regarding the two Gaussian terms in Eq. (6), they represent different types of neural variability rather than redundant white noise. Specifically, represents a channel-wise random bias that remains constant within a temporal window, simulating baseline shifts, whereas represents time-varying random noise, simulating instantaneous observation noise.
To further evaluate the contributions of these perturbations, we conducted additional RDA ablation experiments. On Link-CO, Link-RTT, Indy-RTT, and Jango-CO, channel dropout alone achieved mean daily values of 0.5551, 0.4615, 0.5815, and 0.8478, respectively, approaching the performance of full RDA. In contrast, removing channel dropout reduced performance to 0.4392, 0.3830, 0.5186, and 0.8026, respectively.
| Dataset | Full RDA | w/o RDA | Dropout Only | w/o Dropout |
|---|---|---|---|---|
| Link-CO | 0.5680 | 0.4481 | 0.5551 | 0.4392 |
| Link-RTT | 0.4621 | 0.3871 | 0.4615 | 0.3830 |
| Indy-RTT | 0.5879 | 0.5036 | 0.5815 | 0.5186 |
| Jango-CO | 0.8492 | 0.8034 | 0.8478 | 0.8026 |
These results indicate that channel dropout is the primary contributor to RDA's performance gains, while the remaining perturbations provide smaller complementary improvements. Full RDA achieved the highest mean daily across all four datasets, supporting the benefit of combining different perturbation types for robust cross-day decoding.
Response to reviewer qvFg (Part 3/5)
Q4. Please explain the underlying motivation of state-dynamic tokenization. Why use linear mapping? And the choice of k seems arbitrary, is there hyperparameter tuning on the k?
A4. We thank the reviewer for this valuable question. The motivation for State–Dynamic tokenization comes from our observations of local neural dynamics. As illustrated in Fig. 3B, the slowly varying state exhibits relatively smooth temporal trajectories, whereas the dynamic component captures distinct local fluctuations. We therefore employ weighted local linear fitting to extract the underlying activity level and temporal trends, allowing these components with different temporal characteristics to be modeled separately. Local linear fitting does not assume globally linear neural dynamics, but provides a computationally efficient approximation of local activity evolution. The ablation results in Table 3 further support the additional decoding benefits of this structured representation, although the improvements are relatively modest.
Regarding the choice of window length , we conducted additional sensitivity analyses using 15, 31, and 45 bins. The results reveal dataset-dependent preferences: Link-RTT performs best with a shorter window, Link-CO with 31 bins, while Indy-RTT and Jango-CO show comparable performance at 31 and 45 bins. We therefore selected as a unified intermediate setting, rather than optimizing the window length separately for each dataset.
| Dataset | |||
|---|---|---|---|
| Link-CO (124 days) | 0.545 | 0.568 | 0.549 |
| Link-RTT (125 days) | 0.483 | 0.466 | 0.471 |
| Indy-RTT (21 days) | 0.569 | 0.586 | 0.588 |
| Jango-CO (16 days) | 0.848 | 0.850 | 0.850 |
Furthermore, to comprehensively evaluate the decoding capability of this representation, we initially adopted a noncausal configuration that allows access to bidirectional temporal information. To meet the requirements of real-time BCI applications, we subsequently introduced causal modifications to the local fitting window, temporal convolutions, and LSTM, resulting in a strictly causal configuration that relies only on current and past neural activity. We validated this configuration through real-time online decoding experiments across 12 test days in macaques, achieving a mean daily of 0.672 0.091 (Table 2). These results further support the feasibility of State–Dynamic representation for real-time neural decoding.
Response to reviewer qvFg (Part 1/5)
We sincerely thank the reviewer for recognizing UPCSD's long-term cross-day decoding performance, ablation studies, and on-chip deployment, and for the constructive comments on our methodological design and baseline comparisons. To address these concerns, we have conducted additional comparisons with recent neural decoders (NDT3 and SPINT), ablation studies of individual RDA perturbations, sensitivity analyses of the State–Dynamic window length, and capacity-matched experiments to further clarify the rationale behind our design choices and the contributions of individual components.
We would like to emphasize that our goal is not simply to increase model complexity, but to achieve robust long-term neural decoding through a compact, efficient, and practically deployable framework. Although PFDC and RDA employ established normalization and augmentation operations, our analyses in Figs. 1 and 3, together with cross-day decoding experiments, identify and validate the important role of these simple strategies in mitigating long-term neural drift. Furthermore, the State–Dynamic representation provides additional decoding benefits, as our supplementary experiments show.
Moreover, real-world intracortical BCI systems require continuous, real-time decoding under constraints on computational resources, power consumption, and hardware compatibility. While more complex neural decoders may offer strong modeling capabilities, deploying their original architectures on low-power chips can require additional operator substitutions or architectural adaptations. To address these practical requirements, we developed a lightweight decoding framework with a causal, zero-look-ahead configuration, validated its real-time online decoding performance across 12 test days in macaque experiments, and successfully deployed the complete model on the Lynxi HE200 chip. We believe that achieving competitive long-term cross-day decoding performance while enabling short unlabeled calibration, real-time inference, and low-power hardware deployment represents an important contribution of this work.
A1. We thank the reviewer for this question. We would like to clarify that removing both the State and Dynamic branches does not eliminate temporal modeling entirely. In this ablation, the State–Dynamic tokenizer is replaced with a learnable time-step-wise projection that preserves information from the original neural activity, while the subsequent BiLSTM continues to capture temporal dependencies. Therefore, this configuration can still achieve relatively strong decoding performance.
In contrast, when only the Dynamic branch is retained, the model primarily relies on fast fluctuations relative to the slowly varying state, without access to the full slow-varying state information, leading to a noticeable performance degradation. Retaining only the State branch preserves the dominant low-frequency neural activity and generally yields better performance. The full model further integrates fast dynamic information and achieves the highest mean daily R2 across all four datasets (Table 3 in the main manuscript).
Furthermore, we conducted additional experiments with a capacity-matched direct-input BiLSTM baseline. The full UPCSD achieved improvements in mean daily R2 of 0.0262, 0.0046, 0.0168, and 0.0118 across the four datasets, respectively. These results suggest that the structured State–Dynamic representation provides additional decoding benefits, although the magnitude of its contribution varies across datasets.