Pith. sign in

REVIEW 1 cited by

On the Importance of Hyperparameters and Data Augmentation for Self-Supervised Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.07875 v1 pith:OUQFY2AW submitted 2022-07-16 cs.LG cs.AIcs.CV

classification cs.LGcs.AIcs.CV
keywords dataacrossaugmentationlearningimportanceareaaugmentationsdatasets
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Self-Supervised Learning (SSL) has become a very active area of Deep Learning research where it is heavily used as a pre-training method for classification and other tasks. However, the rapid pace of advancements in this area comes at a price: training pipelines vary significantly across papers, which presents a potentially crucial confounding factor. Here, we show that, indeed, the choice of hyperparameters and data augmentation strategies can have a dramatic impact on performance. To shed light on these neglected factors and help maximize the power of SSL, we hyperparameterize these components and optimize them with Bayesian optimization, showing improvements across multiple datasets for the SimSiam SSL approach. Realizing the importance of data augmentations for SSL, we also introduce a new automated data augmentation algorithm, GroupAugment, which considers groups of augmentations and optimizes the sampling across groups. In contrast to algorithms designed for supervised learning, GroupAugment achieved consistently high linear evaluation accuracy across all datasets we considered. Overall, our results indicate the importance and likely underestimated role of data augmentation for SSL.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently

    cs.LG 2025-07 conditional novelty 5.0 of 10

    A distance-based categorical kernel and two algorithmic modifications let TPE optimize combinatorial spaces more efficiently than the original TPE on synthetic benchmarks.

Pith tools