Do Cost Functions for Tracking Error Generalize across Tasks with Different Noise Levels?
Bibliographic record
Abstract
Control of human-machine interfaces are well modeled by computational control models, which take into account the behavioral decisions people make in estimating task dynamics and state for a given control law. This control law is optimized according to a cost function, which for the sake of mathematical tractability is typically represented as a series of quadratic terms. Recent studies have found that people actually use cost functions for reaching tasks that are slightly different than a quadratic function, but it is unclear which of several cost functions best explain human behavior and if these cost functions generalize across tasks of similar nature but different scale. In this study, we used an inverse-decision-theory technique to reconstruct the cost function from empirical data collected on 24 able-bodied subjects controlling a myoelectric interface. Compared with previous studies, this experimental paradigm involved a different control source (myoelectric control, which has inherently large multiplicative noise), a different control interface (control signal was mapped to cursor velocity), and a different task (the tracking position dynamically moved on the screen throughout each trial). Several cost functions, including a linear-quadratic; an inverted Gaussian, and a power function, accurately described the behavior of subjects throughout this experiment better than a quadratic cost function or other explored candidate cost functions (p<0.05). Importantly, despite the differences in the experimental paradigm and a substantially larger scale of error, we found only one candidate cost function whose parameter was consistent with the previous studies: a power function (cost ∝ errorα) with a parameter value of α = 1.69 (1.53-1.78 interquartile range). This result suggests that a power-function is a representative function of user's error cost over a range of noise amplitudes for pointing and tracking tasks.
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.007 | 0.073 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| 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".