A Novel Error-Based Adaptive Feedback Zeroing Neural Network for Solving Time-Varying Quadratic Programming Problems
Bibliographic record
Abstract
This paper introduces a novel error-based adaptive feedback zeroing neural network (EAF-ZNN) to solve the time-varying quadratic programming (TVQP) problem. Compared to existing variable gain ZNNs, the EAF-ZNN dynamically adjusts the parameter to adaptively accelerate without increasing to very large values over time. Unlike adaptive fuzzy ZNN, which only considers the current convergence error, EAF-ZNN ensures regulation by introducing a feedback regulation mechanism between the current convergence error, the historical cumulative convergence error, the change rate of the convergence error, and the model gain parameter. This regulation mechanism promotes effective neural dynamic evolution, which results in high convergence rate and accuracy. This paper provides a detailed analysis of the convergence of the model, utilizing four distinct activation functions. Furthermore, the effect of changes in the proportional, integral, and derivative factors in the EAF-ZNN model on the rate of convergence is explored. To assess the superiority of EAF-ZNN in solving TVQP problems, a comparative evaluation with three existing ZNN models is performed. Simulation experiments demonstrate that the EAF-ZNN model exhibits a superior convergence rate. Finally, the EAF-ZNN model is compared with the other three models through the redundant robotic arms example, which achieves smaller position error.
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.001 |
| 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".