SynBench: Task-Agnostic Benchmarking of Pretrained Representations using Synthetic Data
Not on the map. Why?
Abstract (arXiv)
Recent success in fine-tuning large models, that are pretrained on broad data at scale, on downstream tasks has led to a significant paradigm shift in deep learning, from task-centric model design to task-agnostic representation learning and task-specific fine-tuning. As the representations of pretrained models are used as a foundation for different downstream tasks, this paper proposes a new task-agnostic framework, textitSynBench, to measure the quality of pretrained representations using synthetic data. We set up a reference by a theoretically-derived robustness-accuracy tradeoff of the class conditional Gaussian mixture. Given a pretrained model, the representations of data synthesized from the Gaussian mixture are used to compare with our reference to infer the quality. By comparing the ratio of area-under-curve between the raw data and their representations, SynBench offers a quantifiable score for robustness-accuracy performance benchmarking. Our framework applies to a wide range of pretrained models taking continuous data inputs and is independent of the downstream tasks and datasets. Evaluated with several pretrained vision transformer models, the experimental results show that our SynBench score well matches the actual linear probing performance of the pre-trained model when fine-tuned on downstream tasks. Moreover, our framework can be used to inform the design of robust linear probing on pretrained representations to mitigate the robustness-accuracy tradeoff in downstream tasks.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 46 of its 49 references that are in the map. First posted on arXiv 6 Oct 2022.
Builds on
46 of 49 references.
References · 46
- 2017Attention Is All You Needcited by 60,361
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2015SSD: Single Shot MultiBox Detectorcited by 3,130
- 2021SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformerscited by 2,940
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
34 more
- 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,161
- 2021ViViT: A Video Vision Transformercited by 1,620
- 2016YOLO9000: Better, Faster, Strongercited by 1,431
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,318
- 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,311
- 2022CoCa: Contrastive Captioners are Image-Text Foundation Modelscited by 1,274
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 744
- 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 739
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 734
- 2019Domain Generalization by Solving Jigsaw Puzzlescited by 450
- 2020What is being transferred in transfer learning?cited by 368
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
- 2020Learning to Learn Single Domain Generalizationcited by 296
- 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 260
- 2020Information-Theoretic Probing with Minimum Description Lengthcited by 232
- 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 215
- 2021Vision Transformers are Robust Learnerscited by 207
- 2020A Theory of Usable Information Under Computational Constraintscited by 162
- 2020Intermediate-Task Transfer Learning with Pretrained Models for Natural Language Understanding: When and Why Does It Work?cited by 127
- 2021On the Adversarial Robustness of Vision Transformerscited by 106
- 2022Plex: Towards Reliability using Pretrained Large Model Extensionscited by 102
- 2021When Does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?cited by 77
- 2018The Description Length of Deep Learning Modelscited by 72
- 2022Contrastive Adapters for Foundation Model Group Robustnesscited by 62
- 2019Lower Bounds on Adversarial Robustness from Optimal Transportcited by 53
- 2021Optimal Representations for Covariate Shiftcited by 51
- 2020Provable tradeoffs in adversarially robust classificationcited by 40
- 2022Improving Self-Supervised Learning by Characterizing Idealized Representationscited by 34
- 2020Learning Optimal Representations with the Decodable Information Bottleneckcited by 33
- 2020Sharp Statistical Guarantees for Adversarially Robust Gaussian Classificationcited by 28
- 2020Unnatural Language Processing: Bridging the Gap Between Synthetic and Natural Language Datacited by 16
- 2020Evaluating representations by the complexity of learning low-loss predictorscited by 16
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.