Improving the Performance of Process Controllers Using a New Clustered Neural Network
Bibliographic record
Abstract
This paper presents first a newly developed clustered neural network, which incorporates self-organization capacity into the well-known common multilayer perceptron (MLP) architecture. With this addition, it is possible to reduce significantly overall memory degradation of the neuro-controller during on-line training. In the second part of the paper, this clustered multilayer perceptron (CMLP) network is applied and compared to the MLP through modeling and simulations of machining processes. Simulation results presented using machining data demonstrate that the CMLP possesses more powerful modeling capacity than the standard MLP, offers better adaptability to new operating conditions, and finally performs more reliably. During on-line training with machining data about 65% degradation of previously learned information can be observed in the MLP as opposed to only 11% for the CMLP. Finally, an adaptive control scheme intended for on-line optimization of the machining processes is presented. This scheme uses a feed forward CMLP inverse neuro-controller which learns off-line and on-line the relationships between process inputs and output under simulated perturbations (i.e., tool wear and non-homogeneous workpiece material properties). The first results using the CMLP inverse neuro-controller are promising
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 |
| Open science | 0.001 | 0.000 |
| 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".