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

被引:0
|
作者
Camellini, Filippo [1 ]
Franchini, Giorgia [1 ]
Prato, Marco [1 ]
机构
[1] Univ Modena & Reggio Emilia, Dept Phys Informat & Math, Via Campi 213-B, I-41125 Modena, Italy
关键词
Optimization; convolutional neural networks; <italic>p</italic>th root matrix; transition natrices; credit risk modeling;
D O I
10.1080/00207160.2024.2439328
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页数:18
相关论文
共 50 条
  • [21] A deep learning unsupervised approach for fault diagnosis of household appliances
    Cordoni, Francesco
    Bacchiega, Gianluca
    Bondani, Giulio
    Radu, Robert
    Muradore, Riccardo
    IFAC PAPERSONLINE, 2020, 53 (02): : 10749 - 10754
  • [22] SEM Image Quality Enhancement: An Unsupervised Deep Learning Approach
    Yu, Liangjiang
    Zhou, Wentian
    Pu, Lingling
    Fang, Wei
    METROLOGY, INSPECTION, AND PROCESS CONTROL FOR MICROLITHOGRAPHY XXXIV, 2020, 11325
  • [23] A Pade family of iterations for the matrix sector function and the matrix pth root
    Laszkiewicz, Beata
    Zietak, Krystyna
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2009, 16 (11-12) : 951 - 970
  • [24] On stochasticity preserving methods for the computation of the matrix pth root
    Politi, Tiziano
    Popolizio, Marina
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2015, 110 : 53 - 68
  • [25] On the matrix pth root functions and generalized Fibonacci sequences
    Ben Taher, Rajae
    El Khatabi, Youness
    Rachidi, Mustapha
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2018, 39 (07): : 1483 - 1504
  • [26] Fast verified computation for the matrix principal pth root
    Miyajima, Shinya
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 330 : 276 - 288
  • [27] Root Dilaceration Using Deep Learning: A Diagnostic Approach
    Celik, Berrin
    Celik, Mahmut Emin
    APPLIED SCIENCES-BASEL, 2023, 13 (14):
  • [28] Deep learning approach for matrix completion using manifold learning
    Mehrdad, S.
    Kahaei, M. H.
    SIGNAL PROCESSING, 2021, 188
  • [29] Deep learning approach for matrix completion using manifold learning
    Mehrdad, S.
    Kahaei, M.H.
    Signal Processing, 2021, 188
  • [30] An unsupervised learning algorithm for membrane computing
    Peng, Hong
    Wang, Jun
    Perez-Jimenez, Mario J.
    Riscos-Nunez, Agustin
    INFORMATION SCIENCES, 2015, 304 : 80 - 91