MétaCan
Menu
Back to cohort

Voltage-State Estimation in Non-Gaussian Noisy Environments

2022· article· en· W4313060059 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venue2022 IEEE Power & Energy Society General Meeting (PESGM) · 2022
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsKalman filterGaussianComputer scienceEnsemble Kalman filterEstimatorExtended Kalman filterGaussian noiseComputationInvariant extended Kalman filterAlgorithmUnscented transformControl theory (sociology)MathematicsArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.650
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.010
GPT teacher head0.230
Teacher spread0.220 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it