Can Pretext-Based Self-Supervised Learning Be Boosted by Downstream Data? A Theoretical Analysis
Not on the map. Why?
Abstract (arXiv)
Pretext-based self-supervised learning learns the semantic representation via a handcrafted pretext task over unlabeled data and then uses the learned representation for downstream tasks, which effectively reduces the sample complexity of downstream tasks under Conditional Independence (CI) condition. However, the downstream sample complexity gets much worse if the CI condition does not hold. One interesting question is whether we can make the CI condition hold by using downstream data to refine the unlabeled data to boost self-supervised learning. At first glance, one might think that seeing downstream data in advance would always boost the downstream performance. However, we show that it is not intuitively true and point out that in some cases, it hurts the final performance instead. In particular, we prove both model-free and model-dependent lower bounds of the number of downstream samples used for data refinement. Moreover, we conduct various experiments on both synthetic and real-world datasets to verify our theoretical results.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 5 Mar 2021.
Builds on
25 of 35 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 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
- 2019Contrastive Multiview Codingcited by 1,297
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2016Colorful Image Colorizationcited by 1,113
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 733
13 more
- 2013Network In Networkcited by 600
- 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
- 2020Rethinking Pre-training and Self-trainingcited by 352
- 2016Adversarial Feature Learningcited by 350
- 2021Understanding self-supervised Learning Dynamics without Contrastive Pairscited by 254
- 2019Large Scale Adversarial Representation Learningcited by 238
- 2016Adversarially Learned Inferencecited by 216
- 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 179
- 2020Predicting What You Already Know Helps: Provable Self-Supervised Learningcited by 152
- 2020Contrastive learning, multi-view redundancy, and linear modelscited by 146
- 2020A Mathematical Exploration of Why Language Models Help Solve Downstream Taskscited by 71
- 2020Self-Supervised Graph Representation Learning via Global Context Predictioncited by 38
- 2020For self-supervised learning, Rationality implies generalization, provablycited by 22
Built on by
Citing papers per year: 2021: 1; 2022: 4; 2023: 0; 2024: 3; 2025: 1.
9 papers.
- 2021Towards the Generalization of Contrastive Self-Supervised Learningcited by 99
- 2022Audio Self-supervised Learning: A Surveycited by 65
- 2022The Mechanism of Prediction Head in Non-contrastive Self-supervised Learningcited by 38
- 2024Training-Conditional Coverage Bounds under Covariate Shiftcited by 8
- 2022Unlabeled Data Help: Minimax Analysis and Adversarial Robustnesscited by 4
- 2022Understanding The Robustness of Self-supervised Learning Through Topic Modelingcited by 3
- 2025Quantitative Estimation of Target Task Performance from Unsupervised Pretext Task in Semi/Self-Supervised Learningcited by 2
- 2024Low-Rank Approximation of Structural Redundancy for Self-Supervised Learningcited by 1
- 2024Tackling Dimensional Collapse toward Comprehensive Universal Domain Adaptationcited by 1
- 2025Quantitative Estimation of Target Task Performance from Unsupervised Pretext Task in Semi/Self-Supervised Learning10 Aug 2025
- 2024Tackling Dimensional Collapse toward Comprehensive Universal Domain Adaptation15 Oct 2024
- 2024Training-Conditional Coverage Bounds under Covariate Shift26 May 2024
- 2024Low-Rank Approximation of Structural Redundancy for Self-Supervised Learning10 Feb 2024
- 2022The Mechanism of Prediction Head in Non-contrastive Self-supervised Learning12 May 2022
- 2022Audio Self-supervised Learning: A Survey2 Mar 2022
- 2022Unlabeled Data Help: Minimax Analysis and Adversarial Robustness14 Feb 2022
- 2022Understanding The Robustness of Self-supervised Learning Through Topic Modeling2 Feb 2022
- 2021Towards the Generalization of Contrastive Self-Supervised Learning1 Nov 2021