RandMixAugment: A Novel Unified Technique for Region- and Image-Level Data Augmentations
Bibliographic record
Abstract
Deep learning models learn powerful representational spaces required for handling complex tasks. Recently, data augmentation techniques, region-level and image-level augmentation have proved effective in significantly improving deep learning models’ generalization performance. Nevertheless, such techniques may lose some critical features or are still computationally heavy (or inefficient) due to additional computation burdens. To address this issue, in this paper, we present a novel unified data augmentation method for deep learning models, namely, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RandMixAugment</i> , which effectively combines the intrinsic properties of region-level augmentation and image-level augmentation. Specifically, the proposed RandMixAugment employs automated augmentation with masking and mixing operations. Experiments are conducted on well-known CIFAR datasets (CIFAR-10 and CIFAR-100) to verify the effectiveness of the proposed scheme compared to state-of-the-art augmentation techniques. The experimental results demonstrate that the proposed RandMixAugment yields superior performance over state-of-the-art techniques on image classification tasks and further improves the performance of the baseline deep learning model by 1.2% and 2.4% on CIFAR-10 and CIFAR-100 datasets, respectively.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".