Parameter isolation with domain-specific experts for incremental audio classification

• URL: http://arxiv.org/abs/2609.14730v1
• Date: Sun, 13 Sep 2026 18:47:01 GMT
• Title: Parameter isolation with domain-specific experts for incremental audio classification
• Abstract summary: This paper proposes a new domain-specific parameter-isolation architecture that retains all past domains.<n>We incorporate data-free generative replay to reconstruct previous-domain data and cross-domain feature generation to recover later expert features missing from earlier domains.<n>We achieve micro and macro accuracies of 78.4% and 78.9%, respectively, representing increases of 33 and 25 percentage points over the Challenge baseline.
• Score: 4.541172620857825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: To successfully deploy a model in time-varying environments such as streaming data prediction and sensing control, domain-incremental learning (DIL) has attracted attention since it aims to adapt a previously trained model to newly arriving domains, while reserving knowledge from earlier domains without accessing their data. Incremental learning across domains can be regarded as a recurrent update, in which the current model is obtained by updating the model carried over from previous domains. Conventional DIL approaches that rely on domain-invariant feature learning and weight regularization gradually overwrite or constrain parameters learned in previous domains, leading to catastrophic forgetting. Instead, this paper proposes a new domain-specific parameter-isolation architecture that retains all past domains. The proposed architecture mitigates catastrophic forgetting through a full-order recurrent update, constructing a new expert using domain-specific data conditioned on all previously frozen models. To achieve this, we incorporate data-free generative replay to reconstruct previous-domain data and cross-domain feature generation to recover later expert features missing from earlier domain samples. Finally, we apply the proposed model architecture to domain-agnostic incremental learning for audio classification, as defined in the DCASE 2026 Challenge Task 7. Consequently, we achieve micro and macro accuracies of 78.4% and 78.9%, respectively, representing increases of 33 and 25 percentage points over the Challenge baseline. Ablation studies are conducted to examine the effectiveness of each processing component in terms of classification accuracy.

Related papers

• Orthogonal Knowledge Refreshing for Domain-Incremental Object Detection [37.885906679929796]
  Domain-incremental object detection requires models to continually adapt to new domains while preserving prior knowledge.<n>We propose Orthogonal Knowledge Refreshing (OKR), a simple yet effective framework for DIOD.<n>OKR incrementally constructs independent domain-specific subspaces via dedicated low-rank branches for each domain.
  arXiv  Detail & Related papers  (2026-07-19T17:02:15Z)
• What's in a Latent? Leveraging Diffusion Latent Space for Domain Generalization [10.079844840768054]
  Domain Generalization aims to develop models that can generalize to novel and unseen data distributions.<n>We study how model architectures and pre-training objectives impact feature richness.<n>Our framework improves generalization to unseen domains by a maximum test accuracy improvement of over 4%.
  arXiv  Detail & Related papers  (2025-03-09T17:29:01Z)
• Learning Latent Spaces for Domain Generalization in Time Series Forecasting [60.29403194508811]
  Time series forecasting is vital in many real-world applications, yet developing models that generalize well on unseen relevant domains remains underexplored.<n>We propose a framework for domain generalization in time series forecasting by mining the latent factors that govern temporal dependencies across domains.<n>Our approach uses a decomposition-based architecture with a new Conditional $beta$-Variational Autoencoder (VAE), wherein time series data is first decomposed into trend-cyclical and seasonal components.
  arXiv  Detail & Related papers  (2024-12-15T12:41:53Z)
• Progressive Conservative Adaptation for Evolving Target Domains [76.9274842289221]
  Conventional domain adaptation typically transfers knowledge from a source domain to a stationary target domain. Restoring and adapting to such target data results in escalating computational and resource consumption over time. We propose a simple yet effective approach, termed progressive conservative adaptation (PCAda)
  arXiv  Detail & Related papers  (2024-02-07T04:11:25Z)
• Memory-Efficient Prompt Tuning for Incremental Histopathology Classification [69.46798702300042]
  We present a memory-efficient prompt tuning framework to cultivate model generalization potential in economical memory cost. We have extensively evaluated our framework with two histopathology tasks, i.e., breast cancer metastasis classification and epithelium-stroma tissue classification.
  arXiv  Detail & Related papers  (2024-01-22T03:24:45Z)
• Improving Domain Generalization with Domain Relations [77.63345406973097]
  This paper focuses on domain shifts, which occur when the model is applied to new domains that are different from the ones it was trained on. We propose a new approach called D$3$G to learn domain-specific models. Our results show that D$3$G consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-02-06T08:11:16Z)
• Domain-incremental Cardiac Image Segmentation with Style-oriented Replay and Domain-sensitive Feature Whitening [67.6394526631557]
  M&Ms should incrementally learn from each incoming dataset and progressively update with improved functionality as time goes by. In medical scenarios, this is particularly challenging as accessing or storing past data is commonly not allowed due to data privacy. We propose a novel domain-incremental learning framework to recover past domain inputs first and then regularly replay them during model optimization.
  arXiv  Detail & Related papers  (2022-11-09T13:07:36Z)
• Forget Less, Count Better: A Domain-Incremental Self-Distillation Learning Benchmark for Lifelong Crowd Counting [51.44987756859706]
  Off-the-shelf methods have some drawbacks to handle multiple domains. Lifelong Crowd Counting aims at alleviating the catastrophic forgetting and improving the generalization ability.
  arXiv  Detail & Related papers  (2022-05-06T15:37:56Z)

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.