Sparse Signal Reconstruction on Fixed and Adaptive Supervised Dictionary Learning for Transient Stability Assessment
Bibliographic record
Abstract
Fixed and adaptive supervised dictionary learning (SDL) is proposed in this paper for wide-area stability assessment. Single and hybrid fixed structures are developed based on impulse dictionary (ID), discrete Haar transform (DHT), discrete cosine transform (DCT), discrete sine transform (DST), and discrete wavelet transform (DWT) for sparse features extraction and online transient stability prediction. The fixed structures performance is compared with that obtained from transient K-singular value decomposition (TK-SVD) implemented while adding a stability status term to the optimization problem. Stable and unstable dictionary learning are designed based on datasets recorded by simulating thousands of contingencies with varying faults, load, and generator switching on the IEEE 68-bus test system. This separate supervised learning of stable and unstable scenarios allows determining root mean square error (RMSE), useful for online stability status assessment of new scenarios. With respect to the RMSE performance metric in signal reconstruction-based stability prediction, the present analysis demonstrates that [DWT], [DHT|DWT] and [DST|DHT|DCT] are better stability descriptors compared to K-SVD, [DHT], [DCT], [DCT|DWT], [DHT|DCT], [ID|DCT|DST], and [DWT|DHT|DCT] on test datasets. However, the K-SVD approach is faster to execute in both off-line training and real-time playback while yielding satisfactory accuracy in transient stability prediction (i.e., 7.5-cycles decision window after fault-clearing).
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.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".