Energy-Optimal Electrical-Stimulation Pulses Shaped by the Least-Action Principle
Bibliographic record
Abstract
Electrical stimulation (ES) devices interact with excitable neural tissue toward eliciting action potentials (AP's) by specific current patterns. Low-energy ES prevents tissue damage and loss of specificity. Hence to identify optimal stimulation-current waveforms is a relevant problem, whose solution may have significant impact on the related medical (e.g. minimized side-effects) and engineering (e.g. maximized battery-life) efficiency. This has typically been addressed by simulation (of a given excitable-tissue model) and iterative numerical optimization with hard discontinuous constraints--e.g. AP's are all-or-none phenomena. Such approach is computationally expensive, while the solution is uncertain--e.g. may converge to local-only energy-minima and be model-specific. We exploit the Least-Action Principle (LAP). First, we derive in closed form the general template of the membrane-potential's temporal trajectory, which minimizes the ES energy integral over time and over any space-clamp ionic current model. From the given model we then obtain the specific energy-efficient current waveform, which is demonstrated to be globally optimal. The solution is model-independent by construction. We illustrate the approach by a broad set of example situations with some of the most popular ionic current models from the literature. The proposed approach may result in the significant improvement of solution efficiency: cumbersome and uncertain iteration is replaced by a single quadrature of a system of ordinary differential equations. The approach is further validated by enabling a general comparison to the conventional simulation and optimization results from the literature, including one of our own, based on finite-horizon optimal control. Applying the LAP also resulted in a number of general ES optimality principles. One such succinct observation is that ES with long pulse durations is much more sensitive to the pulse's shape whereas a rectangular pulse is most frequently optimal for short pulse durations.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".