Blind Deconvolution of Hodgkin-Huxley neuronal model
Bibliographic record
Abstract
Neuron transforms information via a complex interaction between its previous states, its intrinsic properties, and the synaptic input it receives from other neurons. Inferring synaptic input of a neuron only from its membrane potential (output) that contains both sub-threshold and action potentials can effectively elucidate the information processing mechanism of a neuron. The term coined blind deconvolution of Hodgkin-Huxley (HH) neuronal model is defined, for the first time in this paper, to address the problem of reconstructing the hidden dynamics and synaptic input of a single neuron modeled by the HH model as well as estimating its intrinsic parameters only from single trace of noisy membrane potential. The blind deconvolution is accomplished via a recursive algorithm whose iterations contain running an extended Kalman filtering followed by the expectation maximization (EM) algorithm. The accuracy and robustness of the proposed algorithm have been demonstrated by our simulations. The capability of the proposed algorithm makes it particularly useful to understand the neural coding mechanism of a neuron.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".