English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65231/98744 (66%)
Visitors : 31967630      Online Users : 3087
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/128256


    Title: A Batch-Statistics-Free Adaptive Normalization Method for Robust Few-Shot Learning and Domain Adaptation
    Authors: Yeh, Jih-Pin;Tsai, Yihjia;Lin, Hwei Jen;Tokuyama, Yoshimasa;Hsu, Wei-Lun
    Keywords: Batch normalization;whitening-free normalization;meta affine transformationadaptive normalization;few-shot learning;source-free domain adaptation
    Date: 2025-10-28
    Issue Date: 2025-11-27 12:05:18 (UTC+8)
    Abstract: Batch Normalization (BN) has been widely adopted in deep neural networks for its ability to stabilize training and improve convergence. However, BN relies on batch-wise mean and variance estimates, which can become inaccurate during inference, particularly in Few-shot Learning (FSL) and domain adaptation scenarios where the test distribution differs from training or the available batch size is small. This dependency often causes performance degradation due to mismatched or outdated statistics. In this work, we introduce Meta Affine Transformation (MetaAFN), a batch-statistics-free normalization strategy that replaces the normalization step in BN with a meta-network-generated affine transformation. By entirely removing the reliance on batch statistics, MetaAFN avoids mismatched training-set statistics and instead uses a lightweight meta-network to dynamically produce scale (
    γ
    ) and shift (
    β
    ) parameters conditioned on the current input features. This design enables the model to adaptively modulate representations without explicit BN, improving robustness to distribution shifts. We evaluate MetaAFN on two representative tasks — FSL and source-free domain adaptation — using multiple benchmark datasets. Experimental results show that MetaAFN consistently outperforms or matches BN and MetaBN, with clear advantages under significant distributional shifts. These findings highlight MetaAFN as an effective and practical alternative to BN, offering improved adaptability and generalization in heterogeneous data scenarios.
    Relation: International Journal of Pattern Recognition and Artificial Intelligence 39(16) , p.2551033
    DOI: 10.1142/S0218001425510334
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML98View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback