Finite-Horizon $H_\infty$ State Estimation for Time-Varying Neural Networks with Periodic Inner Coupling and Measurements Scheduling
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
This paper investigates an <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${H}_\infty $ </tex-math></inline-formula> estimator design for time-varying coupled neural networks (NNs) over a finite-horizon. In order to reduce the information exchanged among the NNs, a periodic inner-coupling strategy is proposed. In addition, a Markov driven transmission scheme is introduced to overcome the communication capacity constraint between the NNs and the estimators, where an inner-coupling-dependent Markov chain is used to improve the efficiency of the communication channel. Subsequently, the time-varying Markov estimators are designed to enhance the performance of the estimators. A recursive matrix inequality (RMI)-based sufficient condition is established to ensure that the time-varying estimation error system meets the finite-horizon <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${H}_\infty $ </tex-math></inline-formula> performance. Afterward, the estimator gains are designed by transforming the RMIs into linear RMIs. Finally, a numeral example is used to illustrate the developed 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.001 | 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.001 | 0.000 |
| Scholarly communication | 0.001 | 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