Skip to content

Domain Generalization under Sampling Pattern Shifts in Irregular Time Series

Sep 2026 · 0 citations · 38 references
Computer Science

TL;DR

This work introduces HAR-C, to the best of its knowledge the first controlled benchmark for sampling pattern shifts in ISMTS, and proposes PRISM, a DG framework that first learns complementary feature-centric and sampling-centric representations without task labels and subsequently performs robust supervised training across diverse sampling variations to discourage brittle shortcut reliance.

Abstract

Irregularly sampled multivariate time series (ISMTS) are prevalent in real-world applications, where both observation times and available measurements can vary substantially across domains. While recent models increasingly exploit such sampling information for prediction, its robustness under sampling pattern shifts remains underexplored. We introduce HAR-C, to the best of our knowledge the first controlled benchmark for sampling pattern shifts in ISMTS, and show that sampling shifts alone can substantially degrade performance, induce sampling-specific shortcuts, and remain challenging for existing domain generalization (DG) methods. Motivated by these findings, we propose PRISM, a DG framework that first learns complementary feature-centric and sampling-centric representations without task labels, and subsequently performs robust supervised training across diverse sampling variations to discourage brittle shortcut reliance. Extensive experiments on controlled and real-world ISMTS benchmarks demonstrate that PRISM consistently improves robustness to unseen sampling shifts over existing methods. Our code is available at https://anonymous.4open.science/r/PRISM.

View source

Similar papers

#machine learning Preprint Sep 2026

Learnable Time-Frequency Masks for Explaining Time-Series Classifiers

Time-series explainability remains challenging because discriminative information is often encoded in latent frequency or time-frequency features rather than in the raw signal itself. Existing attribution methods typically operate either in the time domain or in a fixed transform domain, limiting their ability to captu...

T. D. Frehr, Francisco J. Pelayo, Lukas Raad et al. · 0 citations
#machine learning Preprint Oct 2026

INCONVENIENT: A Benchmark to Assess LLM Generalization Capabilities from Convenience Samples

INCONVENIENT is introduced, a benchmark designed to study robustness to convenience-sample bias and provides explicit control over both the direction and severity of relationship shifts, enabling a systematic assessment of robustness to convenience sampling.

Sara Rezaeimanesh, C. Klochko, Kundan Thind et al. · 0 citations

SwitchPFN: Shared Switching Dynamics for Frozen In-Context Time Series Classification

This work proposes SwitchPFN, which learns a shared projection and regime codebook from the training sequences, making local dynamic operators and transition features directly comparable across samples, and achieves the highest mean accuracy among the evaluated methods.

Zhen-Yi Zhu, Jacqueline J. Pang, Pei-Lin Shen et al. · 0 citations
#machine learning Preprint Oct 2026

QiYao-I: A Manifold Based Foundation Model for Irregular Multivariate Time Series Forecasting

This work introduces a novel sampling-conditioned temporal manifold attention mechanism that maps real timestamps into a learnable temporal manifold feature space and injects temporal manifold biases into attention layers, enabling the model to capture both irregular time intervals and local sampling structures.

Lin-Feng Wang, Rui-Tong Zhang, Kai Zhao et al. · 0 citations

Towards Robust Time Series Learning via Capacity-Centric Modulation

Sample-level reliability heterogeneity is common in deep time series learning. Standard training pipelines apply a uniform regularization setting to all samples, which can under-regularize corrupted samples and over-restrict clean samples. Common robustness approaches filter observations in data space or impose priors...

Si-Ru Zhong, Sen-Zhang Wang, James T. Kwok et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Optimal Transport Reweighting for Robust Learning under Spurious Correlations and Label Noise

POTER is proposed, a reweighting framework based on optimal transport that derives sample importance from the transport geometry between the training distribution and a reference distribution constructed from limited validation group annotations, and achieves state-of-the-art worst-group accuracy.

Sungho Jo, Seonghwi Kim, Wonsang Yun et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.