← Back to all news
arXiv Machine Learning By Roxana Barrios, Ioannis Sgouralis

Tensorized algorithms and scalable filtering methods for hidden Markov and factorial hidden Markov models

Read the original on arXiv Machine Learning →

arXiv:2607. 07008v1 Announce Type: cross Abstract: A common method for the representation and analysis of time-series data is the hidden Markov model (HMM), where each observation is associated with a hidden state that evolves over time.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 16

High-Performance Tensor Formulation of the Viterbi Algorithm for Hidden Semi-Markov Models

The paper introduces a tensor-based formulation of the Viterbi algorithm for Hidden Semi-Markov Models (HSMMs), converting inner loops into tensor operations that align with SIMD and massively parallel architectures. It presents optimized implementations for single- and multi-core CPUs and, for the first time, GPUs. Experiments show speedups of up to 14× on a single core, over 200× with multi-core, and more than 570× on GPU compared to the sequential baseline, setting a new performance benchmark for large-scale HSMM decoding.

By Lorenzo Piarulli, Elia Belli, Daniele De Sensi
benchmarks
More like this →
arXiv Machine Learning
5d ago

Bayesian Tensor Autoencoder with Physics-informed Predictive Prior for Multi-dimensional Time Series Anomaly Detection

The paper introduces a Physics-informed Predictive Prior Tensor Autoencoder (PPPTAE) for anomaly detection in multi-dimensional time series. It combines reconstruction-based and prediction-based autoencoders by embedding a Bayesian fusion approach and a predictive prior that respects tensor correlations. The method incorporates physical laws via tensor low‑rank decomposition to prevent over‑generalization and is validated on real‑world datasets.

By Jianan Liu, Chunguang Li
More like this →