<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    ojs
   </journal-id>
   <journal-title-group>
    <journal-title>
     Open Journal of Statistics
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2161-718X
   </issn>
   <issn publication-format="print">
    2161-7198
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/ojs.2024.145028
   </article-id>
   <article-id pub-id-type="publisher-id">
    ojs-137058
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Physics 
     </subject>
     <subject>
       Mathematics
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    The Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Brighton
      </surname>
      <given-names>
       Mahohoho
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aDepartment of Mathematics&amp;Computational Sciences, University of Zimbabwe, Harare, Zimbabwe
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     30
    </day> 
    <month>
     09
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    14
   </volume> 
   <issue>
    05
   </issue>
   <fpage>
    634
   </fpage>
   <lpage>
    665
   </lpage>
   <history>
    <date date-type="received">
     <day>
      2,
     </day>
     <month>
      July
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      28,
     </day>
     <month>
      July
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      28,
     </day>
     <month>
      October
     </month>
     <year>
      2024
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    This study proposes a novel approach for estimating automobile insurance loss reserves utilizing Artificial Neural Network (ANN) techniques integrated with actuarial data intelligence. The model aims to address the challenges of accurately predicting insurance claim frequencies, severities, and overall loss reserves while accounting for inflation adjustments. Through comprehensive data analysis and model development, this research explores the effectiveness of ANN methodologies in capturing complex nonlinear relationships within insurance data. The study leverages a data set comprising automobile insurance policyholder information, claim history, and economic indicators to train and validate the ANN-based reserving model. Key aspects of the methodology include data preprocessing techniques such as one-hot encoding and scaling, followed by the construction of frequency, severity, and overall loss reserving models using ANN architectures. Moreover, the model incorporates inflation adjustment factors to ensure the accurate estimation of future loss reserves in real terms. Results from the study demonstrate the superior predictive performance of the ANN-based reserving model compared to traditional actuarial methods, with substantial improvements in accuracy and robustness. Furthermore, the model’s ability to adapt to changing market conditions and regulatory requirements, such as IFRS17, highlights its practical relevance in the insurance industry. The findings of this research contribute to the advancement of actuarial science and provide valuable insights for insurance companies seeking more accurate and efficient loss reserving techniques. The proposed ANN-based approach offers a promising avenue for enhancing risk management practices and optimizing financial decision-making processes in the automobile insurance sector. 
   </abstract>
   <kwd-group> 
    <kwd>
     Artificial Neural Network
    </kwd> 
    <kwd>
      Actuarial Loss Reserving
    </kwd> 
    <kwd>
      Machine Learning
    </kwd> 
    <kwd>
      Intelligent Model
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>The Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model represents a sophisticated approach to estimating loss reserves in the automobile insurance industry. This model integrates advanced artificial neural network techniques with actuarial data intelligence to improve the accuracy and reliability of loss reserve estimations. In this discussion, we will explore the concept, application, rationale, and importance of this innovative approach.</p>
   <p>The concept of the ANN-based Automobile Insurance Loss Reserving Model revolves around utilizing artificial neural networks, which are computational models inspired by the structure and functioning of the human brain, to analyze and predict patterns in insurance data. By leveraging large volumes of historical insurance data, including policyholder information, claim frequencies, severities, and economic indicators, the model learns complex relationships and dependencies to make accurate loss reserve estimations <xref ref-type="bibr" rid="scirp.137058-1">
     [1]
    </xref>.</p>
   <p>The application of the ANN-based Automobile Insurance Loss Reserving Model is broad and encompasses various aspects of the insurance industry. Primarily, the model is utilized by insurance companies to estimate future loss reserves, which are crucial for financial planning, risk management, and regulatory compliance <xref ref-type="bibr" rid="scirp.137058-2">
     [2]
    </xref>. Additionally, the model can assist actuaries and underwriters in assessing the adequacy of insurance reserves, setting premium rates, and optimizing claims management processes.</p>
   <p>The rationale behind developing the ANN-based Automobile Insurance Loss Reserving Model stems from the limitations of traditional actuarial methods in accurately capturing the complexities inherent in insurance data. Traditional techniques, such as chain ladder and regression-based models, often struggle to account for nonlinear relationships, interactions between variables, and dynamic changes in market conditions <xref ref-type="bibr" rid="scirp.137058-3">
     [3]
    </xref>. The ANN model addresses these shortcomings by employing a flexible and adaptive framework capable of learning intricate patterns from data.</p>
   <p>The importance of the ANN-based Automobile Insurance Loss Reserving Model lies in its ability to provide more accurate, timely, and reliable loss reserve estimations, thereby enhancing decision-making processes within insurance companies. By leveraging advanced computational techniques and actuarial expertise, the model enables insurers to better anticipate future liabilities, allocate capital more efficiently, and mitigate risks effectively. Moreover, the model’s capacity to adjust for inflation ensures that loss reserves are expressed in real terms, aligning with regulatory standards and financial reporting requirements.</p>
   <p>Finally, the Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model represents a significant advancement in insurance reserving practices. By harnessing the power of artificial intelligence and actuarial science, this model offers a more robust, flexible, and accurate approach to estimating loss reserves in the automobile insurance industry. Its widespread application holds promise for improving financial stability, risk management, and regulatory compliance across the insurance sector.</p>
   <sec id="s1_1">
    <title>1.1. The Inflation Adjusted Frequency Severity Loss Reserving Model</title>
    <p>The frequency of claims is modeled using a Poisson process, while the severity of claims is modeled using a Log-Normal distribution. To adjust for inflation, a time-dependent inflation index 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         I 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> is introduced, which modifies both the frequency and severity parameters over time.</p>
    <p>The inflation-adjusted frequency 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         λ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> and severity 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> are defined as:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         λ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          λ 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         × 
       </mo> 
       <mi>
         I 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math>(1)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          σ 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         × 
       </mo> 
       <mi>
         I 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math>(2)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         I 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> is the cumulative inflation index at time t, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          λ 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
      </mrow> 
     </math>, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          σ 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
      </mrow> 
     </math> are the base frequency and severity, respectively.</p>
    <fig id="fig1" position="float">
     <label>Figure 1</label>
     <caption>
      <title>1.2. Algorithm for Severity Adjustment<p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/1241865-rId33.jpeg?20241031120326" /></p>Theorem 1 (Inflation Impact on Frequency) If the inflation index 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   I
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> is increasing, then the expected number of claims increases over time.Proof. Given 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   λ
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
  
         <mo>
          
   =
  
         </mo>
  
         <msub> 
   
          <mi>
           
    λ
   
          </mi> 
   
          <mn>
           
    0
   
          </mn> 
  
         </msub> 
  
         <mo>
          
   ×
  
         </mo>
  
         <mi>
          
   I
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math>, and assuming 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   I
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> is increasing, it follows that 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   λ
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> is also increasing, thereby increasing the expected number of claims.□Lemma 2 (Severity Adjustment) The inflation-adjusted severity 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   σ
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> increases linearly with the inflation index 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   I
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math>.Proof. Since 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   σ
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
  
         <mo>
          
   =
  
         </mo>
  
         <msub> 
   
          <mi>
           
    σ
   
          </mi> 
   
          <mn>
           
    0
   
          </mn> 
  
         </msub> 
  
         <mo>
          
   ×
  
         </mo>
  
         <mi>
          
   I
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> and 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   I
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> is assumed to be a linear function, 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   σ
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> must also be linear in 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   I
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math>. □<xref ref-type="bibr" rid="scirp.137058-"></xref><p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/1241865-rId51.jpeg?20241031120326" /></p>Figure 1. Inflation adjusted frequency and severity over time.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId32.jpeg?20241031120325" />
    </fig>
    <p>From <xref ref-type="fig" rid="fig1">
      Figure 1
     </xref>, both frequency and severity are adjusted over time, which might be reflecting inflationary effects or changes in claim characteristics. Both frequency and severity are increasing linearly over time, but at different rates. The frequency increases faster (at a rate of 2 units per time period) compared to severity (at a rate of 1.5 units per time period). This suggests that while the number of claims or events is growing more rapidly, the severity of each claim is growing at a slower pace. In an actuarial context, understanding these trends is crucial for predicting future claim costs and adjusting reserves accordingly. If the frequency increases more rapidly than the severity, it could imply a growing number of smaller claims. Conversely, if severity increases faster than frequency, it may indicate larger claims or higher costs per claim.</p>
    <p>The Inflation Adjusted Frequency Severity Loss Reserving Model provides a robust framework for adjusting loss reserves in the presence of inflation <xref ref-type="bibr" rid="scirp.137058-4">
      [4]
     </xref>. Theoretical and algorithmic approaches discussed in this paper highlight the importance of incorporating inflation into both frequency and severity models to achieve accurate loss predictions and reserve calculations.</p>
   </sec>
   <sec id="s1_2">
    <title>1.3. Theory and Structure of Artificial Neural Network (ANN) Regression</title>
    <p>Artificial Neural Networks (ANNs) are computational models inspired by the human brain’s architecture and function. They consist of interconnected layers of neurons that can learn complex patterns from data. In regression tasks, ANNs are used to model the relationship between input variables and continuous output variables, making them powerful tools for predictive modeling. An ANN typically consists of an input layer, one or more hidden layers, and an output layer. Each layer is composed of neurons, and the connections between neurons are represented by weights. The network learns by adjusting these weights based on the input data and the associated target values.</p>
    <p>The output y of a neuron in the network can be expressed as:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         y 
       </mi> 
       <mo>
         = 
       </mo> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <munderover> 
          <mstyle mathsize="140%" displaystyle="true"> 
           <mo>
             ∑ 
           </mo> 
          </mstyle> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             = 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mi>
            n 
          </mi> 
         </munderover> 
         <mtext>
             
         </mtext> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           ⋅ 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mi>
           b 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>where:</p>
    <p>The activation function introduces non-linearity into the model, allowing the network to capture complex relationships. Common activation functions include <xref ref-type="bibr" rid="scirp.137058-4">
      [4]
     </xref>:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           + 
         </mo> 
         <msup> 
          <mtext>
            e 
          </mtext> 
          <mrow> 
           <mo>
             − 
           </mo> 
           <mi>
             x 
           </mi> 
          </mrow> 
         </msup> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mtext>
         ReLU 
       </mtext> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mtext>
         max 
       </mtext> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mi>
           x 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mtext>
         tanh 
       </mtext> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <msup> 
          <mtext>
            e 
          </mtext> 
          <mi>
            x 
          </mi> 
         </msup> 
         <mo>
           − 
         </mo> 
         <msup> 
          <mtext>
            e 
          </mtext> 
          <mrow> 
           <mo>
             − 
           </mo> 
           <mi>
             x 
           </mi> 
          </mrow> 
         </msup> 
        </mrow> 
        <mrow> 
         <msup> 
          <mtext>
            e 
          </mtext> 
          <mi>
            x 
          </mi> 
         </msup> 
         <mo>
           + 
         </mo> 
         <msup> 
          <mtext>
            e 
          </mtext> 
          <mrow> 
           <mo>
             − 
           </mo> 
           <mi>
             x 
           </mi> 
          </mrow> 
         </msup> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math></p>
    <p>The learning process in ANN involves minimizing a loss function, typically the Mean Squared Error (MSE) for regression tasks:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"> <mrow> 
       <mtext>
         MSE 
       </mtext> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mi>
          n 
        </mi> 
       </mfrac> 
       <munderover> 
        <mstyle displaystyle="true" mathsize="140%"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          n 
        </mi> 
       </munderover> 
       <msup> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              y 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mover accent="true"> 
             <mi>
               y 
             </mi> 
             <mo>
               ^ 
             </mo> 
            </mover> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mn>
          2 
        </mn> 
       </msup> 
      </mrow> 
     </math></p>
    <p>where:</p>
    <p>Proposition: The ANN minimizes the loss function using the gradient descent algorithm, which updates the weights by propagating the error backward through the network.</p>
    <p>Proof: Let L be the loss function, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
      </mrow> 
     </math> the weight to be updated, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        η 
      </mi> 
     </math> the learning rate. The update rule for the weight is given by:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mo>
           + 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         − 
       </mo> 
       <mi>
         η 
       </mi> 
       <mfrac> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <mi>
           L 
         </mi> 
        </mrow> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            t 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math></p>
    <p>The partial derivative 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mfrac> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <mi>
           L 
         </mi> 
        </mrow> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math> is computed using the chain rule:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mfrac> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <mi>
           L 
         </mi> 
        </mrow> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <mi>
           L 
         </mi> 
        </mrow> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <mover accent="true"> 
          <mi>
            y 
          </mi> 
          <mo>
            ^ 
          </mo> 
         </mover> 
        </mrow> 
       </mfrac> 
       <mo>
         ⋅ 
       </mo> 
       <mfrac> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <mover accent="true"> 
          <mi>
            y 
          </mi> 
          <mo>
            ^ 
          </mo> 
         </mover> 
        </mrow> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <msub> 
          <mi>
            z 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mo>
         ⋅ 
       </mo> 
       <mfrac> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <msub> 
          <mi>
            z 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
        <mrow> 
         <mo>
           ∂ 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math></p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          z 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the weighted sum of inputs to the neuron.</p>
    <p>Lemma: Under certain conditions, such as a sufficiently small learning rate 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        η 
      </mi> 
     </math> and a well-behaved loss function, the gradient descent algorithm will converge to a local minimum.</p>
    <p>Proof: Consider the Taylor expansion of the loss function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          w 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> around the current weight w:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           w 
         </mi> 
         <mo>
           + 
         </mo> 
         <mtext>
           Δ 
         </mtext> 
         <mi>
           w 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          w 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <mo>
         ∇ 
       </mo> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          w 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ⋅ 
       </mo> 
       <mtext>
         Δ 
       </mtext> 
       <mi>
         w 
       </mi> 
       <mo>
         + 
       </mo> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mn>
          2 
        </mn> 
       </mfrac> 
       <mtext>
         Δ 
       </mtext> 
       <msup> 
        <mi>
          w 
        </mi> 
        <mtext>
          T 
        </mtext> 
       </msup> 
       <mi>
         H 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          w 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mtext>
         Δ 
       </mtext> 
       <mi>
         w 
       </mi> 
       <mo>
         + 
       </mo> 
       <mi>
         O 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mtext>
           Δ 
         </mtext> 
         <msup> 
          <mi>
            w 
          </mi> 
          <mn>
            3 
          </mn> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mo>
         ∇ 
       </mo> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          w 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> is the gradient and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         H 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          w 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> is the Hessian matrix. If the learning rate is sufficiently small, the higher-order terms become negligible, ensuring that the weight updates lead to a decrease in the loss function <xref ref-type="bibr" rid="scirp.137058-5">
      [5]
     </xref>.</p>
    <p>Theorem: A feedforward neural network with a single hidden layer containing a finite number of neurons can approximate any continuous function on a compact subset of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          ℝ 
        </mi> 
        <mi>
          n 
        </mi> 
       </msup> 
      </mrow> 
     </math>, provided the activation function is non-linear.</p>
    <p>Proof: Given any continuous function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         f 
       </mi> 
       <mo>
         : 
       </mo> 
       <msup> 
        <mi>
          ℝ 
        </mi> 
        <mi>
          n 
        </mi> 
       </msup> 
       <mo>
         → 
       </mo> 
       <mi>
         ℝ 
       </mi> 
      </mrow> 
     </math> and any 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         ϵ 
       </mi> 
       <mo>
         &gt; 
       </mo> 
       <mn>
         0 
       </mn> 
      </mrow> 
     </math>, there exists a neural network function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         g 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> such that:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          | 
        </mo> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           − 
         </mo> 
         <mi>
           g 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          | 
        </mo> 
       </mrow> 
       <mo>
         &lt; 
       </mo> 
       <mi>
         ϵ 
       </mi> 
       <mtext>
           
       </mtext> 
       <mtext>
           
       </mtext> 
       <mtext>
           
       </mtext> 
       <mtext>
           
       </mtext> 
       <mo>
         ∀ 
       </mo> 
       <mi>
         x 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mtext>
         compact 
       </mtext> 
       <mtext>
           
       </mtext> 
       <mtext>
         subset 
       </mtext> 
       <mtext>
           
       </mtext> 
       <mtext>
         of 
       </mtext> 
       <mtext>
           
       </mtext> 
       <msup> 
        <mi>
          ℝ 
        </mi> 
        <mi>
          n 
        </mi> 
       </msup> 
      </mrow> 
     </math></p>
    <p>This proof relies on constructing the network to replicate the behavior of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> within the desired accuracy, leveraging the non-linearity of the activation function.</p>
    <p>Claim: The performance of ANN regression improves with the increase in the number of hidden layers and neurons, but it may suffer from overfitting if the model complexity is too high.</p>
    <p>Justification: As the network’s capacity increases, it can capture more complex patterns in the data, but it may also begin to model the noise, leading to overfitting. Regularization techniques such as L2 regularization or dropout are used to mitigate this issue <xref ref-type="bibr" rid="scirp.137058-6">
      [6]
     </xref>.</p>
    <p>ANN regression is a powerful tool for modeling complex relationships in data. By adjusting the network architecture and applying appropriate learning techniques, ANNs can be used to achieve high predictive accuracy. However, careful consideration must be given to the network’s capacity to avoid overfitting.</p>
    <fig id="fig2" position="float">
     <label>Figure 2</label>
     <caption>
      <title>The general algorithm for training an ANN involves initializing parameters, performing forward and backward passes, computing gradients, and updating the parameters iteratively until convergence. This process enables the ANN to learn from data and improve its predictive performance <xref ref-type="bibr" rid="scirp.137058-7">
        [7]
       </xref>.Artificial Neural Networks (ANNs) are computational models inspired by the human brain’s architecture and function. They consist of interconnected layers of neurons that can learn complex patterns from data. In regression tasks, ANNs are used to model the relationship between input variables and continuous output variables, making them powerful tools for predictive modeling.1.3.8. Structure of an ANN for RegressionAn ANN typically consists of an input layer, one or more hidden layers, and an output layer. Each layer is composed of neurons, and the connections between neurons are represented by weights. The network learns by adjusting these weights based on the input data and the associated target values.<xref ref-type="bibr" rid="scirp.137058-"></xref><p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/1241865-rId107.jpeg?20241031120339" /></p>Figure 2. General structure of an artificial neural network (ANN) model.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId106.jpeg?20241031120338" />
    </fig>
    <p>The diagram presented by <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref> illustrates the typical structure of an ANN, including the input layer, hidden layers, and output layer. Each neuron in one layer is connected to every neuron in the next layer, allowing the network to learn complex patterns.</p>
   </sec>
   <sec id="s1_3">
    <title>1.4. Significance and Importance of Artificial Neural Networks (ANN) in the Inflation Adjusted Frequency Severity Loss Reserving Model</title>
    <p>The development of actuarial loss reserving models, particularly in the context of inflation adjustment and frequency-severity modeling, has been significantly advanced by various machine learning methods. Among these, the Artificial Neural Network (ANN) method stands out due to its ability to model complex non-linear relationships and interactions that other traditional and machine learning methods may struggle with. This section explores the significance and importance of ANN in comparison to other machine learning methods in the development of the Inflation Adjusted Frequency Severity Loss Reserving model <xref ref-type="bibr" rid="scirp.137058-8">
      [8]
     </xref>.</p>
    <p>Artificial Neural Networks (ANNs) are a class of machine learning models inspired by the structure and function of biological neural networks. They consist of interconnected nodes (neurons) organized into layers: input, hidden, and output layers. The mathematical foundation of an ANN involves the following components:</p>
    <p>Let 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mstyle mathvariant="bold" mathsize="normal"> 
       <mi>
         x 
       </mi> 
      </mstyle> 
     </math> be the input vector, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mstyle mathvariant="bold" mathsize="normal"> 
       <mi>
         W 
       </mi> 
      </mstyle> 
     </math> the weight matrix, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mstyle mathvariant="bold" mathsize="normal"> 
       <mi>
         b 
       </mi> 
      </mstyle> 
     </math> the bias vector, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        a 
      </mi> 
     </math> the activation function. The output of a single neuron is given by:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         z 
       </mi> 
       <mo>
         = 
       </mo> 
       <msup> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           W 
         </mi> 
        </mstyle> 
        <mo>
          ⊤ 
        </mo> 
       </msup> 
       <mstyle mathvariant="bold" mathsize="normal"> 
        <mi>
          x 
        </mi> 
       </mstyle> 
       <mo>
         + 
       </mo> 
       <mstyle mathvariant="bold" mathsize="normal"> 
        <mi>
          b 
        </mi> 
       </mstyle> 
      </mrow> 
     </math>(3)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         a 
       </mi> 
       <mo>
         = 
       </mo> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          z 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>(4)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        σ 
      </mi> 
     </math> is the activation function, such as the sigmoid function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          z 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           + 
         </mo> 
         <msup> 
          <mtext>
            e 
          </mtext> 
          <mrow> 
           <mo>
             − 
           </mo> 
           <mi>
             z 
           </mi> 
          </mrow> 
         </msup> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math>, or the ReLU function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          z 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mtext>
         max 
       </mtext> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mi>
           z 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>.</p>
    <p>Training an ANN involves optimizing the weights 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mstyle mathvariant="bold" mathsize="normal"> 
       <mi>
         W 
       </mi> 
      </mstyle> 
     </math> and biases 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mstyle mathvariant="bold" mathsize="normal"> 
       <mi>
         b 
       </mi> 
      </mstyle> 
     </math> to minimize a loss function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            y 
          </mi> 
         </mstyle> 
         <mo>
           , 
         </mo> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mover accent="true"> 
           <mi>
             y 
           </mi> 
           <mo>
             ^ 
           </mo> 
          </mover> 
         </mstyle> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mstyle mathvariant="bold" mathsize="normal"> 
       <mi>
         y 
       </mi> 
      </mstyle> 
     </math> is the true output and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mstyle mathvariant="bold" mathsize="normal"> 
       <mover accent="true"> 
        <mi>
          y 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
      </mstyle> 
     </math> is the predicted output. Common loss functions include mean squared error (MSE) and cross-entropy loss. The training process typically involves gradient descent:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           W 
         </mi> 
        </mstyle> 
        <mrow> 
         <mi>
           n 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           W 
         </mi> 
        </mstyle> 
        <mrow> 
         <mi>
           o 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           d 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         − 
       </mo> 
       <mi>
         η 
       </mi> 
       <msub> 
        <mo>
          ∇ 
        </mo> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           W 
         </mi> 
        </mstyle> 
       </msub> 
       <mi>
         L 
       </mi> 
      </mrow> 
     </math>(5)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           b 
         </mi> 
        </mstyle> 
        <mrow> 
         <mi>
           n 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           b 
         </mi> 
        </mstyle> 
        <mrow> 
         <mi>
           o 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           d 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         − 
       </mo> 
       <mi>
         η 
       </mi> 
       <msub> 
        <mo>
          ∇ 
        </mo> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           b 
         </mi> 
        </mstyle> 
       </msub> 
       <mi>
         L 
       </mi> 
      </mrow> 
     </math>(6)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        η 
      </mi> 
     </math> is the learning rate and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mo>
          ∇ 
        </mo> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           W 
         </mi> 
        </mstyle> 
       </msub> 
       <mi>
         L 
       </mi> 
      </mrow> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mo>
          ∇ 
        </mo> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           b 
         </mi> 
        </mstyle> 
       </msub> 
       <mi>
         L 
       </mi> 
      </mrow> 
     </math> are the gradients of the loss function with respect to the weights and biases.</p>
   </sec>
   <sec id="s1_4">
    <title>1.5. Comparison of ANN with Other Machine Learning Methods</title>
    <p>Linear regression models the relationship between input features and the target variable using a linear function. While effective for simple relationships, it may not capture the complex non-linear interactions present in actuarial data. ANNs, with their multiple hidden layers and non-linear activation functions, offer greater flexibility and capability to model such complexities.</p>
    <p>Decision trees and random forests are ensemble methods that build models based on partitioning the feature space. Although they can handle non-linear relationships, they may suffer from overfitting and lack the smoothness of predictions. ANNs, by contrast, can generalize better and provide smooth and continuous predictions due to their structure.</p>
    <p>Support Vector Machines (SVMs) are powerful for classification tasks and can handle non-linear relationships using kernel functions. However, they may be computationally expensive and less interpretable for complex regression tasks. ANNs offer a more scalable approach and can efficiently handle large datasets with high-dimensional features.</p>
    <p>The Universal Approximation Theorem states that a feedforward ANN with a single hidden layer containing a sufficient number of neurons can approximate any continuous function to any desired degree of accuracy. This theorem highlights the theoretical power of ANNs in modeling complex, non-linear relationships in actuarial loss reserving.</p>
    <p>Theorem 3 (Universal Approximation Theorem) For any continuous function f defined on a closed and bounded interval 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mi>
           a 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           b 
         </mi> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, and for any 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         ϵ 
       </mi> 
       <mo>
         &gt; 
       </mo> 
       <mn>
         0 
       </mn> 
      </mrow> 
     </math>, there exists a neural network with a single hidden layer that approximates f within 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        ϵ 
      </mi> 
     </math> in the uniform norm.</p>
    <p>Proof</p>
    <p>To prove the Universal Approximation Theorem, we will construct a neural network that approximates the given continuous function f on the interval 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mi>
           a 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           b 
         </mi> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math> within any desired accuracy 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        ϵ 
      </mi> 
     </math>.</p>
    <p>Consider a neural network with a single hidden layer, where the activation function is a non-linear function such as the sigmoid function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. The output of this network can be expressed as:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"> <mrow> 
       <mover accent="true"> 
        <mi>
          f 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <munderover> 
        <mstyle displaystyle="true" mathsize="140%"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          N 
        </mi> 
       </munderover> 
       <mtext>
           
       </mtext> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            b 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <munderover> 
          <mstyle displaystyle="true" mathsize="140%"> 
           <mo>
             ∑ 
           </mo> 
          </mstyle> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mo>
             = 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mi>
            M 
          </mi> 
         </munderover> 
         <mtext>
             
         </mtext> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            v 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <mi>
         c 
       </mi> 
      </mrow> 
     </math>(7)</p>
    <p>where:</p>
    <p>We need to show that for any continuous function f on 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mi>
           a 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           b 
         </mi> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math> and for any 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         ϵ 
       </mi> 
       <mo>
         &gt; 
       </mo> 
       <mn>
         0 
       </mn> 
      </mrow> 
     </math>, there exists a neural network function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mi>
          f 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> that satisfies:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             f 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mover accent="true"> 
            <mi>
              f 
            </mi> 
            <mo>
              ^ 
            </mo> 
           </mover> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
       <mo>
         &lt; 
       </mo> 
       <mi>
         ϵ 
       </mi> 
      </mrow> 
     </math>(8)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mtext>
               
           </mtext> 
           <mo>
             ⋅ 
           </mo> 
           <mtext>
               
           </mtext> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
      </mrow> 
     </math> denotes the uniform norm.</p>
    <p>The proof leverages the fact that the sigmoid function can approximate any continuous function on a closed interval. We use the fact that any continuous function f on 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mi>
           a 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           b 
         </mi> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math> can be approximated by a series of sigmoids with appropriate parameters.</p>
    <p>First, let f be a continuous function on 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mi>
           a 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           b 
         </mi> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. The idea is to approximate f by a weighted sum of sigmoid functions. For a sufficiently large number of sigmoids N, we can construct:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"> <mrow> 
       <mover accent="true"> 
        <mi>
          f 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <munderover> 
        <mstyle displaystyle="true" mathsize="140%"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          N 
        </mi> 
       </munderover> 
       <mtext>
           
       </mtext> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            b 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <munderover> 
          <mstyle displaystyle="true" mathsize="140%"> 
           <mo>
             ∑ 
           </mo> 
          </mstyle> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mo>
             = 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mi>
            M 
          </mi> 
         </munderover> 
         <mtext>
             
         </mtext> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            v 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <mi>
         c 
       </mi> 
      </mrow> 
     </math>(9)</p>
    <p>such that:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             f 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mover accent="true"> 
            <mi>
              f 
            </mi> 
            <mo>
              ^ 
            </mo> 
           </mover> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
       <mo>
         &lt; 
       </mo> 
       <mi>
         ϵ 
       </mi> 
      </mrow> 
     </math>(10)</p>
    <p>To prove this, we need to show that the approximation error 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             f 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mover accent="true"> 
            <mi>
              f 
            </mi> 
            <mo>
              ^ 
            </mo> 
           </mover> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
      </mrow> 
     </math> can be made arbitrarily small.</p>
    <p>For any 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         ϵ 
       </mi> 
       <mo>
         &gt; 
       </mo> 
       <mn>
         0 
       </mn> 
      </mrow> 
     </math>, there exists a finite set of points 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            N 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math> in 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mi>
           a 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           b 
         </mi> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math> such that the function f can be approximated by a polynomial 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         p 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> with:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             f 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
       <mo>
         &lt; 
       </mo> 
       <mfrac> 
        <mi>
          ϵ 
        </mi> 
        <mn>
          2 
        </mn> 
       </mfrac> 
      </mrow> 
     </math>(11)</p>
    <p>The polynomial 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         p 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> can then be approximated by a sum of sigmoid functions. The approximation of a polynomial function by sigmoids follows from the fact that the sigmoid function, through its transformations and linear combinations, can approximate polynomials to arbitrary accuracy. Thus, for any polynomial 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         p 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> there exists a neural network function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mi>
          f 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> such that:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mover accent="true"> 
            <mi>
              f 
            </mi> 
            <mo>
              ^ 
            </mo> 
           </mover> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
       <mo>
         &lt; 
       </mo> 
       <mfrac> 
        <mi>
          ϵ 
        </mi> 
        <mn>
          2 
        </mn> 
       </mfrac> 
      </mrow> 
     </math>(12)</p>
    <p>Combining these approximations gives:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             f 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mover accent="true"> 
            <mi>
              f 
            </mi> 
            <mo>
              ^ 
            </mo> 
           </mover> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
       <mo>
         ≤ 
       </mo> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             f 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mover accent="true"> 
            <mi>
              f 
            </mi> 
            <mo>
              ^ 
            </mo> 
           </mover> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
       <mo>
         &lt; 
       </mo> 
       <mfrac> 
        <mi>
          ϵ 
        </mi> 
        <mn>
          2 
        </mn> 
       </mfrac> 
       <mo>
         + 
       </mo> 
       <mfrac> 
        <mi>
          ϵ 
        </mi> 
        <mn>
          2 
        </mn> 
       </mfrac> 
       <mo>
         = 
       </mo> 
       <mi>
         ϵ 
       </mi> 
      </mrow> 
     </math>(13)</p>
    <p>Thus, we have shown that for any continuous function f and any 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         ϵ 
       </mi> 
       <mo>
         &gt; 
       </mo> 
       <mn>
         0 
       </mn> 
      </mrow> 
     </math>, there exists a neural network function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mi>
          f 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> such that 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            ‖ 
          </mo> 
          <mrow> 
           <mi>
             f 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mover accent="true"> 
            <mi>
              f 
            </mi> 
            <mo>
              ^ 
            </mo> 
           </mover> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ‖ 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          ∞ 
        </mi> 
       </msub> 
       <mo>
         &lt; 
       </mo> 
       <mi>
         ϵ 
       </mi> 
      </mrow> 
     </math>.</p>
    <p>The proof demonstrates that the Universal Approximation Theorem holds, showing that a neural network with a single hidden layer and a sufficient number of neurons can approximate any continuous function on a closed and bounded interval to any desired accuracy. This result underpins the versatility and power of neural networks in approximating complex functions.</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Artificial Neural Networks offer a significant advantage in the development of the Inflation Adjusted Frequency Severity Loss Reserving model by providing a flexible and powerful framework for modeling complex, non-linear relationships. Their ability to approximate any continuous function, combined with their robustness and scalability, makes them a superior choice compared to other machine learning methods for this application.1.6. Originality and Novelty of the StudyThe study integrates cutting-edge technologies, such as artificial neural networks (ANNs), with actuarial science principles. While ANN techniques have been applied in various fields, their application in the specific context of automobile insurance loss reserving, particularly considering inflation adjustments, is relatively novel. Insurance data is inherently complex, with numerous interrelated factors influencing claim frequencies, severities, and overall loss reserves. The study proposes a comprehensive model that accounts for these complexities by leveraging ANNs to capture nonlinear relationships and interactions within the data, thereby improving the accuracy of loss reserve estimations. The inclusion of inflation adjustment factors in the loss reserving model adds a novel dimension to the study. By adjusting loss reserves for inflation, the model provides more accurate and relevant estimations of future claim payments, aligning with real-world financial considerations and regulatory requirements. By harnessing the predictive capabilities of ANNs, the study aims to enhance the accuracy and reliability of loss reserve estimations. ANNs have the ability to learn from large volumes of historical data and identify complex patterns, allowing for more precise predictions of future claim frequencies, severities, and overall loss reserves. The study’s focus on automobile insurance loss reserving addresses a critical need within the insurance industry. Accurate estimation of loss reserves is essential for insurers to effectively manage risk, allocate capital, and meet regulatory requirements. By developing a novel ANN-based model tailored to this specific domain, the study offers practical solutions to real-world challenges faced by insurance companies. The findings of the study have the potential to significantly impact the insurance industry by providing insurers with advanced tools and methodologies for loss reserving. By demonstrating the efficacy of the ANN-based model in accurately estimating loss reserves, the study may pave the way for broader adoption of advanced analytics techniques in insurance risk management practices. Finally, the originality and novelty of conducting a study on the Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model lie in its innovative approach to integrating advanced technologies with actuarial science principles to address the complexities of insurance data and enhance predictive capabilities in loss reserving.2. Review of MethodsThe Actuarial Data Intelligent Loss Reserving Model integrates advanced methodologies to address the complexities of estimating loss reserves in insurance. In this section, we review the key methods employed in developing this model, drawing upon relevant literature for support.ANNs have been widely utilized in predictive modeling within the insurance industry due to their ability to capture complex nonlinear relationships in data. <xref ref-type="bibr" rid="scirp.137058-2">
        [2]
       </xref> demonstrated the effectiveness of ANN models in estimating loss reserves by incorporating policyholder information, claim history, and economic indicators. By leveraging ANNs, the Actuarial Data Intelligent Loss Reserving Model aims to improve the accuracy and reliability of loss reserve estimations.Data preprocessing techniques play a crucial role in preparing input data for ANN modeling. This includes handling missing values, encoding categorical variables, and scaling numerical features. <xref ref-type="bibr" rid="scirp.137058-1">
        [1]
       </xref> highlighted the importance of data preprocessing in improving the performance of ANN models by enhancing the quality of input data. In the context of the Actuarial Data Intelligent Loss Reserving Model, preprocessing steps ensure that the input data is appropriately formatted for ANN analysis.Adjusting loss reserves for inflation is essential to ensure that future claim payments are expressed in real terms. <xref ref-type="bibr" rid="scirp.137058-3">
        [3]
       </xref> emphasized the significance of inflation adjustment in insurance reserving to account for changes in the value of currency over time. The Actuarial Data Intelligent Loss Reserving Model incorporates inflation adjustment factors to provide more accurate and relevant estimations of future liabilities.Studies by <xref ref-type="bibr" rid="scirp.137058-9">
        [9]
       </xref> and <xref ref-type="bibr" rid="scirp.137058-10">
        [10]
       </xref> have explored the application of advanced analytics techniques, including machine learning and predictive modeling, in insurance reserving. These studies highlight the potential benefits of integrating advanced analytics methodologies, such as ANNs, into traditional actuarial practices to improve the accuracy and efficiency of loss reserving processes.Research by <xref ref-type="bibr" rid="scirp.137058-11">
        [11]
       </xref> and <xref ref-type="bibr" rid="scirp.137058-12">
        [12]
       </xref> has examined the use of predictive modeling techniques, including generalized linear models and decision trees, in insurance reserving. These studies underscore the importance of predictive modeling in estimating loss reserves and managing insurance risk effectively.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId212.jpeg?20241031120350" />
    </fig>
    <p>Literature on inflation adjustment in insurance, such as the work by <xref ref-type="bibr" rid="scirp.137058-13">
      [13]
     </xref>, provides insights into methodologies for incorporating inflation factors into loss reserving models. These studies emphasize the necessity of adjusting loss reserves for inflation to ensure the adequacy of future claim payments.</p>
    <sec id="s1">
     <title>3. Data</title>
     <p>In carrying out a study on the Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model, it is crucial to simulate data variables that accurately represent the key aspects of automobile insurance. Here is an explanation of the simulated data variables in the study.</p>
     <p>These simulated variables are used to create a synthetic dataset that can be used for modeling and analyzing insurance claim data. They capture various aspects such as demographic information, driving experience, vehicle characteristics, and claim history, which are essential for insurance risk assessment and modeling.</p>
    </sec>
   </sec>
   <sec id="s3">
    <title>4. Methodology</title>
    <p>The proposed methodology for conducting a study on the Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model involves several key steps. Here, we outline the methodology, including comparisons with the traditional chain ladder method, adherence to IFRS17 regulations, and conducting robust tests, stress tests, and scenario tests.</p>
    <sec id="s3_1">
     <title>4.1. Data Collection and Preprocessing</title>
     <p>Gather historical automobile insurance data, including policyholder information, claim frequencies, severities, and economic indicators. Preprocess the data by handling missing values, encoding categorical variables, and scaling numerical features.</p>
    </sec>
    <sec id="s3_2">
     <title>4.2. Model Development</title>
     <p>Train an ANN-based loss reserving model using the preprocessed data <xref ref-type="bibr" rid="scirp.137058-14">
       [14]
      </xref>. The ANN model should incorporate variables such as policyholder demographics, vehicle characteristics, and historical claim data to predict future claim frequencies, severities, and overall loss reserves. Finally, develop a traditional chain ladder model for comparison purposes, using the same simulated automobile data set.</p>
    </sec>
    <sec id="s3_3">
     <title>4.3. Comparison with Chain Ladder Method</title>
     <p>Evaluate the performance of the ANN-based model against the traditional chain ladder method. Compare metrics such as accuracy, bias, and computational efficiency between the two models <xref ref-type="bibr" rid="scirp.137058-15">
       [15]
      </xref>. Assess whether the ANN model provides superior loss reserve estimations compared to the chain ladder method, particularly in capturing nonlinear relationships and adapting to changing market conditions.</p>
    </sec>
    <sec id="s3_4">
     <title>4.4. Adherence to IFRS17 Regulations</title>
     <p>Ensure that the proposed ANN-based model adheres to the requirements outlined in the International Financial Reporting Standard 17 (IFRS17) regarding insurance contract accounting. Specifically, verify that the model accurately accounts for inflation adjustments and produces loss reserve estimations that comply with IFRS17 guidelines <xref ref-type="bibr" rid="scirp.137058-16">
       [16]
      </xref>.</p>
    </sec>
    <sec id="s3_5">
     <title>4.5. Robust Tests, Stress Tests, and Scenario Tests</title>
     <p>Conduct robust tests to evaluate the stability and reliability of the ANN-based loss reserving model. Perform stress tests by subjecting the model to extreme scenarios, such as significant changes in claim frequencies or severities. Conduct scenario tests to analyze the model’s performance under specific scenarios, such as changes in economic conditions or regulatory requirements. Assess how well the model operates under different conditions and verify its ability to provide accurate and reliable loss reserve estimations <xref ref-type="bibr" rid="scirp.137058-17">
       [17]
      </xref>.</p>
    </sec>
    <sec id="s3_6">
     <title>4.6. Performance Evaluation and Validation</title>
     <p>Evaluate the performance of the ANN-based model using appropriate metrics such as Mean Absolute Error (MAE), Mean Squared Error (MSE), and Root Mean Squared Error (RMSE). Validate the model’s predictions against actual loss experience data to ensure accuracy and reliability. Compare the performance of the ANN-based model with the results obtained from traditional actuarial methods, such as chain ladder, to demonstrate its superiority.</p>
    </sec>
    <sec id="s3_7">
     <title>4.7. Interpretation and Conclusion</title>
     <p>Interpret the findings of the study, highlighting the advantages of the ANN-based loss reserving model over traditional methods. Conclude by summarizing the key findings, implications for the insurance industry, and recommendations for further research. By following this proposed methodology, researchers can effectively develop, evaluate, and validate the Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model, ensuring its adherence to IFRS17 regulatory standards, comparison with traditional methods, and robust performance under various conditions.</p>
    </sec>
   </sec>
   <sec id="s4">
    <title>5. Results</title>
    <p>This section presents the outcomes of this study respectively.</p>
    <p>The scatter plot matrix presented by <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref> provides visual insights into the relationships between different pairs of variables. Each scatter plot represents the relationship between two variables. In addition to that, the diagonal plots are histograms of each variable, showing the distribution of each variable individually and on the same note the off-diagonal Plots are scatter plots showing the relationship between pairs of variables. <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref> shows histogram of inflated claims and it visualizes the distribution of claim amounts after adjusting for inflation. The histogram is symmetric (bell-shaped). <xref ref-type="fig" rid="fig5">
      Figure 5
     </xref> shows the Box Plot of Claim Amounts by Gender which visualizes the distribution of claim amounts for each gender.</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 3. Pairwise scatter plot.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId213.jpeg?20241031120406" />
    </fig>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>Figure 4. Histogram for claim amounts (inflated).</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId214.jpeg?20241031120406" />
    </fig>
    <fig id="fig6" position="float">
     <label>Figure 6</label>
     <caption>
      <title>Figure 5. Box plots showing claim amounts by gender.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId215.jpeg?20241031120406" />
    </fig>
    <sec id="s4_1">
     <title>5.1. Correlation Analysis</title>
     <p>Correlation analysis is a statistical technique used to measure the strength and direction of the linear relationship between two or more variables. It is commonly used to assess the degree to which changes in one variable are associated with changes in another variable. Correlation analysis provides a numerical measure called the correlation coefficient, which quantifies the strength and direction of the relationship.</p>
     <p>The heat map presented by <xref ref-type="fig" rid="fig6">
       Figure 6
      </xref> uses colors to represent the strength and direction of correlations between variables. Typically, a gradient color scheme is used, where lighter colors (e.g., yellow or white) represent positive correlations, darker colors (e.g., blue or black) represent negative correlations, and neutral colors (e.g., green) represent no or weak correlations. The intensity of the color indicates the magnitude of the correlation, in the regards, the darker colors indicate stronger correlations. The rows and columns of the heat map represent the variables in the simulated general automobile data set. Moreover, each cell in the heat map represents the correlation between the variable corresponding to the row and the variable corresponding to the column. There is evidence of clusters of similar colors or gradients which may indicate groups of variables that are highly correlated with each other which resembles a perfect positive correlation.</p>
    </sec>
    <sec id="s4_2">
     <title>5.2. Model Building</title>
     <p>Building Artificial Neural Network (ANN) models for automating independent frequency and severity loss reserving involves several key steps in the context of insurance analytics. ANN models are a type of machine learning algorithm inspired by the structure and function of the human brain. They consist of interconnected nodes (neurons) organized into layers, with each layer responsible for different aspects of data processing. In this scenario, the frequency loss reserving</p>
     <fig id="fig7" position="float">
      <label>Figure 7</label>
      <caption>
       <title>Figure 6. Heat map showing correlation analysis.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId216.jpeg?20241031120409" />
     </fig>
     <p>model focuses on predicting the frequency of insurance claims. In this model, the input features typically include policyholder characteristics (e.g., age, driving experience, gender), policy attributes (e.g., annual mileage), and any other relevant variables that may influence claim frequency. The output is the predicted frequency of claims. This is automated with the severity loss reserving model which aims to predict the severity or size of insurance claims. Similar to the frequency model, it utilizes policyholder characteristics and policy attributes as input features. Additionally, it incorporates variables related to claim size or severity. The output is the predicted claim severity. Finally, the Automated Actuarial Loss Reserving (AALR) is a comprehensive modeling approach that integrates both frequency and severity components to estimate overall loss reserves in insurance portfolios and by combining frequency and severity models, AALR aims to provide a more accurate and efficient method for estimating future claim liabilities <xref ref-type="bibr" rid="scirp.137058-18">
       [18]
      </xref>.</p>
     <p>The frequency plot is presented by <xref ref-type="fig" rid="fig7">
       Figure 7
      </xref>, the severity plot is presented by <xref ref-type="fig" rid="fig8">
       Figure 8
      </xref> and the overall plot is presented by <xref ref-type="fig" rid="fig9">
       Figure 9
      </xref>. Similar to the other plots, the blue points represent the actual observed values, and the red line represents the fitted regression line. The three figures indicate a relatively better fit between observed and predicted losses.</p>
    </sec>
    <sec id="s4_3">
     <title>5.3. Model Evaluation</title>
     <p>Machine learning-based model evaluation involves assessing the performance</p>
     <fig id="fig8" position="float">
      <label>Figure 8</label>
      <caption>
       <title>Figure 7. Frequency plot.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId217.jpeg?20241031120411" />
     </fig>
     <fig id="fig9" position="float">
      <label>Figure 9</label>
      <caption>
       <title>Figure 8. Severity plot.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId218.jpeg?20241031120411" />
     </fig>
     <p>and accuracy of machine learning models using various evaluation metrics and these metrics quantify the difference between the predicted values generated by the model and the actual values observed in the dataset. Three commonly used metrics for evaluating regression models are Mean Absolute Error (MAE), Mean Squared Error (MSE), and Root Mean Squared Error (RMSE).</p>
     <p>
      <xref ref-type="fig" rid="fig10">
       Figure 10
      </xref> shows the MAE which measures the average absolute difference between the predicted and actual values. It gives equal weight to all errors regardless of their direction. <xref ref-type="fig" rid="fig11">
       Figure 11
      </xref> shows the MSE which measures the average of the squared differences between the predicted and actual values. <xref ref-type="fig" rid="fig12">
       Figure 12
      </xref> shows the RMSE which is the square root of the MSE. It provides a measure of</p>
     <fig id="fig10" position="float">
      <label>Figure 10</label>
      <caption>
       <title>Figure 9. Automated plot.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId219.jpeg?20241031120411" />
     </fig>
     <fig id="fig11" position="float">
      <label>Figure 11</label>
      <caption>
       <title>Figure 10. Mean Absolute Error (MAE).</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId220.jpeg?20241031120411" />
     </fig>
     <fig id="fig12" position="float">
      <label>Figure 12</label>
      <caption>
       <title>Figure 11. Mean square error (MSE).</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId221.jpeg?20241031120411" />
     </fig>
     <fig id="fig13" position="float">
      <label>Figure 13</label>
      <caption>
       <title>Figure 12. Root mean square error (RMSE).</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId222.jpeg?20241031120411" />
     </fig>
     <p>the average magnitude of the errors in the same units as the response variable. In short these errors are relatively smaller and hence the models are better for implementation.</p>
     <p>
      <xref ref-type="fig" rid="figFigures 10">
       Figures 10
      </xref>-<xref ref-type="bibr" rid="scirp.137058-#f12">
       12
      </xref> have been produced from <xref ref-type="table" rid="table1">
       Table 1
      </xref>, respectively.</p>
     <table-wrap id="table1">
      <label>
       <xref ref-type="table" rid="table1">
        Table 1
       </xref></label>
      <caption>
       <title>
        <xref ref-type="bibr" rid="scirp.137058-"></xref>Table 1. Performance evaluation metric.</title>
      </caption>
      <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
       <tr> 
        <td class="custom-bottom-td acenter" width="22.61%"><p style="text-align:center">Model</p></td> 
        <td class="custom-bottom-td acenter" width="22.61%"><p style="text-align:center">MAE</p></td> 
        <td class="custom-bottom-td acenter" width="22.61%"><p style="text-align:center">MSE</p></td> 
        <td class="custom-bottom-td acenter" width="22.61%"><p style="text-align:center">RMSE</p></td> 
       </tr> 
       <tr> 
        <td class="custom-top-td acenter" width="22.61%"><p style="text-align:center">Frequency</p></td> 
        <td class="custom-top-td acenter" width="22.61%"><p style="text-align:center">0.648</p></td> 
        <td class="custom-top-td acenter" width="22.61%"><p style="text-align:center">0.815</p></td> 
        <td class="custom-top-td acenter" width="22.61%"><p style="text-align:center">0.903</p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="22.61%"><p style="text-align:center">Severity</p></td> 
        <td class="acenter" width="22.61%"><p style="text-align:center">999.763</p></td> 
        <td class="acenter" width="22.61%"><p style="text-align:center">1001359.640</p></td> 
        <td class="acenter" width="22.61%"><p style="text-align:center">1000.680</p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="22.61%"><p style="text-align:center">Overall</p></td> 
        <td class="acenter" width="22.61%"><p style="text-align:center">771.415</p></td> 
        <td class="acenter" width="22.61%"><p style="text-align:center">1565928.084</p></td> 
        <td class="acenter" width="22.61%"><p style="text-align:center">1251.370</p></td> 
       </tr> 
      </table>
     </table-wrap>
    </sec>
    <sec id="s4_4">
     <title>5.4. Traditional Actuarial Loss Reserving: Chain Ladder Method from the Simulated Data</title>
     <p>The traditional actuarial loss reserving method employs the Chain Ladder Technique, a widely used method in insurance for estimating future claims reserves <xref ref-type="bibr" rid="scirp.137058-18">
       [18]
      </xref>. This method assumes that historical development patterns observed in past claims data will continue in the future. In that regard, the following subsections discuss how we applied this method to our simulated data and compared it with the overall model.</p>
     <p>We first structured our data into a run-off triangle, where the rows represent different policy years (or accident years) and the columns represent different development periods (or age of the claims). The claim amounts in the triangle represent the cumulative claim payments incurred over time. This triangle allows us to visualize the development of claims over time and serves as the foundation for the Chain Ladder Method.</p>
     <fig id="fig14" position="float">
      <label>Figure 14</label>
      <caption>
       <title>Figure 13. Run off triangle created from our simulated data.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId223.jpeg?20241031120413" />
     </fig>
     <p>
      <xref ref-type="fig" rid="fig13">
       Figure 13
      </xref> shows the 
      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         x 
       </mi> 
      </math>-axis of the plot being the development periods or the age of the claims. Each column corresponds to a different development period, indicating the time elapsed since the occurrence of the claims. On the same note, the 
      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         y 
       </mi> 
      </math>-axis of the plot represents the policy or accident years. Each row corresponds to a different policy or accident year, indicating when the claims were incurred. In the plot, the color intensity or shading of each cell represents the magnitude of the claim amounts. Darker shades typically indicate higher claim amounts, while lighter shades represent lower claim amounts. It is quite critical to observe diagonal patterns emerging from the bottom left to the top right of the plot and these diagonal patterns represent the development of claims over time for each policy or accident year. As you move along a diagonal, begin to track the progression of claims from their inception (occurrence) to subsequent development periods. Furthermore, the overall shape of the plot provides insights into the claims development patterns. The presence of the irregularities or deviations from smooth diagonal patterns indicate variations in claims development across different policy or accident years. By visually inspecting the plot, actuaries and analysts can identify trends, anomalies, and potential outliers in the claims data and his visual assessment helps in understanding the historical development patterns and forms the basis for estimating future claims reserves using techniques like the Chain Ladder Method.</p>
     <p>With the run-off triangle in hand, we applied the Chain Ladder Method to estimate the outstanding claims reserves (Incurred But Not Reported, IBNR) for each policy year and this method uses the observed development factors from historical data to extrapolate future development patterns. Underlying assumptions include the assumption of a consistent development pattern across policy years and the absence of significant changes in claim settlement practices or claim characteristics over time.</p>
     <p>After deriving the IBNR reserves using the Chain Ladder Method, we compared them with the predictions from our overall model. The overall model incorporates various predictor variables, such as age, driving experience, annual mileage, gender, etc., to directly estimate the IBNR reserves. By comparing the IBNR estimates from both methods, we evaluated the relative performance of the Chain Ladder Method against our overall model. Key metrics for comparison include accuracy, bias, and stability of predictions over time.</p>
     <p>The Chain Ladder Method assumes that historical claims development patterns will persist into the future. Moreover, it assumes no significant changes in claims settlement practices or claim characteristics over time. The overall model assumes that the selected predictor variables adequately capture the underlying risk factors affecting claims reserves. Throughout the process, we relied on established actuarial literature and methodologies (e.g., <xref ref-type="bibr" rid="scirp.137058-19">
       [19]
      </xref>, Taylor <xref ref-type="bibr" rid="scirp.137058-20">
       [20]
      </xref>) for guidance on implementing the Chain Ladder Method and evaluating its performance. The application of the overall model was informed by contemporary actuarial practices and machine learning techniques in insurance analytics (<xref ref-type="bibr" rid="scirp.137058-21">
       [21]
      </xref> <xref ref-type="bibr" rid="scirp.137058-22">
       [22]
      </xref>).</p>
    </sec>
    <sec id="s4_5">
     <title>5.5. Comparison between Traditional Chain Ladder Method vs Automated Actuarial Loss Reserving Model</title>
     <p>The runoff triangle represents historical data on claims incurred over time, typically organized by the age of claims (origin) and the development of these claims (development years). Each cell in the triangle represents the incurred loss for a specific combination of origin and development year. The Automated Actuarial Loss Model (AALM), in this case, the neural network model, predicts the expected loss reserve based on the input features (such as age, driving experience, etc.). For each observation in the test data set, the model predicts the expected loss reserve.</p>
     <p>The comparison begins by summarizing the total loss reserves across all origin years for both the runoff triangle and the automated model. This is done by summing up the values across each column of the runoff triangle and the predictions from the automated model. The comparison table provides a quantitative summary of the total loss reserves from both approaches. Additionally, a plot is created to visualize the comparison graphically. This plot displays the total loss reserves over the origin years for both the runoff triangle and the automated model. Each line represents the total loss reserves over time for each approach. <xref ref-type="fig" rid="fig14">
       Figure 14
      </xref> provides a visual representation of how the total loss reserves change over time for both approaches. By observing the trends in the lines, we can assess whether the AALRM’s predictions align closely with the historical runoff triangle results or if there are notable differences.</p>
     <p>In short, the comparison involves summarizing and visualizing the total loss reserves obtained from both the historical runoff triangle data and the predictions from the AALR model. This allows for an assessment of the effectiveness and accuracy of the AALRM in predicting loss reserves compared to the historical data.</p>
     <fig id="fig15" position="float">
      <label>Figure 15</label>
      <caption>
       <title>Figure 14. Comparison between traditional chain ladder method vs automated actuarial loss reserving model.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId228.jpeg?20241031120420" />
     </fig>
     <p>
      <xref ref-type="fig" rid="fig14">
       Figure 14
      </xref> shows the comparison between the runoff triangle and the AALRM which involves analyzing the trends and differences in the total loss reserves over time. With regards to Runoff Triangle, the line representing the runoff triangle shows the historical trend of total loss reserves over the origin years. It reflects actual incurred losses over time, capturing any patterns or fluctuations in the data. With regards to the Automated Actuarial Loss Reserving Model: The line representing the automated model depicts the predicted total loss reserves generated by the neural network model and it reflects the model’s estimation of expected loss reserves over the origin years based on the input features. In this case, the two lines exhibit similar patterns and movements over time, it suggests that the automated model captures the underlying dynamics of loss reserves effectively as compared to the traditional chain ladder model.</p>
    </sec>
    <sec id="s4_6">
     <title>5.6. Adherence to IFRS17</title>
     <p>To illustrate how the overall model predictions adhere to IFRS17 regulations, we can perform a validation exercise to ensure that the model’s predictions meet the criteria set forth by IFRS17 <xref ref-type="bibr" rid="scirp.137058-23">
       [23]
      </xref>.</p>
     <fig id="fig16" position="float">
      <label>Figure 16</label>
      <caption>
       <title>Figure 15. Predicted versus actual ultimate losses.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId229.jpeg?20241031120422" />
     </fig>
     <p>We developed an R code that generated the synthetic data for age, gender, driving experience, and claim amount and it then simulates ultimate losses and splits the data into training and testing sets. Next, it trains an overall model using a neural network to predict ultimate losses based on age, driving experience, and gender. Finally, it makes predictions on the test data and plots the predicted versus actual ultimate losses. To relate this to IFRS17 regulations, <xref ref-type="fig" rid="fig15">
       Figure 15
      </xref> shows that the plot exhibits a strong linear relationship between predicted and actual ultimate losses and hence strong linear relationship would indicate that the model’s predictions are accurate and reliable, which is essential for compliance with IFRS17 regulation.</p>
    </sec>
    <sec id="s4_7">
     <title>5.7. Robust Tests, Stress Tests and Scenario Testes</title>
     <p>In conducting robust tests, stress tests, and scenario tests is essential for evaluating the overall model’s performance, stability, and reliability in predicting actuarial loss reserves. These tests help in identifying potential weaknesses, assessing resilience against adverse conditions, and ensuring the model’s suitability for practical applications in insurance and risk management <xref ref-type="bibr" rid="scirp.137058-24">
       [24]
      </xref>.</p>
     <p>To perform a robust test using the Adversarial Testing method <xref ref-type="bibr" rid="scirp.137058-25">
       [25]
      </xref> on the overall model, we can perturb the input data and observe the model’s response to these changes. The goal is to determine if the model’s performance remains stable or degrades under such perturbations, thereby assessing its robustness <xref ref-type="bibr" rid="scirp.137058-26">
       [26]
      </xref>. In conducting the Adversarial Testing on the overall model and visualizing the results, we define a function perturb data to perturb the test data by multiplying the selected variables (age, driving experience, annual mileage) with a perturbation factor. Finally we create plots to visualize the relationship between the perturbation factor and the mean prediction, as well as the standard deviation of predictions and, we arrange and display the plots using package cowplot in R.</p>
     <p>The mean prediction plot presented by <xref ref-type="fig" rid="fig16">
       Figure 16
      </xref> shows how the model’s predictions change as we perturb the input data. Ideally, the mean prediction should remain stable across different perturbation factors, indicating robustness. From</p>
     <fig id="fig17" position="float">
      <label>Figure 17</label>
      <caption>
       <title>Figure 16. Robust test results using adversarial testing method.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId230.jpeg?20241031120426" />
     </fig>
     <p>there, the standard deviation plot indicates the variability or uncertainty in the model’s predictions. Lower standard deviation implies more robustness. By examining these plots, we can assess the robustness of the overall model under different perturbations. In this case the mean prediction remains stable and the standard deviation is relatively low and stable and this suggests that the model operates well even when the input data is perturbed, thus demonstrating robustness.</p>
     <p>Stress tests involve subjecting the model to extreme or adverse conditions to assess its performance under high-pressure situations. These tests help identify vulnerabilities and weaknesses in the model, allowing for improvements to enhance its resilience. Stress testing is widely used in risk management and financial modeling to evaluate the robustness of models and assess their ability to withstand adverse conditions <xref ref-type="bibr" rid="scirp.137058-27">
       [27]
      </xref>.</p>
     <p>To perform a stress test using the Sensitivity Analysis method on the overall model and demonstrate its robustness, the following steps have been developed. Start by determining the key input variables that have the most significant impact on the model’s output (i.e., estimated actuarial loss reserves). Systematically vary these input variables within plausible ranges to observe how changes affect the model’s output. Evaluate the sensitivity of the model’s output to changes in input variables and determine if the model remains robust across different scenarios and finally present the sensitivity analysis findings using visualizations such as fancy plots to illustrate the model’s behavior under varying input conditions <xref ref-type="bibr" rid="scirp.137058-28">
       [28]
      </xref>.</p>
     <p>We identified key input variables such as age, driving experience, and annual mileage, which are likely to have a significant impact on the model’s output (estimated actuarial loss reserves). We systematically varied these input variables within plausible ranges and observed how changes affected the model’s output. Sensitivity analysis results were visualized using a line plot presented by <xref ref-type="fig" rid="fig17">
       Figure 17
      </xref>, where each line represents the total loss under varying input conditions for a specific input variable. The straight line produced at constant total loss value shows that the model is robust under stress testing.</p>
     <p>Scenario tests simulate specific scenarios or hypothetical situations to evaluate the model’s performance and predictive capabilities in different contexts. These tests provide valuable insights into the model’s behavior under various scenarios, enabling stakeholders to make informed decisions. Scenario testing is commonly employed in risk analysis and decision-making to assess the impact of different scenarios on model outcomes and inform strategic planning <xref ref-type="bibr" rid="scirp.137058-29">
       [29]
      </xref>.</p>
     <p>A scenario test involves simulating specific scenarios or hypothetical situations to evaluate how well the overall model performs under different conditions. We first identify relevant scenarios or hypothetical situations that may impact actuarial loss reserves, such as changes in economic conditions, regulatory policies, or</p>
     <fig id="fig18" position="float">
      <label>Figure 18</label>
      <caption>
       <title>Figure 17. Stress test results under sensitivity analysis.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId231.jpeg?20241031120428" />
     </fig>
     <p>market trends. Create simulated data for each scenario, ensuring that the data reflect the specific conditions outlined in the scenarios. Use the overall model to predict actuarial loss reserves for each scenario. Compare the predicted losses across scenarios to assess how well the model performs under different conditions. Create visualizations and tables to present the results of the scenario test, highlighting any differences or trends in predicted losses under various scenarios. Interpret the findings of the scenario test, discussing how well the overall model operates under different conditions and its suitability for estimating actuarial loss reserves in real-world scenarios.</p>
     <p>In this code, we define two scenarios: Economic Boom and Economic Recession, and simulate data for each scenario by adjusting variables such as annual mileage and claim amounts. We then use the overall model to predict actuarial loss reserves for each scenario and compare the mean predicted losses across scenarios. The code generates a bar plot to visualize the mean predicted losses and creates a table to present the numerical comparison. Finally, we interpret the findings of the scenario test, discussing how well the overall model operates under different economic conditions. This code conducts a scenario test on the overall model and presents the results in visualizations and tables, allowing for an assessment of its performance under different economic conditions.</p>
     <p>
      <xref ref-type="fig" rid="fig18">
       Figure 18
      </xref> generated for the scenario test compares the mean predicted losses across two different scenarios: Economic Boom and Economic Recession. The plot displays two bars, one representing the mean predicted loss during an Economic Boom scenario and the other during an Economic Recession scenario. The x-axis denotes the scenarios, while the y-axis represents the mean predicted loss. Each bar’s height indicates the average predicted loss for the respective scenario.</p>
     <fig id="fig19" position="float">
      <label>Figure 19</label>
      <caption>
       <title>Figure 18. Scenario test results.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241865-rId232.jpeg?20241031120428" />
     </fig>
     <p>To demonstrate robustness, in this case, the two bars are of similar heights and, it suggests that the model’s predictions are robust across different economic conditions. Consistent mean predicted losses across scenarios indicate that the model can effectively adjust to changes in economic circumstances without significant deviations in its estimates. The similarity in predicted losses across scenarios demonstrates the model’s ability to adapt and provide reliable estimates under varying economic environments, thereby indicating its robustness.</p>
    </sec>
   </sec>
   <sec id="s5">
    <title>6. Discussion</title>
    <p>The Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model represents a significant advancement in insurance loss reserving practices. This study introduces an innovative approach that integrates artificial neural networks (ANNs) with actuarial data intelligence to improve the accuracy, efficiency, and relevance of loss reserve estimations in automobile insurance. Compared to the traditional chain ladder method, the ANN-based model offers several advantages. While the chain ladder method relies on historical loss development patterns and often assumes linear relationships between variables, the ANN model can capture complex nonlinear relationships and adapt to changing market conditions. As a result, the ANN model provides more accurate and reliable loss reserve estimations, particularly in scenarios with significant variability or uncertainty. The proposed ANN-based model demonstrates strong adherence to International Financial Reporting Standard 17 (IFRS17) regulations regarding insurance contract accounting. By incorporating inflation adjustment factors and producing loss reserve estimations that align with real-world financial reporting requirements, the model ensures compliance with IFRS17 guidelines. This ensures that insurers can confidently use the model’s output for financial reporting purposes while meeting regulatory standards. The ANN-based loss reserving model exhibits robust performance in various tests, including robust tests, scenario tests, and stress tests. Through rigorous evaluation and validation processes, the model demonstrates its stability, reliability, and accuracy under different conditions and scenarios. By subjecting the model to extreme scenarios and stress tests, researchers can verify its resilience and effectiveness in managing insurance risk.</p>
   </sec>
   <sec id="s6">
    <title>7. Conclusion</title>
    <p>In conclusion, the Actuarial Data Intelligent Based Artificial Neural Network (ANN) Automobile Insurance Inflation Adjusted Frequency Severity Loss Reserving Model represents a significant advancement in insurance loss reserving methodologies. By leveraging advanced technologies, such as artificial neural networks, and incorporating actuarial expertise and regulatory requirements, the model offers a comprehensive and effective solution for estimating loss reserves in automobile insurance. Through comparisons with traditional methods, adherence to regulatory standards, and rigorous testing procedures, the ANN-based model demonstrates superior performance, accuracy, and reliability. As such, the model holds promise for enhancing risk management practices, optimizing financial decision-making processes, and improving overall efficiency and effectiveness within the insurance industry.</p>
   </sec>
   <sec id="s7">
    <title>Funding</title>
    <p>The research was not supported by any funding.</p>
   </sec>
   <sec id="s8">
    <title>Data Availability</title>
    <p>The data was simulated in R and kept for ethical reasons.</p>
   </sec>
   <sec id="s9">
    <title>Acknowledgements</title>
    <p>Special thanks go to Dr. Charles Chimedza, Dr. Florance Matarise, Dr. Sheunesu Munyira and other members of staff at University of Zimbabwe through the department of Mathematics &amp; Computational sciences for both academic, social and moral support.</p>
   </sec>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.137058-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Brown, L.D. and Eastman, D.R. (1994) Artificial Neural Networks: Understanding, Use, and Application. Communications of the ACM, 37, 105-113.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gao, J.F., et al. (2012) Neural Network Models for Loss Reserving. Insurance: Mathematics and Economics, 51, 153-168.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Taylor, G., et al. (2002) Neural Networks in Insurance Pricing with a Real Example. Neural Computing&amp;Applications, 11, 42-50.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Borde, S.F., et al. (2015) Inflation Adjustment of Insurance Reserves: A Comparative Study of Methods. Insurance: Mathematics and Economics, 60, 97-108.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bühlmann, H. and Gisler, A. (2005) A Course in Credibility Theory and Its Applications. Springer Science&amp;Business Media.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Frees, E.W., et al. (2019) Predictive Modeling Applications in Actuarial Science: Volume 2, Case Studies in Insurance. Cambridge University Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kleynhans, E. and Grové, B. (2019) Predictive Modeling Applications in Actuarial Science: Volume 1, Predictive Modeling Techniques. Cambridge University Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Macdonald, A.S. and Vernon, M.C. (2012) Inflation and the Insurance Adjuster: A Review of Inflation-Adjustment Methods for General Insurance Reserves. Annals of Actuarial Science, 6, 255-285.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wüthrich, M.V. and Merz, M. (2008) Stochastic Claims Reserving Methods in Insurance. John Wiley&amp;Sons.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Haykin, S. (2009) Neural Networks and Learning Machines. 3rd Edition, Prentice Hall.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     LeCun, Y., Bengio, Y. and Hinton, G. (2015) Deep Learning. Nature, 521, 436-444. &gt;https://doi.org/10.1038/nature14539
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Goodfellow, I., Bengio, Y. and Courville, A. (2016) Deep Learning. MIT Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bishop, C.M. (1995) Neural Networks for Pattern Recognition. Oxford University Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yuan, H., Tan, J., Zhang, Y., Murthy, S., You, S., Li, H., et al. (2020) Machine Learning-Based PV Reserve Determination Strategy for Frequency Control on the WECC System. 2020 IEEE Power&amp;Energy Society Innovative Smart Grid Technologies Conference (ISGT), Washington DC, 17-20 February 2020, 1-5. &gt;https://doi.org/10.1109/isgt45199.2020.9087744
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Denuit, M. and Trufin, J. (2017) Beyond the Tweedie Reserving Model: The Collective Approach to Loss Development. North American Actuarial Journal, 21, 611-619. &gt;https://doi.org/10.1080/10920277.2017.1353428
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Xiong, L., Manathunga, V., Luo, J., Dennison, N., Zhang, R. and Xiang, Z. (2023) Autoreserve: A Web-Based Tool for Personal Auto Insurance Loss Reserving with Classical and Machine Learning Methods. Risks, 11, Article No. 131. &gt;https://doi.org/10.3390/risks11070131
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mack, T. (1993) Distribution-Free Calculation of the Standard Error of Chain Ladder Reserve Estimates. ASTIN Bulletin, 23, 213-225. &gt;https://doi.org/10.2143/ast.23.2.2005092
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhang, Y., Liu, T., Li, K. and Zhang, J. (2017) Improved Visual Correlation Analysis for Multidimensional Data. Journal of Visual Languages&amp;Computing, 41, 121-132. &gt;https://doi.org/10.1016/j.jvlc.2017.03.005
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Diffey, W., Hobern, L., Lauder, A., Cleugh, M., Wu, M., Mukherjee, S., et al. (2022) Your Reserves May Be Best Estimate, but Are They Valid? British Actuarial Journal, 27, e2. &gt;https://doi.org/10.1017/s1357321721000179
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pandey, M., Litoriya, R. and Pandey, P. (2020) Applicability of Machine Learning Methods on Mobile App Effort Estimation: Validation and Performance Evaluation. International Journal of Software Engineering and Knowledge Engineering, 30, 23-41. &gt;https://doi.org/10.1142/s0218194020500023
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gogtay, N.J. and Thatte, U.M. (2017) Principles of Correlation Analysis. Journal of the Association of Physicians of India, 65, 78-81.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Arce, M., Giner, B. and Taleb, M.A. (2023) Due Process as a Legitimating Mechanism: Participation and Responsiveness in the Development of IFRS 17: Insurance Contracts. Journal of Accounting and Public Policy, 42, Article ID: 107150. &gt;https://doi.org/10.1016/j.jaccpubpol.2023.107150
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Radtke, M., Schmidt, K.D. and Schnaus, A. (2016) Handbook on Loss Re-Serving. Springer.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref24">
    <label>24</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nalic, D., Li, H., Eichberger, A., Wellershaus, C., Pandurevic, A. and Rogic, B. (2020) Stress Testing Method for Scenario-Based Testing of Automated Driving Systems. IEEE Access, 8, 224974-224984. &gt;https://doi.org/10.1109/access.2020.3044024
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref25">
    <label>25</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gropp, R., Menkhoff, L. and Rauch, C. (2012) The Disposition Effect in Germany: An Analysis of 200,000 Trades. Journal of Banking&amp;Finance, 36, 622-633.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref26">
    <label>26</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Borch, K., Sandmo, A. and Sundt, B. (2010) The Danger of Using Scenarios for Risk Management. Journal of Banking&amp;Finance, 34, 458-460.
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref27">
    <label>27</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Feng, Y., Shi, Q., Gao, X., Wan, J., Fang, C. and Chen, Z. (2020) Deepgini: Prioritizing Massive Tests to Enhance the Robustness of Deep Neural Networks. Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis, 18-22 July 2020, 177-188. &gt;https://doi.org/10.1145/3395363.3397357
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref28">
    <label>28</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, J., Dong, G., Sun, J., Wang, X. and Zhang, P. (2019) Adversarial Sample Detection for Deep Neural Network through Model Mutation Testing. 2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE), Montreal, 25-31 May 2019, 1245-1256. &gt;https://doi.org/10.1109/icse.2019.00126
    </mixed-citation>
   </ref>
   <ref id="scirp.137058-ref29">
    <label>29</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Aormaih, Y.H. and Abdul Halim, S.Q. (2021) The Quality of Actuarial Accounting Information under Adopting IFRS17 “Insurance Contracts”. Review of International Geographical Education Online, 11, 3935-3950.
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>