Fixed-Time Output-Constrained Synchronization of Unknown Chaotic Financial Systems Using Neural Learning
Bibliographic record
Abstract
This article addresses the challenging problem of fixed-time output-constrained synchronization for master–slave chaotic financial systems with unknown parameters and perturbations. A fixed-time neural adaptive control approach is originally proposed with the aid of the barrier Lyapunov function (BLF) and neural network (NN) identification. The BLF is introduced to preserve the synchronization errors always within the predefined output constraints. The NN is adopted to identify the compound unknown item in the synchronization error system. Unlike the conventional NN identification, the concept of indirect NN identification is employed, and only a single adaptive learning parameter is required to be adjusted online. According to the stability argument, the proposed controller can ensure that all error variables in the closed-loop system regulate to the minor residual sets around zero in fixed time. Finally, simulations and comparisons are conducted to verify the efficiency and benefits of the proposed control strategy. It can be concluded from the simulation results that the proposed fixed-time neural adaptive controller is capable of achieving better synchronization performance than the compared linear feedback controller.
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.001 |
| 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.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".