Neurocomputing
○ Elsevier BV
Preprints posted in the last 30 days, ranked by how well they match Neurocomputing's content profile, based on 13 papers previously published here. The average preprint has a 0.01% match score for this journal, so anything above that is already an above-average fit.
Radwan, M.; Yazidi, A.; Lind, P. G.
Show abstract
Deep learning models for electroencephalography (EEG) pathology detection achieve competitive accuracy but offer limited interpretability. In this paper, we introduce concept bottleneck models (CBMs) for EEG pathology detection which use clinical EEG biomarkers computed analytically from the signal as a bottleneck to be used for prediction. Those concepts include band power, spectral ratios, alpha peak frequency and amplitude, hemispheric asymmetry and phase locking values. With the backbone based on shallow convolutional neural network (CNN), we compare a black box baseline with two variants of CBMs. The hybrid variant is a classifier receives a residual projection of the backbone features. The pure variant is a CBM where the classifier receives only the predicted concepts. Models are evaluated on abnormality detection and dementia classification followed by concept prediction quality and leakage analysis. Both CBMs approach the baseline on TUAB (82.7-82.9% vs 83.6%) and are 2-5 percentage points lower on CAUEEG (57.9-60.5% vs 62.7%). The pure CBM exhibits concept fidelity concern where the predicted concepts deviate from their ground truth values. Replacing them with their true values causes severe cost on accuracy by 26 and 22 points on TUAB and CAUEEG. The concept fidelity concern is mitigated by increasing the weight of the concept loss to match the ground truth concepts. the mitigation comes with small accuracy cost on TUAB but a relatively larger cost on CAUEEG. The code of the experiments and full logs are available at https://www.github.com/mhmdrdwn/cbm.
Sacchi, L.; Sommariva, S.; Unkel, M. A.; De Vrij, F. M.; Campi, C.
Show abstract
From a statistical point of view, clustering spike time-windows from multi-electrode arrays (MEAs) recordings is a challenging high-dimensional, unsupervised clustering task where stationarity, commonly assumed in standard time-series analysis, is often violated and for which a gold standard is currently unavailable. Here we aim at providing practical guidance on how to cluster this type of data by systematically comparing 108 clustering pipelines differing along three main dimensions: (i) the data feature space; (ii) the metrics used to quantify distance between data points; and (iii) the clustering algorithm. For our benchmark we used both labeled synthetic data, mimicking four physiologically-inspired classes of spike time-windows, and a set of real MEAs recordings from a two-dimensional in-vitro neural culture. The performance of the competing pipelines was evaluated in terms of balanced accuracy and computational time when analyzing the synthetic datasets, while the Silhouette score was used for the real dataset, where no ground-truth is available. Overall, our analysis shows that the best combination is formed by k-means with Euclidean distance applied after Principal Component Analysis (PCA) of the spike time-windows. Conversely, hierarchical clustering showed the highest computational burden, while Independent Component Analysis and kernel PCA provided less effective noise suppression.
Kerr, W. T.; Pellinen, J.; McFarlane, K. N.; Goldenholz, D. M.
Show abstract
Significance: There is potential for generative artificial intelligence (AI) to perform "full stack" academic publishing, including comprehensive manuscript fabrication, "peer"-review, and editorial decision making. This study evaluated the benefits and cautions in using AI for full stack academic publishing in clinical research about seizures. Methods: Three epileptologists each selected 1 published manuscript in Epilepsia and produced an AI-fabricated manuscript about seizures. AI tools were then used to perform "peer"-review and make editorial decisions with minimal human supervision. The rates of identifying AI-fabricated manuscripts and editorial decisions among the epileptologists was analyzed, and epileptologists' observations on how AI differed from typical human "peer"-review and editorial decisions was collected. Results: Four of 6 (67%) pairs of AI-fabricated and human-generated manuscripts were correctly identified. Only 1 AI-fabricated manuscript was editorially rejected, whereas another had a subtle indicator of fabrication. When compared to human content, AI generated content was comprehensive, detailed, and based on the highest standard of academic publication. However, generated content was more verbose, used more structured responses, and more critical feedback. Conclusions: These results demonstrate that the quality of AI-fabricated manuscripts about clinical research in seizures was sufficiently high that the current methods of peer and editorial review could not easily distinguish fabricated content compared to human-written content. Moreover, AI review and editorial decisions were high quality and appeared reasonable in many cases. AI tools have matured to the point that there should be thoughtful policies that permit AI assistance but prohibit insufficiently supervised autonomous scientific submissions, reviews, and editorial decisions.
Huang, Y.; Lankarany, M.; D'Eleuterio, G.
Show abstract
Emerging research on desynchronization reveals strong relations to memory formation and recollection with much of the evidence originating from studies of the hippocampus, a brain region central to memory processing. However, growing evidence emphasizing the role of desynchronization is accompanied by challenges, most notably the synchronization/desynchronization conundrum. The conundrum arises from an apparent contradiction between learning and Shannon's information theory: spike-timing-dependent plasticity (STDP) acquires information via synchronized populational activity whereas information theory suggests that information channel is encoded through higher variability. Both frameworks are well-founded. Learning is widely accepted as the mathematical abstraction of STDP while Shannon's information theory showcases its power ubiquitously across fields from communication systems to neuroscience. Here, we propose that learning and Shannon's information theory are not necessarily opposing principles. Rather, learning plays a critical role in the process of synchronization and desynchronization. To justify our claim, we conduct computational simulations based on a Hodgkin-Huxley neuronal model coupled with NMDA, AMPA, and GABA synapses with inputs of biologically realistic spiking data. Our results show that enabling STDP significantly influences synchronization and desynchronization dynamics. Specifically, we find that STDP and desynchronization form a regulatory loop, in which STDP regulates the level of synchrony, and synchrony regulates subsequent learning strength. Further study reveals STDP is capable of switching neurons from synchronization to desynchronization. This framework mitigates the synchronization/desynchronization conundrum by clarifying the relationship between desynchronization and learning, and offers a new perspective on how synchrony contributes to memory formation and recollection.
Moreno-Gris, A.; Godin, C.; Thivierge, J.-P.
Show abstract
Electrical stimulation of brain activity has emerged as a key therapeutic intervention for neurological diseases. The success of these approaches relies on precisely tuned stimulation parameters. A major challenge is that these parameters should ideally be adjusted in real-time based on changes in brain activity. Closed-loop controllers address this challenge by monitoring brain activity and adapting stimulation according to ongoing changes in neural dynamics. While machine learning has been helpful in this context, closed-loop controllers typically do not adapt in real-time to fluctuations in brain activity. Here, we propose a novel framework based on reservoir computing to train a closed-loop, real-time neural controller. This approach, termed CLEAR-FORCE, trains the output weights of a recurrent network based on a combination of target signals and feedback from brain activity. Two series of simulations were performed, where the controller was successful at (1) inducing neural oscillations in a population of spiking neurons and (2) suppressing pathological oscillations. This framework provides a promising avenue for the implementation of neural controllers in low-powered, real-time, and adaptive hardware that harnesses machine learning for the personalized treatment of brain disorders.
von Wegner, F.; Hermann, G.; Toedt, I.; Todtenhaupt, I. K.; Laufs, H.
Show abstract
Microstate analysis studies dynamic brain activity through a discrete representation of electroencephalographic (EEG) signals and their topography. While the body of literature describing findings in diverse experimental and clinical settings is growing rapidly, the effects of several core components of the microstate algorithm are still insufficiently understood. This study systematically investigates how two common temporal smoothing algorithms, parametric smoothing and GFP peak interpolation, influence a wide range of microstate sequence parameters, and how they shape the integrated picture of brain dynamics inferred from these metrics. We study eyes-closed resting-state EEG recordings from N=201 healthy subjects from a public EEG database. For the elementary temporal metrics, we find that widening smoothing windows markedly increase microstate duration, reduce occurrence rates, but leave coverage mostly unaffected. In terms of simple syntax properties, smoothing windows above 30 ms yield an inconsistent picture with a memoryless, first-order Markov structure at short time scales, but a positive Hurst phenomenon suggestive of long-range correlations at long time scales. Evidence of asymmetry and non-equilibrium dynamics are suppressed by smoothing. At intermediate time scales, microstate periodicity was only observed up to a window size of 28 ms. Smoothing had a strong impact on the complexity metrics entropy rate and excess entropy, decreasing the former and increasing the latter. For most metrics, the effects of GFP peak interpolation were comparable to those of smoothing windows in the range between 28 ms and 44 ms. In conclusion, elementary and higher-order microstate parameters must be interpreted in the context of preprocessing, as many parameters change continuously with smoothing intensity. This limits the comparability of microstate parameters obtained with different preprocessing settings. Strong smoothing with a window size above 30 ms or GFP peak interpolation yields a fundamentally different picture of resting state brain dynamics, i.e. that of a memoryless, aperiodic, time-reversible first-order Markov chain. Since insights from other neurophysiological modalities suggest that time series memory and time-irreversibility are markers of normal brain activity, our recommendation is to avoid intense smoothing to minimize alterations of the initial sequences.
Liang, A. -; van Drongelen, W. -; Nordli, D. R.
Show abstract
Based on the observation that in normal EEG rhythms, the low-voltage beta frequencies dominate in the anterior region while characteristic high(er)-amplitude slower rhythms manifest more posteriorly, we studied these gradients across normal subjects and patients with different monogenic epilepsies. From large data sets (long term records of 374 controls and 241 patients) we selected 60s eyes-open rest-EEG epochs to determine the spectral power of the EEG bands. To help manage the large data sets and facilitate analyses, we employed AI to preselect and assist in coding. While both preselection and coding was extensively verified and validated by the authors, which was a time-consuming effort, the AI contribution reduced the net effort of evaluating the large dataset. We developed a metric that reflects the anterior-posterior gradients of the beta rhythm and the so-called posterior dominant rhythm. Our results indicate that this simple gradient measure across 1-10 year-age groups may provide a robust quantitative biomarker of cerebral dysfunction in monogenic epilepsy. Because EEG is noninvasive, widely available, repeatable, and relatively inexpensive, such a biomarker could ultimately provide a practical means of assessing the cerebral effects of emerging targeted therapies across multiple genetic epilepsies.
Guet-McCreight, A.; Hay, E.
Show abstract
Biophysically detailed models of human cortical microcircuit provide key insights into brain function and disease biomarkers, yet their computational cost lengthens simulation runtime and limits scalability. To address this, we systematically evaluated recent simplification methods for morphological reduction and synapse merging in terms of preserving spiking and electroencephalographic (EEG) properties of human cortical microcircuit models. At the single- cell level, reduced compartmental models accurately reproduced spiking behaviors. However, at the microcircuit level, while achieving a 5-fold speed-up, morphological reduction failed to preserve spectral dynamics of spiking and EEG despite maintaining average baseline and response firing rates. Conversely, applying synapse merging alone on the full morphology successfully reproduced both spiking activity and EEG dynamics, when constrained to [≤] 50 m spatial intervals, and yielded a 2-fold speed-up. These results were consistent across both cortical layer 2/3 and layer 5 models, and in depression models with reduced somatostatin interneuron inhibition. Our study identifies model simplification methods that speed up cortical microcircuit simulations while preserving the accuracy of the simulated brain signals.
Dendorfer, A.; Luppi, A.; Poli, F.; Mousley, A.; Astle, D.; Fakhar, K.
Show abstract
A central goal of neuroscience is to establish how similar (or different) brain networks are across individuals, development, psychiatric conditions, and even between biological and artificial brains. Whenever one such comparison is made, it relies on the assumption that we have a measure that produces an accurate and plausible similarity score. Yet, the field lacks one such measure, and the wide variety of existing measures often produces conflicting results. To address this problem, we perform a systematic comparison of 16 established similarity measures. First, we show that different measures consistently disagree on which brain networks are most similar. Second, we rank all measures according to multiple criteria such as biological plausibility, computational efficiency, and sensitivity. We show that DeltaCon is the most accurate measure in terms of parameter recovery, and that it ranks among the fastest and most noise-tolerant. For this reason, we conclude that DeltaCon is the best general-purpose similarity measure. However, no measure ranks best on more than two of the five criteria we assessed, and different measures should be preferred depending on the exact research question. Measure selection can now be made on evidence and should be a crucial decision in any study that compares brain networks.
Dimitriadou, C.; Furl, N.
Show abstract
Independent component analysis (ICA) is widely used to remove artefacts from EEG and TMS-EEG recordings, but the components that correspond to artefacts are usually identified by manual inspection, which is subjective and difficult to reproduce. Existing automated classifiers are either designed for ordinary EEG and do not target the artefacts specific to concurrent transcranial magnetic stimulation, or are built on EEGLAB, so none is available for FieldTrip-based pipelines. We present TEFAR, a lightweight, configurable framework for semi-automatic artefact-component classification that applies the same detectors to ordinary EEG and TMS-EEG. TEFAR is built on FieldTrip and requires no additional MATLAB toolboxes. Each artefact class (line noise, blinks, lateral eye movements, cranial muscle, cardiac activity, and the TMS decay and recharge artefacts) is identified from the spectral, spatial, or temporal signature that its components are known to express. Detection thresholds use robust statistics (the median and the median absolute deviation rather than the mean and standard deviation), so that a single dominant artefact component cannot raise the threshold that is meant to detect it. In 30 ground-truth simulations, TEFAR reached a specificity of 1.000 and a sensitivity of 0.96-0.97 for both profiles. An application of TEFAR to real EEG and TMS-EEG recordings is the next step and will be reported separately.
Chen, Z.; Ren, Y.; Zhang, W.-H.
Show abstract
Recurrent cortical circuits are hypothesized to perform Bayesian posterior sampling through their stochastic dynamics. Yet identifying which sampling algorithm a circuit intrinsically implements, as opposed to mapping manually designing algorithms onto circuits, requires rigorous theoretical analysis of the biological circuit dynamics, and remains a fundamental open challenge because of the analytical intractability of nonlinear recurrent dynamics. Here, we tackle this challenge through comprehensive theoretical analysis of analytically tractable nonlinear recurrent circuit dynamics used in neuroscience research-- the continuous attractor network (CAN). Surprisingly, we find that the circuit, without any non-Gaussian components in its connectivity or internal variability, intrinsically emerges heavy-tailed subspaces dynamics described as scale-mixture Langevin posterior sampling. The mechanism emerges from the circuits own nonlinear dynamics: divisive normalization renders the overall population activation Gamma-distributed which multiplicatively modulates the time constant of the Langevin sampling in the stimulus feature subspace. Eventually, this scale-mixture structure produces a heavy-tailed (Student-t) sampling step size distribution, significantly accelerating the sampling speed. Moreover, the scale-mixture Langevin sampling approaches a Levy-like regime in the weak input limit. Our results analytically identify an intrinsic circuit algorithm embedded in subspaces of nonlinear recurrent dynamics, and establish a minimal circuit mechanism for endogenous heavy-tail statistics without any explicit non-Gaussian components.
Matsubara, T.; Koda, R.; Richardson, M.; Stufflebeam, S.
Show abstract
Objective: We developed a patient-specific framework to determine which information about interictal epileptiform discharges (IEDs) can be recovered from scalp EEG, separating temporal localization (where) from event-specific intracranial waveform reconstruction (what). Methods: Six subjects from a public simultaneous high-density scalp EEG and intracranial EEG (iEEG) dataset were analyzed using patient-specific dual-branch convolutional-attention models integrating waveform/topographic and time-frequency representations. For the where task, a 640-ms scalp EEG segment was divided into eight 80-ms bins, and the model predicted the bin containing the intracranial IED peak. For the what task, a 250-ms peak-centered iEEG waveform was represented as a fixed patient-specific template plus an event-specific residual predicted from scalp EEG. Direct scalp-input controls and event-clustered bootstrap confidence intervals were used to distinguish scalp-dependent information from template-driven performance. Results: Where accuracy varied markedly across subjects (0.080-0.984), with an unweighted subject-level mean of 0.333 versus a chance level of 0.125; 95% confidence intervals were above chance level in three of six subjects. Input-control analyses supported a scalp-dependent contribution in subjects with successful localization. For the what task, mean waveform correlation was 0.752 for the model and 0.754 for the fixed patient-specific template (mean difference, -0.002), while residual correlations were generally modest (-0.020 to 0.378). Conclusion: Scalp EEG contained recoverable temporal information in some subjects, but event-specific single-contact morphology was not consistently recovered beyond the patient-specific template. Separating temporal localization from template-based waveform reconstruction provides a more stringent framework for evaluating noninvasive-to-intracranial inference and reduces conflation of prior-driven similarity with input-dependent reconstruction.
Ahmadkhanloo, M.
Show abstract
The Hierarchical Gaussian Filter (HGF) is a hierarchical Bayesian model of learning under uncertainty and volatility, with a widely used MATLAB implementation. We present HGFX 1.0.0, a Python/JAX toolbox whose primary objective is validated behavioral and numerical compatibility with a frozen HGF Toolbox 8.2.0 reference, while removing MATLAB as a user-runtime dependency. Reimplementation is treated as a validation problem rather than source translation: configuration semantics, parameter transforms, forward trajectories, observation likelihoods, objectives, fitting and statistical surfaces, simulation workflows, official demo behavior, model selection, and backend agreement are compared against the pinned oracle under predeclared tolerances. Two official MATLAB demo workflows reproduce the reference at frozen trajectory tolerances, including a regime in which classic HGF encounters negative posterior precision while eHGF completes successfully. In paired model-selection validation, all 36 BIC winners agree between MATLAB and HGFX. Physical NVIDIA GPU applicability was confirmed on two Tesla T4 devices, with a maximum CPU-versus-GPU final-objective difference of 1.42e-14 against a frozen 1e-7 criterion. Historical parameter recovery results that did not meet predeclared criteria, together with exact MATLAB/HGFX limitation matches, are preserved and are not reclassified as scientific success. A prospectively gated comparison with pyhgf 0.3.2 shows binary64-scale agreement on mapped perceptual trajectories in one authorized three-level binary-HGF cell, while participant-response negative log-likelihood is retained as not directly comparable. HGFX therefore provides a MATLAB-independent Python implementation with an explicit evidence model that separates direct parity, matched reference limitations, backend applicability, and future performance claims.
Mittag, M.; Bird, A. D.; Mongiat, L. A.; Roth, A.; Cuntz, H.; Jedlicka, P.
Show abstract
The dentate gyrus' principal neuron, the granule cell (GC), plays a key role in pattern separation, transforming similar inputs into dissimilar outputs. We used a new measure based on information theory to evaluate this transformation in an experimentally derived in silico GC model with realistic ion channel distributions across its dendrites. We found that model performance aligned well with current-clamp recordings from mouse brain slices. However, it was also possible to find artificial parameter combinations in the model that functionally outperformed the recorded cells while matching their action potential shapes. Rather than maximising computational power, the biologically realistic GC model balanced energy efficiency against increased functionality in a Pareto optimal way: No possible parameter combination was found to improve one of the objectives without impairing the other. Interestingly, immature GCs adopted a different weighted trade-off with a stronger emphasis on energy efficiency than pattern separation, but they remained Pareto optimal over their putative developmental trajectory. Our results support the idea that evolution favours neurons that can satisfy functional and energetic demands simultaneously.
Mayer, P.; Kozlov, A.
Show abstract
Simplified spiking neuron models such as the Adaptive Exponential Integrate-and-Fire (AdEx) model reproduce the firing behaviour of diverse neuron types at a fraction of the cost of biophysically detailed models, making them attractive for large-scale brain simulation. Fitting their parameters to recordings, however, still relies on derivative-free search such as grid search or evolutionary algorithms, because the discrete spike-and-reset mechanism renders these models non-differentiable. Surrogate gradients, used in deep spiking networks, replace the spike derivative with a smooth approximation on the backward pass. Whether they also enable efficient gradient-based parameter estimation for single simplified neurons is untested. We implement a differentiable AdEx model with a surrogate-gradient variant in the Jaxley framework. The implementation is on par with target-compiled C++ Brian2 code while remaining end-to-end differentiable, vmap-batchable and GPU/TPU-portable. It is 200 times faster than Brian2's default runtime mode. Across a recovery-radius benchmark of 2,700 paired runs, gradient-based fitting never matched a gradient-free Nelder-Mead baseline. At sub- threshold levels, gradient descent instead beats Nelder-Mead. The obstacle is therefore the spike mechanism and the loss geometry it induces, not gradient descent itself.
Jeon, H.; Park, I. M.
Show abstract
Online identification of nonlinear dynamical systems faces two challenges. Noisy, partial observations make the latent state difficult to estimate. Local attractors can also keep passive trajectories in regions that reveal little about the unknown dynamics. Both challenges commonly arise in closed-loop neural experiments where stimulation must be chosen from noisy spike counts, while neural activity may remain near a stable state unless stimulation drives it elsewhere. We address this problem by actively selecting inputs to collect informative observations during the experiment. We introduce PALDI (Planning-based Active Latent Dynamics Identification), which combines extended-Kalman state prediction, single-step Laplace state updates, blockwise Gaussian parameter updates, and finite-horizon planning. Its parameter expected-information-gain surrogate combines dynamics sensitivity with state Fisher information and discounts apparent parameter information when latent states are uncertain. We compare PALDI with nonadaptive inputs, a myopic policy, and two active baselines: the one-step D-optimal method FLEX and receding-horizon curiosity with uncertainty sampling. On a bistable Wilson-Cowan model of excitatory and inhibitory populations, PALDI approaches the true-model reference and remains strongest as the observation signal-to-noise ratio decreases or the readout geometry becomes biased. We then test identification in a spiking decision network where we use a reduced dynamics and observation model to approximate the data-generating process. PALDI reaches a median held-out prediction R2 of 0.90, close to a fitted reference, and its model gives the highest change-of-mind success among identification policies. Information-guided finite-horizon planning is a practical strategy for identifying neural circuit dynamics with closed-loop stimulation.
Garrison, E. K.; Sotero, R. C.; Orlandi, J. G.; for the Alzheimer's Disease Neuroimaging Initiative,
Show abstract
Brain network organization emerges from ongoing network dynamics that continuously create, maintain, and reorganize connectivity patterns. At both the structural and functional levels, these dynamics shape network evolution throughout the lifespan. Here, we introduce a data-driven framework based on Stochastic Actor-Oriented Models (SAOMs), which model longitudinal network changes as a process of local edge formation and dissolution driven by local-connectivity factors. Applied to functional and structural brain networks from an aging cohort, the resulting models recovered a set of interacting mechanisms that collectively promote hub formation, short-range connectivity, and modular organization. These factors were derived through a novel data-driven factor-selection procedure rather than specified a priori, allowing network mechanisms underlying longitudinal change to be identified directly from observations. Functional networks exhibited substantially higher rates of change than structural networks, suggesting more frequent opportunities for network maintenance and reorganization. Structural networks additionally showed despecification in the hub-forming mechanisms with cognitive impairment. These results support a view of brain network organization as an actively maintained process emerging from ongoing local connectivity dynamics. More broadly, this framework provides a general approach for studying longitudinal network dynamics through the estimation of network-generating mechanisms over time.
Buchheit, B.; Robin, Y.; Schneider, E. N.; Alayan, M.; Strauss, D. J.
Show abstract
Despite the use of technological countermeasures, studies show that the sensory conflict, and thus symptoms of motion sickness such as nausea, cannot be completely prevented while traveling as a car passenger. Accordingly, reliable prediction of motion sickness will represent a possible solution for intelligent vehicles to avoid the abortion of the drive, e.g., through adapted driving strategies or route planning. In previous works, the authors were able to demonstrate an application-oriented parameter set for the popular 6DOF-SVC model to estimate motion sickness incidence (MSI) in passengers with a lowered gaze on a non-driving-related task. In the current study, these parameters were validated and further optimized using five previous conducted motion sickness driving experiments. For the first time, it is also shown that the expected natural MSI fluctuations based on the driving dynamic profile, due to route characteristics or driving style, as well as the variation in experimental determined MSI is approximately 10%. Moreover, findings indicate that the participants appear to have an individual MSI threshold that correlates with their susceptibility to motion sickness, however, this threshold fluctuates too strongly across experiments to be suitable for practical application. As a result, the model can successfully estimate motion sickness risk across the test tracks, however, inaccuracies in the predicted MSI trajectories remain.
Osman, M. A. M.; Zhang, W.; Pehlevan, C.; Wilson, R. I.
Show abstract
We present a network model that enables a navigating agent to shape the spatial and temporal structure of its paths through its environment. The model is inspired by the insect fan-shaped body. In it, a recurrent neural network receives an input that encodes an agent's velocity vector. Meanwhile, network activity determines the setpoint of a control loop that influences this velocity vector through motor outputs. The network thus guides future movement using memory of past movement. We illustrate how the network's dynamics determine the trajectory features it extracts to produce the setpoint. We then relate the joint dynamics of network activity and the agent's velocity vector to the structure of the resulting paths. This network can produce paths suitable for different forms of exploration. It can also stabilize movements initiated by lower-level systems. Our analyses illustrate how recurrent neural dynamics and memory can shape behavior when embedded in closed loops.
Feng, Z.; Cao, F.
Show abstract
Training spike detectors on real recordings is challenging because algorithmically generated labels can be noisy and incomplete. We propose VanillaSort, combining multichannel detection with spatially augmented, template-guided clustering. VanillaDet uses visibility-aware masking, truncated Gaussian targets and a temporally tolerant positive-bag loss, followed by conditional event-SNR gating. VanillaCluster combines HuiduRep embeddings with relative-amplitude features for Gaussian mixture clustering and refines assignments using cross-fitted waveform templates built from selected core events. VanillaDet improves detection accuracy over SimSort by two and three percentage points on the static and drift subsets of Hybrid Janelia, respectively. The complete pipeline also improves sorting performance over the corresponding HuiduRep baselines. These results support learning from imperfect real-data labels and incorporating waveform consistency into neuronal assignment.