A Globally Optimal Estimator for the Delta-Lognormal Modeling of Fast Reaching Movements
Bibliographic record
Abstract
Fast reaching movements are an important component of our daily interaction with the world and are consequently under investigation in many fields of science and engineering. Today, useful models are available for such studies, with tools for solving the inverse dynamics problem involved by these analyses. These tools generally provide a set of model parameters that allows an accurate and locally optimal reconstruction of the original movements. Although the solutions that they generate may provide a data curve fitting that is sufficient for some pattern recognition applications, the best possible solution is often necessary in others, particularly those involving neuroscience and biomedical signal processing. To generate these solutions, we present a globally optimal parameter extractor for the delta-lognormal modeling of reaching movements based on the branch-and-bound strategy. This algorithm is used to test the impact of white noise on the delta-lognormal modeling of reaching movements and to benchmark the state-of-the-art locally optimal algorithm. Our study shows that, even with globally optimal solutions, parameter averaging is important for obtaining reliable figures. It concludes that physiologically derived rules are necessary, in addition to global optimality, to achieve meaningful ∆Λ extractions which can be used to investigate the control patterns of these movement primitives.
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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 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.001 | 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".