arXiv AI

Bayesian Nonparametric Dynamical Clustering of Time Series

The paper introduces a Bayesian non‑parametric method for clustering time series that allows an unbounded number of clusters to evolve by switching among an unknown number of regimes with linear dynamics. It employs a hierarchical Dirichlet process prior for the Switching Linear Dynamical System parameters and a Gaussian process prior to capture amplitude and temporal alignment variations within each cluster. The approach formulates a variational lower bound for both offline and online inference, enabling efficient learning, and demonstrates its effectiveness on electrocardiogram datasets.

arXiv Machine Learning
Aug 18

QSMP: finding representative time series subsequences through Quick Shift+Matrix Profile

arXiv:2608. 15492v1 Announce Type: new Abstract: Finding representative waveforms in long time series has scientific and practical value in many domains, as it enables summarization and visualization of large time series datasets, and downstream tasks like classification and forecasting.

By Carlos H. Mendoza-Cardenas, Rogers F. Silva, Austin J. Brockmeier
arXiv Machine Learning
Oct 28

The Clustering Occupation Kernel (CLOCK) Method for Time Series Arising from Dynamical Systems

The paper introduces the Clustering Occupation Kernel (CLOCK) method, a representation-based framework that embeds time series from dynamical systems into a reproducing kernel Hilbert space using a time‑averaged occupation kernel. This embedding allows trajectory comparison via the RKHS norm and, for differential equation systems, approximates the kernel mean embedding of the invariant Sinai‑Ruelle‑Bowen measure, effectively measuring the maximum mean discrepancy between attractors. CLOCK handles unequal‑length and irregularly‑spaced data, incorporates Takens’ embedding for general time series, and demonstrates superior performance over benchmark methods on synthetic data and real intracranial EEG recordings, with ablation studies confirming theoretical convergence and noise robustness.

By Michael L. Wells, Kamel Lahouel, Victor Rielly, Bruno Jedynak
arXiv AI
Sep 7

MedFlow: Class-Aware Multi-Scale Generation for Medical Time-Series Synthesis

MedFlow is a class‑aware multi‑scale flow matching framework designed to synthesize medical time‑series data. It uses a vector‑quantized multi‑scale tokenizer to capture both coarse and fine temporal patterns, and introduces Token Marginal Guidance to steer generation toward minority‑class characteristics. Experiments on four public datasets show MedFlow outperforms diffusion baselines, improving AUPRC by 5.8%, reducing Context‑FID by 88.6%, and achieving 3.8× higher sampling throughput.

By Yanhao Huang, Shibo Feng, Wanjin Feng, Peilin Zhao, Chunyan Miao
arXiv Machine Learning
Oct 16

Time-partitioning Gaussian Process Mixture Model

The Time-partitioning Gaussian Process Mixture Model (TPGPMM) is a Bayesian nonparametric framework that identifies persistent regimes and models nonstationary dependence in time series. It uses an adaptive Pitman–Yor prior on contiguous segmentations combined with regime-specific Gaussian processes, and learns change points and hyperparameters via a split–merge Metropolis-within-Gibbs sampler. Experiments on the CBOE Volatility Index and the 10‑year U.S. Treasury yield recover regime structures aligned with major market and monetary‑policy events, while variants that estimate observation noise improve predictive accuracy but may reduce sparsity or event alignment.

By Guilherme Piantino, Hedibert F. Lopes
arXiv Machine Learning
Jun 19

Variational Consensus Monte Carlo for Bayesian Mixture

arXiv:2606. 19643v1 Announce Type: cross Abstract: Motivated by the privacy, sensitivity and sharing limitations of health data, we present a comprehensive pipeline for inference of Bayesian mixture models within a federated learning setting, i.

By Julie Fendler, Francesca L. Crowe, Tom Marshall, Sylvia Richardson, Paul D. W. Kirk
arXiv Machine Learning
Jul 21

Causal Discovery on Irregular Time Series

arXiv:2607. 18226v1 Announce Type: new Abstract: Causal discovery methods have shown strong performance in temporal systems, but they typically rely on regular and discrete lag structures, limiting their applicability to regularly sampled data.

By Martim Penim, Ricardo Ribeiro Pereira, Jacopo Bono, Hugo Ferreira, M\'ario A. T. Figueiredo, Pedro Bizarro
arXiv Machine Learning
Oct 12

Bayesian Nonparametric Mixed-Effect ODEs with Gaussian Processes

The paper introduces MEGPODE, a Bayesian nonparametric mixed‑effect ODE framework that models each subject’s dynamics as a combination of a shared population component and a subject‑specific deviation, both governed by Gaussian process priors. It avoids repeated ODE solves by representing latent trajectories with state‑space GP priors and penalizing derivative discrepancies on a finite time grid, enabling a single variational objective for joint inference of trajectories and vector fields. Experiments on heterogeneous oscillatory and biomedical ODE benchmarks show that MEGPODE outperforms strong baselines in recovering population‑level fields and predicting subject‑level trajectories.

By Julien Martinelli, Maksim Sinelnikov, Harri L\"ahdesm\"aki, Quentin Clairon, M\'elanie Prague
Hugging Face Trending Papers
Jul 20

Causal Discovery on Irregular Time Series

Causal discovery methods have shown strong performance in temporal systems, but they typically rely on regular and discrete lag structures, limiting their applicability to regularly sampled data. However, many real-world tasks require dealing with irregularly sampled streams of events, such as sensor streams, healthcare data, and financial transactions.