mlsanityData to 14 Oct 2026

T-SaS: Toward Shift-aware Dynamic Adaptation for Streaming Data

arXiv 2309.02610 ↗First posted 5 Sep 2023cs.LG cs.DScited by 3

Not on the map. Why?

Abstract (arXiv)

In many real-world scenarios, distribution shifts exist in the streaming data across time steps. Many complex sequential data can be effectively divided into distinct regimes that exhibit persistent dynamics. Discovering the shifted behaviors and the evolving patterns underlying the streaming data are important to understand the dynamic system. Existing methods typically train one robust model to work for the evolving data of distinct distributions or sequentially adapt the model utilizing explicitly given regime boundaries. However, there are two challenges: (1) shifts in data streams could happen drastically and abruptly without precursors. Boundaries of distribution shifts are usually unavailable, and (2) training a shared model for all domains could fail to capture varying patterns. This paper aims to solve the problem of sequential data modeling in the presence of sudden distribution shifts that occur without any precursors. Specifically, we design a Bayesian framework, dubbed as T-SaS, with a discrete distribution-modeling variable to capture abrupt shifts of data. Then, we design a model that enable adaptation with dynamic network selection conditioned on that discrete variable. The proposed method learns specific model parameters for each distribution by learning which neurons should be activated in the full network. A dynamic masking strategy is adopted here to support inter-distribution transfer through the overlapping of a set of sparse networks. Extensive experiments show that our proposed method is superior in both accurately detecting shift boundaries to get segments of varying distributions and effectively adapting to downstream forecast or classification tasks.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 18 of its 33 references that are in the map. First posted on arXiv 5 Sep 2023.

Builds on

18 of 33 references.

References · 18

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  2. 2018Deep Visual Domain Adaptation: A Surveycited by 635
  3. 2018A Survey of Unsupervised Deep Domain Adaptationcited by 361
  4. 2017Variational Continual Learningcited by 339
  5. 2021AdaRNN: Adaptive Learning and Forecasting of Time Seriescited by 121
  6. 2021Continual Learning via Local Module Compositioncited by 63
  7. 2019Continuous Meta-Learning without Taskscited by 50
  8. 2019Collapsed Amortized Variational Inference for Switching Nonlinear Dynamical Systemscited by 26
  9. 2021Deep Explicit Duration Switching Models for Time Seriescited by 17
  10. 2022Towards Faithful and Consistent Explanations for Graph Neural Networkscited by 13
  11. 2022TopoImb: Toward Topology-level Imbalance in Learning from Graphscited by 12
  12. 2022Explanation Guided Contrastive Learning for Sequential Recommendationcited by 11
6 more
  1. 2022Mitigating Popularity Bias in Recommendation with Unbalanced Interactions: A Gradient Perspectivecited by 11
  2. 2022Semi-supervised Drifted Stream Learning with Short Lookbackcited by 7
  3. 2022Synthetic Over-sampling for Imbalanced Node Classification with Graph Neural Networkscited by 6
  4. 2023Faithful and Consistent Graph Neural Network Explanations with Rationale Alignmentcited by 6
  5. 2023Skill Disentanglement for Imitation Learning from Suboptimal Demonstrationscited by 5
  6. 2023Graph Relation Aware Continual Learningcited by 3

Built on by

Cited by year

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

3 papers.