A Computational Study of Spike Time Reliability in Two Types of Threshold Dynamics
Bibliographic record
Abstract
Spike time reliability (STR) refers to the phenomenon in which repetitive applications of a frozen copy of one stochastic signal to a neuron trigger spikes with reliable timing while a constant signal fails to do so. Observed and explored in numerous experimental and theoretical studies, STR is a complex dynamic phenomenon depending on the nature of external inputs as well as intrinsic properties of a neuron. The neuron under consideration could be either quiescent or spontaneously spiking in the absence of the external stimulus. Focusing on the situation in which the unstimulated neuron is quiescent but close to a switching point to oscillations, we numerically analyze STR treating each spike occurrence as a time localized event in a model neuron. We study both the averaged properties as well as individual features of spike-evoking epochs (SEEs). The effects of interactions between spikes is minimized by selecting signals that generate spikes with relatively long interspike intervals (ISIs). Under these conditions, the frequency content of the input signal has little impact on STR. We study two distinct cases, Type I in which the f-I relation (f for frequency, I for applied current) is continuous and Type II where the f-I relation exhibits a jump. STR in the two types shows a number of similar features and differ in some others. SEEs that are capable of triggering spikes show great variety in amplitude and time profile. On average, reliable spike timing is associated with an accelerated increase in the "action" of the signal as a threshold for spike generation is approached. Here, "action" is defined as the average amount of current delivered during a fixed time interval. When individual SEEs are studied, however, their time profiles are found important for triggering more precisely timed spikes. The SEEs that have a more favorable time profile are capable of triggering spikes with higher precision even at lower action levels.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".