Encoding High-Level Features: An Approach To Robust Transfer Learning
Bibliographic record
Abstract
Transfer Learning (TL) plays a vital role in image classification systems based on Deep Convolutional Neural Networks (DCNNs). Systems employing such technique may be susceptible to distortions on images, motivating the development of robust DCNNs capable of facing these problems. Unfortunately, changes in the architecture of DCNNs are sometimes specific to a kind of distortion and result in models that need to be retrained from scratch. This work proposes the use of autoencoders as intermediaries between pre-trained DCNNs and classifiers, delegating the denoising task to this architecture trained to encode feature maps. The classifiers are then trained to map the inputs from the autoencoder latent spaces to their respective classes. Models employing this approach achieved 3% to 4% increase in accuracy and 50% to 70% reduction in loss on the CIFAR10 and CIFAR100 datasets. The results also showed an up to 80% reduction in loss and up to 15% increase in accuracy for images with unseen distortions compared to the classical TL approach. This work improves classification results and increases robustness to distortions in a straightforward manner.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".