FS-BAN: Born-Again Networks for Domain Generalization Few-Shot Classification

• URL: http://arxiv.org/abs/2208.10930v4
• Date: Mon, 8 May 2023 15:57:07 GMT
• Title: FS-BAN: Born-Again Networks for Domain Generalization Few-Shot Classification
• Authors: Yunqing Zhao and Ngai-Man Cheung
• Abstract summary: We propose Born-Again Network (BAN) episodic training and comprehensively investigate its effectiveness for DG-FSC. Building on the encouraging findings, our second (major) contribution is to propose Few-Shot BAN (FS-BAN), a novel BAN approach for DG-FSC. Our proposed FS-BAN includes novel multi-task learning objectives: Mutual Regularization, Mismatched Teacher, and Meta-Control Temperature.
• Score: 39.01765909445661
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Conventional Few-shot classification (FSC) aims to recognize samples from novel classes given limited labeled data. Recently, domain generalization FSC (DG-FSC) has been proposed with the goal to recognize novel class samples from unseen domains. DG-FSC poses considerable challenges to many models due to the domain shift between base classes (used in training) and novel classes (encountered in evaluation). In this work, we make two novel contributions to tackle DG-FSC. Our first contribution is to propose Born-Again Network (BAN) episodic training and comprehensively investigate its effectiveness for DG-FSC. As a specific form of knowledge distillation, BAN has been shown to achieve improved generalization in conventional supervised classification with a closed-set setup. This improved generalization motivates us to study BAN for DG-FSC, and we show that BAN is promising to address the domain shift encountered in DG-FSC. Building on the encouraging findings, our second (major) contribution is to propose Few-Shot BAN (FS-BAN), a novel BAN approach for DG-FSC. Our proposed FS-BAN includes novel multi-task learning objectives: Mutual Regularization, Mismatched Teacher, and Meta-Control Temperature, each of these is specifically designed to overcome central and unique challenges in DG-FSC, namely overfitting and domain discrepancy. We analyze different design choices of these techniques. We conduct comprehensive quantitative and qualitative analysis and evaluation over six datasets and three baseline models. The results suggest that our proposed FS-BAN consistently improves the generalization performance of baseline models and achieves state-of-the-art accuracy for DG-FSC. Project Page: https://yunqing-me.github.io/Born-Again-FS/.

Related papers

• PointDGMamba: Domain Generalization of Point Cloud Classification via Generalized State Space Model [77.00221501105788]
  Domain Generalization (DG) has been recently explored to improve the generalizability of point cloud classification (PCC) models toward unseen domains. We present the first work that studies the generalizability of state space models (SSMs) in DG PCC. We propose a novel framework, PointDGMamba, that excels in strong generalizability toward unseen domains.
  arXiv  Detail & Related papers  (2024-08-24T12:53:48Z)
• Test-Time Domain Generalization for Face Anti-Spoofing [60.94384914275116]
  Face Anti-Spoofing (FAS) is pivotal in safeguarding facial recognition systems against presentation attacks. We introduce a novel Test-Time Domain Generalization framework for FAS, which leverages the testing data to boost the model's generalizability. Our method, consisting of Test-Time Style Projection (TTSP) and Diverse Style Shifts Simulation (DSSS), effectively projects the unseen data to the seen domain space.
  arXiv  Detail & Related papers  (2024-03-28T11:50:23Z)
• Cross-Domain Few-Shot Segmentation via Iterative Support-Query Correspondence Mining [81.09446228688559]
  Cross-Domain Few-Shots (CD-FSS) poses the challenge of segmenting novel categories from a distinct domain using only limited exemplars. We propose a novel cross-domain fine-tuning strategy that addresses the challenging CD-FSS tasks.
  arXiv  Detail & Related papers  (2024-01-16T14:45:41Z)
• A Survey of Deep Visual Cross-Domain Few-Shot Learning [46.08156372869305]
  Few-Shot transfer learning has become a major focus of research as it allows recognition of new classes with limited labeled data. Research into Cross-Domain Few-Shot (CDFS) has emerged to address this issue, forming a more challenging and realistic setting. We provide a detailed taxonomy of CDFS from the problem setting and corresponding solutions view.
  arXiv  Detail & Related papers  (2023-03-16T12:06:59Z)
• A Comprehensive Survey on Source-free Domain Adaptation [69.17622123344327]
  The research of Source-Free Domain Adaptation (SFDA) has drawn growing attention in recent years. We provide a comprehensive survey of recent advances in SFDA and organize them into a unified categorization scheme. We compare the results of more than 30 representative SFDA methods on three popular classification benchmarks.
  arXiv  Detail & Related papers  (2023-02-23T06:32:09Z)
• CFA: Constraint-based Finetuning Approach for Generalized Few-Shot Object Detection [0.0]
  Generalized few-shot object detection (G-FSOD) aims to tackle FSOD without forgetting previously seen base classes. CFA adapts a continual learning method, namely Average Gradient Episodic Memory (A-GEM) to G-FSOD. Our method outperforms current FSOD and G-FSOD approaches on the novel task with minor degeneration on the base task.
  arXiv  Detail & Related papers  (2022-04-11T16:04:54Z)
• Amortized Prompt: Lightweight Fine-Tuning for CLIP in Domain Generalization [25.367775241988618]
  Domain generalization is a difficult transfer learning problem aiming to learn a generalizable model to unseen domains. Recent massive pre-trained models such as CLIP and GPT-3 have been shown to be robust to many distribution shifts. We propose AP (Amortized Prompt) as a novel approach for domain inference in the form of prompt generation.
  arXiv  Detail & Related papers  (2021-11-25T00:25:54Z)
• Reappraising Domain Generalization in Neural Networks [8.06370138649329]
  Domain generalization (DG) of machine learning algorithms is defined as their ability to learn a domain agnostic hypothesis from multiple training distributions. We find that a straightforward Empirical Risk Minimization (ERM) baseline consistently outperforms existing DG methods. We propose a classwise-DG formulation, where for each class, we randomly select one of the domains and keep it aside for testing.
  arXiv  Detail & Related papers  (2021-10-15T10:06:40Z)
• Generalized Few-shot Semantic Segmentation [68.69434831359669]
  We introduce a new benchmark called Generalized Few-Shot Semantic (GFS-Seg) to analyze the ability of simultaneously segmenting the novel categories. It is the first study showing that previous representative state-of-the-art generalizations fall short in GFS-Seg. We propose the Context-Aware Prototype Learning (CAPL) that significantly improves performance by 1) leveraging the co-occurrence prior knowledge from support samples, and 2) dynamically enriching contextual information to the conditioned, on the content of each query image.
  arXiv  Detail & Related papers  (2020-10-11T10:13:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.