mlsanityData to 7 Oct 2026

Efficient Source-Free Time-Series Adaptation via Parameter Subspace Disentanglement

arXiv 2410.02147 ↗First posted 3 Oct 2024cs.LG cs.AI eess.SPcited by 4

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a framework for efficient Source-Free Domain Adaptation (SFDA) in the context of time-series, focusing on enhancing both parameter efficiency and data-sample utilization. Our approach introduces an improved paradigm for source-model preparation and target-side adaptation, aiming to enhance training efficiency during target adaptation. Specifically, we reparameterize the source model's weights in a Tucker-style decomposed manner, factorizing the model into a compact form during the source model preparation phase. During target-side adaptation, only a subset of these decomposed factors is fine-tuned, leading to significant improvements in training efficiency. We demonstrate using PAC Bayesian analysis that this selective fine-tuning strategy implicitly regularizes the adaptation process by constraining the model's learning capacity. Furthermore, this re-parameterization reduces the overall model size and enhances inference efficiency, making the approach particularly well suited for resource-constrained devices. Additionally, we demonstrate that our framework is compatible with various SFDA methods and achieves significant computational efficiency, reducing the number of fine-tuned parameters and inference overhead in terms of MACs by over 90% while maintaining model performance.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 71 of its 105 references that are in the map. First posted on arXiv 3 Oct 2024.

Builds on

71 of 105 references.

References · 71

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  4. 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,848
  5. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  6. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  7. 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
  8. 2017Modeling Long- and Short-Term Temporal Patterns with Deep Neural Networkscited by 869
  9. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
  10. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  11. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 641
  12. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
38 more
  1. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  2. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
  3. 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
  4. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  5. 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 304
  6. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
  7. 2015Tensorizing Neural Networkscited by 246
  8. 2013Predicting Parameters in Deep Learningcited by 223
  9. 2020Universal Source-Free Domain Adaptationcited by 219
  10. 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 199
  11. 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 176
  12. 2021Generalized Source-free Domain Adaptationcited by 175
  13. 2020Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfercited by 173
  14. 2021Source-Free Domain Adaptation for Semantic Segmentationcited by 168
  15. 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 161
  16. 2022KronA: Parameter Efficient Tuning with Kronecker Adaptercited by 130
  17. 2018Non-Vacuous Generalization Bounds at the ImageNet Scale: A PAC-Bayesian Compression Approachcited by 125
  18. 2023The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reductioncited by 120
  19. 2023Navigating Text-To-Image Customization: From LyCORIS Fine-Tuning to Model Evaluationcited by 108
  20. 2023A Comprehensive Survey on Source-free Domain Adaptationcited by 104
  21. 2015Convolutional neural networks with low-rank regularizationcited by 102
  22. 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
  23. 2022Source-Free Domain Adaptation via Distribution Estimationcited by 97
  24. 2022Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptationcited by 93
  25. 2024UniTS: A Unified Multi-Task Time Series Modelcited by 93
  26. 2023Dish-TS: A General Paradigm for Alleviating Distribution Shift in Time Series Forecastingcited by 91
  27. 2020Domain Adaptation without Source Datacited by 88
  28. 2019A Tensorized Transformer for Language Modelingcited by 85
  29. 2020Multi-Source Deep Domain Adaptation with Weak Supervision for Time-Series Sensor Datacited by 82
  30. 2021Generalize then Adapt: Source-Free Domain Adaptive Semantic Segmentationcited by 81
  31. 2021Domain Adaptation for Time Series Forecasting via Attention Sharingcited by 68
  32. 2023Guiding Pseudo-labels with Uncertainty Estimation for Source-free Unsupervised Domain Adaptationcited by 63
  33. 2023Domain Adaptation for Time Series Under Feature and Label Shiftscited by 60
  34. 2022Balancing Discriminability and Transferability for Source-Free Domain Adaptationcited by 58
  35. 2023Source-Free Domain Adaptation with Frozen Multimodal Foundation Modelcited by 54
  36. 2020Time Series Domain Adaptation via Sparse Associative Structure Alignmentcited by 51
  37. 2023C-SFDA: A Curriculum Learning Aided Self-Training Framework for Efficient Source Free Domain Adaptationcited by 49
  38. 2020Distance-Based Regularisation of Deep Networks for Fine-Tuningcited by 47

50 most cited of 71 All 71 (JSON)

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 3.

4 papers.