Diversity-enhancing Generative Network for Few-shot Hypothesis Adaptation
Not on the map. Why?
Abstract (arXiv)
Generating unlabeled data has been recently shown to help address the few-shot hypothesis adaptation (FHA) problem, where we aim to train a classifier for the target domain with a few labeled target-domain data and a well-trained source-domain classifier (i.e., a source hypothesis), for the additional information of the highly-compatible unlabeled data. However, the generated data of the existing methods are extremely similar or even the same. The strong dependency among the generated data will lead the learning to fail. In this paper, we propose a diversity-enhancing generative network (DEG-Net) for the FHA problem, which can generate diverse unlabeled data with the help of a kernel independence measure: the Hilbert-Schmidt independence criterion (HSIC). Specifically, DEG-Net will generate data via minimizing the HSIC value (i.e., maximizing the independence) among the semantic features of the generated data. By DEG-Net, the generated unlabeled data are more diverse and more effective for addressing the FHA problem. Experimental results show that the DEG-Net outperforms existing FHA baselines and further verifies that generating diverse data plays a vital role in addressing the FHA problem
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 34 of its 62 references that are in the map. First posted on arXiv 12 Jul 2023.
Builds on
34 of 62 references.
References · 34
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 631
- 2019Generalizing from a Few Examples: A Survey on Few-Shot Learningcited by 462
- 2017VisDA: The Visual Domain Adaptation Challengecited by 432
- 2018Meta-Transfer Learning for Few-Shot Learningcited by 306
- 2016NIPS 2016 Tutorial: Generative Adversarial Networkscited by 284
- 2018A DIRT-T Approach to Unsupervised Domain Adaptationcited by 215
- 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 176
- 2021Generalized Source-free Domain Adaptationcited by 175
22 more
- 2021Free Lunch for Few-shot Learning: Distribution Calibrationcited by 165
- 2017Few-Shot Adversarial Domain Adaptationcited by 111
- 2019Dynamic Instance Normalization for Arbitrary Style Transfercited by 83
- 2019Few-Shot Adaptive Gaze Estimationcited by 77
- 2019The HSIC Bottleneck: Deep Learning without Back-Propagationcited by 77
- 2021Self-Supervised Learning with Kernel Dependence Maximizationcited by 77
- 2020A Universal Representation Transformer Layer for Few-Shot Image Classificationcited by 65
- 2020Improving Generalization in Meta-learning via Task Augmentationcited by 55
- 2020Few-shot Domain Adaptation by Causal Mechanism Transfercited by 47
- 2021Meta Discovery: Learning to Discover Novel Classes given Very Limited Datacited by 30
- 2022Bilateral Dependency Optimization: Defending Against Model-inversion Attackscited by 30
- 2016Hypothesis Transfer Learning via Transformation Functionscited by 26
- 2020Kernelized information bottleneck leads to biologically plausible 3-factor Hebbian learning in deep networkscited by 25
- 2020Exploiting Chain Rule and Bayes' Theorem to Compare Probability Distributionscited by 22
- 2021Isometric Propagation Network for Generalized Zero-shot Learningcited by 18
- 2021Meta Two-Sample Testing: Learning Kernels for Testing with Limited Datacited by 18
- 2020How does the Combined Risk Affect the Performance of Unsupervised Domain Adaptation Approaches?cited by 17
- 2021On the benefits of representation regularization in invariance based domain generalizationcited by 17
- 2021TOHAN: A One-step Approach towards Few-shot Hypothesis Adaptationcited by 17
- 2019Learning from weakly dependent data under Dobrushin's conditioncited by 13
- 2020Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptationcited by 8
- 2022Gap Minimization for Knowledge Sharing and Transfercited by 4
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 1.
4 papers.
- 2024Bayesian-guided Label Mapping for Visual Reprogrammingcited by 12
- 2025Neural Network Reprogrammability: A Unified Theme on Model Reprogramming, Prompt Tuning, and Prompt Instructioncited by 3
- 2024Learning Representations for Independence Testingcited by 2
- 2026RMB: Reward Model Boosting Mitigates Reward Hackingcited by 0
- 2026RMB: Reward Model Boosting Mitigates Reward Hacking27 Sep 2026
- 2025Neural Network Reprogrammability: A Unified Theme on Model Reprogramming, Prompt Tuning, and Prompt Instruction5 Jun 2025
- 2024Bayesian-guided Label Mapping for Visual Reprogramming31 Oct 2024
- 2024Learning Representations for Independence Testing10 Sep 2024