Metraipolis › archive › dc_2c7b808a33bd
High-Performance Tensor Formulation of the Viterbi Algorithm for Hidden Semi-Markov Models — arXiv:2609.16500
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.16500
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T19:29:39.714Z
- SHA-256 of the archived text
6ce1be983d54a93232b39267d838b5070470e505a1f690557d9443ae1c093132- Stable URL of this page
https://metraipolis.com/documento/dc_2c7b808a33bd
How to cite
High-Performance Tensor Formulation of the Viterbi Algorithm for Hidden Semi-Markov Models — arXiv:2609.16500 — arXiv (en), https://arxiv.org/abs/2609.16500 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2c7b808a33bd (Metraipolis archive dc_2c7b808a33bd, sha256 6ce1be983d54a93232b39267d838b5070470e505a1f690557d9443ae1c093132)
BibTeX
@misc{dc2c7b808a33bd,
title = {High-Performance Tensor Formulation of the Viterbi Algorithm for Hidden Semi-Markov Models — arXiv:2609.16500},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.16500},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2c7b808a33bd; sha256 6ce1be983d54a93232b39267d838b5070470e505a1f690557d9443ae1c093132},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.16500. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Hidden Semi-Markov Models (HSMMs) are fundamental probabilistic models widely adopted across diverse domains, from computational biology to finance and signal processing. The Viterbi algorithm decodes the most likely state sequence given an HSMM and can be applied iteratively for ab initio model learning. However, existing Viterbi implementations remain sequential, and GPU-accelerated solutions are entirely absent, making HSMM decoding impractical for large-scale workloads. We present a tensor-based formulation of the Viterbi algorithm for HSMMs, restructuring the inner loops into tensor operations that naturally map onto SIMD units and massively parallel architectures. Building on this formulation, we provide optimized implementations spanning single- and multi-core CPUs, and, for the first time, GPU. Experimental evaluation demonstrates speedups of up to 14x on a single core, over 200x with multi-core, and over 570x on GPU over the state-of-the-art sequential baseline, establishing a new performance baseline for large-scale HSMM decoding. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-16 in cs.DC). Categorie arXiv: Machine Learning (cs.LG) ; Distributed, Parallel, and Cluster Computing (cs.DC); Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2609.16500 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T18:35:05.433Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).