A modified ensemble Kalman particle filter for non‐Gaussian systems with nonlinear measurement functions
Bibliographic record
Abstract
Abstract The ensemble Kalman particle filter (EnKPF) is a combination of two Bayesian‐based algorithms, namely, the ensemble Kalman filter (EnKF) and the sequential importance resampling particle filter (SIR‐PF). It was recently introduced to address non‐Gaussian features in data assimilation for highly nonlinear systems, by providing a continuous interpolation between the EnKF and SIR‐PF analysis schemes. In this paper, we first extend the EnKPF algorithm by modifying the formula for the computation of the covariance matrix, making it suitable for nonlinear measurement functions (we will call this extended algorithm nEnKPF). Further, a general form of the Kalman gain is introduced to the EnKPF to improve the performance of the nEnKPF when the measurement function is highly nonlinear (this improved algorithm is called mEnKPF). The Lorenz '63 model and Lorenz '96 model are used to test the two modified EnKPF algorithms. The experiments show that the mEnKPF and nEnKPF, given an affordable ensemble size, can perform better than the EnKF for the nonlinear systems with nonlinear observations. These results suggest a promising opportunity to develop a non‐Gaussian scheme for realistic numerical models.
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.003 |
| 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.000 |
| 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.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".