Application of AmsGradP optimizer in fault diagnosis of bearing with few samples
Bibliographic record
Abstract
Bearing fault diagnosis methods based on deep learning usually require a large number of training samples. However, obtaining large amounts of faulty bearing data can be challenging. How to diagnose faults with limited or few samples becomes a research problem. In order to solve the problem of bearing fault diagnosis with few samples, a rolling bearing fault diagnosis method based on improved Adam (Adaptive Moment Estimation) is proposed. First, it combines the advantages of both Adam and AmsGrad optimizers. Second, similar to AdamP, AmsGradP (Adaptive Gradient Optimizer with Penalty Parameters) introduces the penalty term of the parameter norm to mitigate the problem of premature decay of the learning rate. Finally, by penalizing the norm of the parameter during optimization, AmsGradP can prevent excessive parameter growth, thus further stabilizing the learning rate. The experimental results show that when only 1.58% of the data is used as the training dataset, the average accuracy of 98.26% can be achieved by using the AmsGradP optimizer, which is 6.68% higher than that by using the Adam optimizer.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".