Few-shot Adaptation to Distribution Shifts By Mixing Source and Target Embeddings
Not on the map. Why?
Abstract (arXiv)
Pretrained machine learning models need to be adapted to distribution shifts when deployed in new target environments. When obtaining labeled data from the target distribution is expensive, few-shot adaptation with only a few examples from the target distribution becomes essential. In this work, we propose MixPro, a lightweight and highly data-efficient approach for few-shot adaptation. MixPro first generates a relatively large dataset by mixing (linearly combining) pre-trained embeddings of large source data with those of the few target examples. This process preserves important features of both source and target distributions, while mitigating the specific noise in the small target data. Then, it trains a linear classifier on the mixed embeddings to effectively adapts the model to the target distribution without overfitting the small target data. Theoretically, we demonstrate the advantages of MixPro over previous methods. Our experiments, conducted across various model architectures on 8 datasets featuring different types of distribution shifts, reveal that MixPro can outperform baselines by up to 7%, with only 2-4 target examples.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 44 of its 60 references that are in the map. First posted on arXiv 23 May 2023.
Builds on
44 of 60 references.
References · 44
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2019Invariant Risk Minimizationcited by 1,854
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2014How transferable are features in deep neural networks?cited by 1,225
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
- 2020In Search of Lost Domain Generalizationcited by 1,054
- 2017Deeper, Broader and Artier Domain Generalizationcited by 986
- 2021Robust fine-tuning of zero-shot modelscited by 797
- 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 739
32 more
- 2018Recognition in Terra Incognitacited by 658
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 600
- 2018Do Better ImageNet Models Transfer Better?cited by 565
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 523
- 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 425
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 381
- 2014CNN Features off-the-shelf: an Astounding Baseline for Recognitioncited by 316
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
- 2020Environment Inference for Invariant Learningcited by 306
- 2022Test-Time Training with Masked Autoencoderscited by 212
- 2022Surgical Fine-Tuning Improves Adaptation to Distribution Shiftscited by 205
- 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
- 2020Adaptive Risk Minimization: Learning to Adapt to Domain Shiftcited by 183
- 2021The Low-Rank Simplicity Bias in Deep Networkscited by 154
- 2022On Feature Learning in the Presence of Spurious Correlationscited by 145
- 2021On Calibration and Out-of-domain Generalizationcited by 134
- 2023Change is Hard: A Closer Look at Subpopulation Shiftcited by 120
- 2022Revisiting Weakly Supervised Pre-Training of Visual Perception Modelscited by 116
- 2018On the importance of single directions for generalizationcited by 99
- 2022A Whac-A-Mole Dilemma: Shortcuts Come in Multiples Where Mitigating One Amplifies Otherscited by 85
- 2021Evading the Simplicity Bias: Training a Diverse Set of Models Discovers Solutions with Superior OOD Generalizationcited by 83
- 2021BiaSwap: Removing dataset bias with bias-tailored swapping augmentationcited by 70
- 2022Agree to Disagree: Diversity through Disagreement for Better Transferabilitycited by 70
- 2022Domain-Adjusted Regression or: ERM May Already Learn Features Sufficient for Out-of-Distribution Generalizationcited by 69
- 2019Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobiancited by 67
- 2022Contrastive Adapters for Foundation Model Group Robustnesscited by 62
- 2016Convolutional Neural Networks Analyzed via Convolutional Sparse Codingcited by 52
- 2020Test-time Unsupervised Domain Adaptationcited by 37
- 2021Linear unit-tests for invariance discoverycited by 27
- 2022You Only Need a Good Embeddings Extractor to Fix Spurious Correlationscited by 17
- 2022Few-Shot Adaptation of Pre-Trained Networks for Domain Shiftcited by 16
- 2023Project and Probe: Sample-Efficient Domain Adaptation by Interpolating Orthogonal Featurescited by 10
Built on by
Citing papers per year: 2023: 1; 2024: 2.
3 papers.