Parameter Estimation Using a Combined Variable Structure and Kalman Filtering Approach
Bibliographic record
Abstract
A method that is often used for parameter estimation is the extended Kalman filter (EKF). EKF is a model-based strategy that implicitly considers the effect of modeling uncertainties. This implicit consideration often leads to the tuning of the filter by trial and error. When formulated for parameter estimation, the “tuned” EKF becomes sensitive to uncertainties in its internal model. The EKF’s robustness can be improved by combining it with the recently proposed variable structure filter (VSF) concept. In a combined form, the modeling uncertainties no longer affect stability, but impact the performance and the quality of the estimation process. Furthermore, the VSF concept provides a secondary set of indicators of performance that is in addition to the estimation error and that pertains to the range of parametric uncertainties. As such, the robustness of the combined method and its multiple indicators of performance allow the use of intelligent adaptation for improving the performance of the estimation process. For real-time applications, online neural network adaptation may be used to improve the performance by progressively reducing specific modeling uncertainties in the system. In this paper, a new parameter estimation method that uses concepts associated with the EKF, the VSF, and neural network adaptation is introduced. The performance of this method is considered and discussed for applications that involve parameter estimation such as fault detection.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| 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".