Improper Complex-Valued Multiple-Model Adaptive Estimation
Bibliographic record
Abstract
Motivated by the problem of estimating the discrete and continuous states of an improper complex-valued stochastic hybrid system, the paper proposes a class of widely linear (augmented) multiple model adaptive estimation algorithms, referred to as the C/MMAE. We show that for an improper complex-valued signal, pseudo-covariance of the innovation sequence is not zero and, therefore, carries useful statistical information regarding the unknown behaviour mode of the hybrid system. A new Bayesian law is, therefore, derived as a function of the pseudo-covariance of the innovation sequence and used to compute the probability that a hypothesized model is in effect at a certain time. We show that the C/MMAE, which uses the new Bayesian law and utilizes the complete second-order statistical characterization of the complex-valued innovation sequence, convergencies faster than its counterpart, which only uses the conventional covariance of the innovation sequence. In order to simplify the computational complexity, we develop two circularized versions of the C/MMAE using a preprocessing step, referred to as the circularizing filter (CF). The CF is incorporated to convert the improper observations/innovations into the proper ones in order to reduce the computational complexity of the hypothesis testing step. Finally, an interacting version of the C/MMAE, referred to as C/IMM, is developed for improper complex-valued systems with Markovian switching coefficients. Simulation results indicate that the proposed hybrid estimators provide improved performance and convergence properties over their traditional counterparts.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| 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.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".