Data-Driven Prediction of Unknown Power Electronic Systems Using a Self-Organizing Adaptive Deep Belief Network
Bibliographic record
Abstract
The increasing integration of power electronic converters into the power grid, driven by the need to meet diverse power requirements of end-users, has led to the emergence of complex nonlinear systems. Developing accurate mathematical models and predicting the future states of these Unknown Nonlinear Power Electronic Systems (UNPESs) is highly challenging and requires deep knowledge of various aspects, including converter topologies, control strategies, modulation techniques, filter modeling, and the characteristics of grids or electrical machines. To address this issue, a data-driven prediction method is proposed. The approach is based on a Deep Belief Network (DBN) with adaptive learning features that reduce the extended training time often required for Restricted Boltzmann Machines (RBMs). The method also features a self-organizing structure to improve the accuracy of next-state prediction for dynamically changing UNPESs. Furthermore, Partial Least Squares (PLS) regression is applied as a supervised learning technique in place of gradient-based backpropagation, which helps to shorten training time and avoid convergence to suboptimal solution for weight parameters. To validate the effectiveness of the proposed method, two case studies are conducted: one involving the general nonlinear Mackey-Glass system, and the other focusing on next-state prediction of a grid-forming converter.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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".