Transition matrices are a tool used to describe transition probabilities of a Markovian process. From an applied perspective, transition matrices are, for example, used in the fields of credit risk modeling and medical decision analysis. In these domains, it is possible to estimate matrices according to the frequency of data observations, but for modeling purposes, it may be necessary to calculate transition matrices for shorter and more restricted time intervals. From a mathematical perspective, this requirement translates into calculating the pth root of a stochastic matrix through a constrained optimization problem. This article focuses on computing pth root of transition matrices and proposes a novel approach using deep learning-based algorithms, particularly Convolutional Neural Networks. Comparisons with traditional algorithms reveal that, in certain contexts, deep learning models offer computational advantages, especially regarding time efficiency. The applicability of the models is verified through a case study built on Fitch Ratings data.

Computing pth root of a transition matrix with a deep unsupervised learning approach / Camellini, Filippo; Franchini, Giorgia; Prato, Marco. - In: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS. - ISSN 0020-7160. - (2025), pp. 1-20. [10.1080/00207160.2024.2439328]

Computing pth root of a transition matrix with a deep unsupervised learning approach

Filippo Camellini
;
Giorgia Franchini;Marco Prato
2025

Abstract

Transition matrices are a tool used to describe transition probabilities of a Markovian process. From an applied perspective, transition matrices are, for example, used in the fields of credit risk modeling and medical decision analysis. In these domains, it is possible to estimate matrices according to the frequency of data observations, but for modeling purposes, it may be necessary to calculate transition matrices for shorter and more restricted time intervals. From a mathematical perspective, this requirement translates into calculating the pth root of a stochastic matrix through a constrained optimization problem. This article focuses on computing pth root of transition matrices and proposes a novel approach using deep learning-based algorithms, particularly Convolutional Neural Networks. Comparisons with traditional algorithms reveal that, in certain contexts, deep learning models offer computational advantages, especially regarding time efficiency. The applicability of the models is verified through a case study built on Fitch Ratings data.
2025
1
20
Computing pth root of a transition matrix with a deep unsupervised learning approach / Camellini, Filippo; Franchini, Giorgia; Prato, Marco. - In: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS. - ISSN 0020-7160. - (2025), pp. 1-20. [10.1080/00207160.2024.2439328]
Camellini, Filippo; Franchini, Giorgia; Prato, Marco
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1364689
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact