Evolutionary Augmentation Policy Optimization for Self-supervised Learning
Not on the map. Why?
Abstract (arXiv)
Self-supervised Learning (SSL) is a machine learning algorithm for pretraining Deep Neural Networks (DNNs) without requiring manually labeled data. The central idea of this learning technique is based on an auxiliary stage aka pretext task in which labeled data are created automatically through data augmentation and exploited for pretraining the DNN. However, the effect of each pretext task is not well studied or compared in the literature. In this paper, we study the contribution of augmentation operators on the performance of self supervised learning algorithms in a constrained settings. We propose an evolutionary search method for optimization of data augmentation pipeline in pretext tasks and measure the impact of augmentation operators in several SOTA SSL algorithms. By encoding different combination of augmentation operators in chromosomes we seek the optimal augmentation policies through an evolutionary optimization mechanism. We further introduce methods for analyzing and explaining the performance of optimized SSL algorithms. Our results indicate that our proposed method can find solutions that outperform the accuracy of classification of SSL algorithms which confirms the influence of augmentation policy choice on the overall performance of SSL algorithms. We also compare optimal SSL solutions found by our evolutionary search mechanism and show the effect of batch size in the pretext task on two visual datasets.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 43 references that are in the map. First posted on arXiv 2 Mar 2023.
Builds on
23 of 43 references.
References · 23
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2020Exploring Simple Siamese Representation Learningcited by 2,853
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,586
- 2016Context Encoders: Feature Learning by Inpaintingcited by 1,424
- 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,379
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2016Colorful Image Colorizationcited by 1,113
- 2015Unsupervised Visual Representation Learning by Context Predictioncited by 1,062
11 more
- 2021CutPaste: Self-Supervised Learning for Anomaly Detection and Localizationcited by 529
- 2016Adversarial Feature Learningcited by 350
- 2021With a Little Help from My Friends: Nearest-Neighbor Contrastive Learning of Visual Representationscited by 324
- 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 308
- 2014Discriminative Unsupervised Feature Learning with Exemplar Convolutional Neural Networkscited by 299
- 2019Fast AutoAugmentcited by 243
- 2014Qualitatively characterizing neural network optimization problemscited by 186
- 2020On Hyperparameter Optimization of Machine Learning Algorithms: Theory and Practicecited by 181
- 2019Population Based Augmentation: Efficient Learning of Augmentation Policy Schedulescited by 153
- 2017Deep Neuroevolution: Genetic Algorithms Are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learningcited by 148
- 2020Steering Self-Supervised Feature Learning Beyond Local Pixel Statisticscited by 19
Built on by
Citing papers per year: 2024: 2.
2 papers.