Identification for nonlinear singularly perturbed system using recurrent high-order multi-time scales neural network
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.
Bibliographic record
Abstract
A new identification algorithm for nonlinear singularly perturbed system using multi-time scales recurrent high-order neural networks is proposed in this paper. The high-order neural networks have simple structure and strong nonlinear approximation capability, which enables it to model the nonlinear singularly perturbed systems more accurately with less computation complexity, compared to multilayer neural networks. The optimal bounded ellipsoid algorithm, which is originally designed for discrete time systems, is introduced to update the weights of continuous multi-time scales neural networks. Compared to other widely used gradient-like updating methods, the on-line identification algorithm proposed in this paper can realize faster convergence, due to the adaptive “learning rate” of the weights updating laws. The effectiveness of the proposed scheme is demonstrated by simulation results.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it