AI

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

1 Mins read

The growing demand for personalized and private on-device applications highlights the importance of source-free unsupervised domain adaptation (SFDA) methods, especially for time-series data, where individual differences produce large domain shifts. As sensor-embedded mobile devices become ubiquitous, optimizing SFDA methods for parameter utilization and data-sample efficiency in time-series contexts becomes crucial. Personalization in time series is necessary to accommodate the unique patterns and behaviors of individual users, enhancing the relevance and accuracy of the predictions. In this work, we introduce a novel paradigm for source-model preparation and target-side adaptation aimed at improving both parameter and sample efficiency during the target-side adaptation process. Our approach re-parameterizes source-model weights with Tucker-style decomposed factors during the source-model preparation phase. Then, at the time of target-side adaptation, only a subset of these decomposed factors is fine-tuned. This strategy not only enhances parameter efficiency, but also implicitly regularizes the adaptation process by constraining the model’s capacity, which is essential for personalization in diverse and dynamic time-series environments. Moreover, the proposed strategy achieves overall model compression and improves inference efficiency, making it highly suitable for resource-constrained devices. Extensive experiments on various time-series SFDA benchmark datasets demonstrate the effectiveness and efficiency of our approach, underscoring its potential for advancing personalized on-device time-series applications.


Source link

Related posts
AI

Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions

1 Mins read
We study the problem of differentially private stochastic convex optimization (DP-SCO) with heavy-tailed gradients, where we assume a kthk^{\text{th}}kth-moment bound on the…
AI

Advancing urban tree monitoring with AI-powered digital twins | MIT News

4 Mins read
The Irish philosopher George Berkely, best known for his theory of immaterialism, once famously mused, “If a tree falls in a forest…
AI

Private Online Learning via Lazy Algorithms

1 Mins read
We study the problem of private online learning, specifically, online prediction from experts (OPE) and online convex optimization (OCO). We propose a…

 

 

Leave a Reply

Your email address will not be published. Required fields are marked *