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 条
  • [1] Rational Minimax Iterations for Computing the Matrix pth Root
    Evan S. Gawlik
    Constructive Approximation, 2021, 54 : 1 - 34
  • [2] Rational Minimax Iterations for Computing the Matrix pth Root
    Gawlik, Evan S.
    CONSTRUCTIVE APPROXIMATION, 2021, 54 (01) : 1 - 34
  • [3] An analysis on the efficiency of Euler's method for computing the matrix pth root
    Ling, Yonghui
    Huang, Zhengda
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2017, 24 (06)
  • [4] A Deep Learning Approach to Unsupervised Ensemble Learning
    Shaham, Uri
    Cheng, Xiuyuan
    Dror, Omer
    Jaffe, Ariel
    Nadler, Boaz
    Chang, Joseph
    Kluger, Yuval
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 48, 2016, 48
  • [5] Algorithms for the matrix pth root
    Bini, D
    Higham, N
    Meini, B
    NUMERICAL ALGORITHMS, 2005, 39 (04) : 349 - 378
  • [6] Algorithms for the matrix pth root
    Dario A. Bini
    Nicholas J. Higham
    Beatrice Meini
    Numerical Algorithms, 2005, 39 : 349 - 378
  • [7] Deep Unsupervised Active Learning via Matrix Sketching
    Li, Changsheng
    Li, Rongqing
    Yuan, Ye
    Wang, Guoren
    Xu, Dong
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2021, 30 : 9280 - 9293
  • [8] STOCHASTIC pTH ROOT APPROXIMATION OF A STOCHASTIC MATRIX: A RIEMANNIAN OPTIMIZATION APPROACH
    Durastante, Fabio
    Meini, Beatrice
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2024, 45 (02) : 875 - 904
  • [9] An Unsupervised Deep Learning Approach for Scenario Forecasts
    Chen, Yize
    Wang, Xiyu
    Zhang, Baosen
    2018 POWER SYSTEMS COMPUTATION CONFERENCE (PSCC), 2018,
  • [10] Generative approach to unsupervised deep local learning
    Chen, Changlu
    Niu, Chaoxi
    Zhan, Xia
    Zhan, Kun
    JOURNAL OF ELECTRONIC IMAGING, 2019, 28 (04)