Voltage-State Estimation in Non-Gaussian Noisy Environments
Bibliographic record
Abstract
A key component in monitoring and controlling of power systems is state estimation (SE). The state-of-the art SE technologies today operate on the basis of slow varying dynamics of the current network and make simplifying linearity assumptions. However, due to the non-linear/non-Gaussian nature of power grid, there is need for more accurate and real-time algorithms. In this paper, we introduce a new SE method, the Belief Condensation Filter (BCF), that aims to achieve these measures by approximating the true distribution of the state variables, rather than a linearized version as done for instance in Kalman filtering. Through simulations we show that in the presence of non-linearities and non-Gaussian noise, our general SE framework improves accuracy over best known Kalman-like filters, such as Unscented Kalman Filter (UKF) and asymptotically exact estimators, such as the particle filter (PF). We provide two sets of experimental results. Our analysis demonstrates the advantage of using BCF over UKF in (maximum entropy) non-Gaussian noise scenarios and over PF in terms of complexity and computation time.
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.005 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 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".