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.

翻译：自监督学习（SSL）是一种无需人工标注数据即可预训练深度神经网络（DNN）的机器学习算法。该学习技术的核心思想基于辅助阶段（即借口任务），通过数据增强自动生成标注数据，并利用其对DNN进行预训练。然而，文献中对各借口任务的效果缺乏系统研究与对比。本文在约束条件下研究了增强算子对自监督学习算法性能的贡献。我们提出了一种进化搜索方法，用于优化借口任务中的数据增强流程，并衡量了增强算子对多种先进SSL算法的影响。通过将增强算子的不同组合编码为染色体，我们借助进化优化机制寻求最优增强策略。此外，我们引入了分析和解释优化后SSL算法性能的方法。结果表明，我们的方法能够找到优于SSL算法分类准确率的解，证实了增强策略选择对SSL算法整体性能的影响。我们还比较了进化搜索机制找到的最优SSL解，并在两个视觉数据集上展示了借口任务中批次大小的影响。