<?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">
    jhepgc
   </journal-id>
   <journal-title-group>
    <journal-title>
     Journal of High Energy Physics, Gravitation and Cosmology
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2380-4327
   </issn>
   <issn publication-format="print">
    2380-4335
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/jhepgc.2025.113051
   </article-id>
   <article-id pub-id-type="publisher-id">
    jhepgc-143858
   </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>
    Optimizing the Matrix Element Method with Deep Neural Networks for High-Energy Physics Analyses
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Olokunboyo A.
      </surname>
      <given-names>
       Olaiya
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aDepartment of Physics and Astronomy, University of New Hampshire, Durham, USA
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     20
    </day> 
    <month>
     05
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    11
   </volume> 
   <issue>
    03
   </issue>
   <fpage>
    802
   </fpage>
   <lpage>
    814
   </lpage>
   <history>
    <date date-type="received">
     <day>
      28,
     </day>
     <month>
      March
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      4,
     </day>
     <month>
      March
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      4,
     </day>
     <month>
      July
     </month>
     <year>
      2025
     </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>
    The Matrix Element Method (MEM) is a widely used algorithm in experimental and theoretical high-energy physics (HEP) analyses. The MEM is based on the Lagrangian method to assess the compatibility of experimental events with a hypothetical process. The matrix element is then regressed with the help of a Deep Neural Network (DNN). The integration results can be approximated with DNN, which makes it possible to use the MEM for parameter scans, innovative physics searches, and other uses. The DNN can be trained to nearly mimic the outcomes of the direct numerical integration of the matrix element. It is possible to identify the specific ways in which the parton shower impacts the analysis by using the method to analyze these occurrences using fixed-order calculations. The method can, in theory, be applied to any measurement; however, processes involving intermediate resonances and leading to many-particle final states are anticipated to yield the highest improvement compared to cut-based analysis techniques. This research provides insights to understand the importance of optimizing machine learning strategies and fine-tuning regressions while also exploring the use of symmetry in particle physics with an interest in particle interactions and decays.
   </abstract>
   <kwd-group> 
    <kwd>
     Deep Neural Network
    </kwd> 
    <kwd>
      Matrix Element Method
    </kwd> 
    <kwd>
      Regressions
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>Development in experimental and theoretical high-energy physics (HEP) analyses now employ the instrumentation of modern machine learning methods, involving deep learning, which are rapidly gaining applicability. Machine learning, a widely used automated inference procedure in HEP, is often associated with multivariate techniques like Boosted Decision Trees (BDT) <xref ref-type="bibr" rid="scirp.143858-1">
     [1]
    </xref>. In recent years, the set of methods and tools commonly employed in HEP has expanded significantly due to the deep learning revolution. To fully leverage the information contained in a given event, such as those generated by the Large Hadron Collider (LHC), statistical analysis necessitates enhancements in machine learning analysis techniques <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>. Neural networks and BDT are used in HEP to learn from simulations or data. Nonetheless, difficulties encompass the acquisition and generalization of physical data, employing control samples or regularization strategies, and curtailing reverse engineering possibilities because of indirect training data <xref ref-type="bibr" rid="scirp.143858-3">
     [3]
    </xref> <xref ref-type="bibr" rid="scirp.143858-4">
     [4]
    </xref>.</p>
   <p>
    <xref ref-type="bibr" rid="scirp.143858-"></xref>In contrast, the Matrix Element Method (MEM) regression leverages our understanding of the Standard Model (SM) through Lagrangian to assess the compatibility of experimental events with a hypothetical process <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>. The inherent understanding of the physics process and detector response renders the internal dynamics of MEM more straightforward to interpret compared to machine learning techniques. Moreover, because there is no training step involved, MEM can be effectively utilized even when the dataset contains very few events, a scenario in which other methods encounter difficulties. The MEM, derived from Tevatron experiments, is widely used in particle physics analyses. It’s used at the LHC for searches and measurements of processes like top quark and anti-quark pair production and Higgs boson decay ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mover accent="true"> 
       <mi>
         t 
       </mi> 
       <mo>
         ¯ 
       </mo> 
      </mover> 
      <mi>
        H 
      </mi> 
     </mrow> 
    </math>) and spin correlation. However, its complexity and computational demands make it more CPU-intensive than other methods <xref ref-type="bibr" rid="scirp.143858-5">
     [5]
    </xref>. The result of matrix element integration can be approximated with a Deep Neural Network (DNN), which makes it possible to use the MEM for parameter scans, innovative physics searches, and other uses. In the absence of a closed or computationally feasible form, the probabilities given by MoMEMta can be understood as indistinguishable functions of the 4-momentum. Given appropriate assumptions and a sufficiently large width divided across several layers, a neural network can approximate any function. While there’s no guarantee that the MEM’s output conforms to all of these presumptions, it sufficiently motivated this study. In comparison to matrix element evaluation based on direct integration, this method could produce much quicker results. DNNs often take significantly less computation time than classical MEM integrations, requiring a simulated sample and several hours of training. Advancements in the MEM field, such as GPU acceleration, parallel computing, BDT, neural networks, and normalizing flows, can reduce computation times and avoid integration variable optimizations <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>.</p>
   <p>In this study, I would like to understand the details of the computational/probabilistic distribution required for MEM, its fitting with DNN, topology using the Drell-Yan weights model, and application to real-life analysis for certain physical processes based on experimental data <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>.</p>
  </sec><sec id="s2">
   <title>2. Methodology</title>
   <p>1) Regression is a machine learning approach that is used to predict the continuous outcomes of interaction and decays based on the input variables. DNNs are simply types of neural networks having many layers between the output and input layers, which permits learning of difficult patterns in the data <xref ref-type="bibr" rid="scirp.143858-5">
     [5]
    </xref> <xref ref-type="bibr" rid="scirp.143858-6">
     [6]
    </xref>. To train the neural network, input features—such as particle momenta, energies, and other pertinent variables—derived from experimental data are fed into the system. By using theoretical calculations or Monte Carlo simulations to acquire the true distribution, the network is trained to minimize the difference between its predicted probability distribution and the true distribution. To improve its predictions, the network iteratively modifies its internal parameters (weights and biases) through techniques like gradient descent and backpropagation <xref ref-type="bibr" rid="scirp.143858-7">
     [7]
    </xref>. From first-principles computations for high-energy processes in a power series expansion order by order, we can simplify the expansion as in:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        F 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mstyle mathvariant="bold" mathsize="normal"> 
        <mi>
          x 
        </mi> 
       </mstyle> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mn>
          00 
        </mn> 
       </mrow> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mstyle mathvariant="bold" mathsize="normal"> 
        <mi>
          x 
        </mi> 
       </mstyle> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mi>
        α 
      </mi> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mn>
          01 
        </mn> 
       </mrow> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mstyle mathvariant="bold" mathsize="normal"> 
        <mi>
          x 
        </mi> 
       </mstyle> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msup> 
       <mi>
         α 
       </mi> 
       <mn>
         2 
       </mn> 
      </msup> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            x 
          </mi> 
         </mstyle> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mrow> 
          <mn>
            02 
          </mn> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            x 
          </mi> 
         </mstyle> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
     </mrow> 
    </math>(1)</p>
   <p>in which case 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        α 
      </mi> 
      <mo>
        ≪ 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math> is a small expansion parameter. Where the functions 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> are related to the real part of a complex number, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        ℝ 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            M 
          </mi> 
         </mstyle> 
         <mi>
           i 
         </mi> 
        </msub> 
        <msup> 
         <mrow></mrow> 
         <mo>
           ⋆ 
         </mo> 
        </msup> 
        <msub> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            M 
          </mi> 
         </mstyle> 
         <mi>
           j 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        + 
      </mo> 
      <mi>
        j 
      </mi> 
     </mrow> 
    </math> gives the power of the expansion coefficient, that is a generic term such that 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         α 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mo>
          + 
        </mo> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msup> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mstyle mathvariant="bold" mathsize="normal"> 
        <mi>
          M 
        </mi> 
       </mstyle> 
       <mi>
         i 
       </mi> 
      </msub> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        ℂ 
      </mi> 
     </mrow> 
    </math> with 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mn>
          0 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is called the matrix element). The number of closed loops contributing to the Feynman graph is represented by the subscript, which is the total for a particular scattering process used in computing the matrix element. Here, the second-order terms (the order is given by the power of the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       α 
     </mi> 
    </math>) 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            x 
          </mi> 
         </mstyle> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mrow> 
          <mn>
            02 
          </mn> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            x 
          </mi> 
         </mstyle> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is the term of interest, where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mn>
          02 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> is computationally space- and time-expensive than 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mn>
          11 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>. This difference results from the Feynman graphs, where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mn>
          02 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> has two loops and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mn>
          11 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> has one loop. To expedite the computation of the functions, constructing a regressor with a representative sample is an easy fix. Speeding up Monte Carlo simulations is highly relevant not only in particle physics but in a very large set of problems addressed by all branches of physics using perturbative expansion like the one in Equation (1) <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref>. However, the regressors must generate very highly accurate predictions over the whole function domain in order to reach the precision required for matching with experimental data. The specifications for the regressors, specifically pertaining to the definition of high precision, are as follows:</p>
   <p>1) High precision: prediction error &lt; 1% over more than 90% of the domain of the function.</p>
   <p>2) Speed: prediction time per data point of &lt;10<sup>−</sup><sup>4</sup> seconds.</p>
   <p>3) Lightweight: the disk size of the regressors should be a few megabytes at the most for portability.</p>
   <p>Compared to the Monte Carlo statistical error, for instance, the prediction error—whose exact definition is provided in Equation (2)—guarantees that propagating the approximation mistake on 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mn>
          02 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> to the entire function 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       F 
     </mi> 
    </math> stays a sub-leading source of error.</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        δ 
      </mi> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <mi>
          f 
        </mi> 
        <msub> 
         <mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mstyle mathvariant="bold" mathsize="normal"> 
            <mi>
              x 
            </mi> 
           </mstyle> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            d 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            d 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <mi>
          f 
        </mi> 
        <msub> 
         <mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mstyle mathvariant="bold" mathsize="normal"> 
            <mi>
              x 
            </mi> 
           </mstyle> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
       <mrow> 
        <mi>
          f 
        </mi> 
        <msub> 
         <mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mstyle mathvariant="bold" mathsize="normal"> 
            <mi>
              x 
            </mi> 
           </mstyle> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </mfrac> 
     </mrow> 
    </math>(2)</p>
   <p>where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       δ 
     </mi> 
    </math> gives the difference between the predicted value of the function 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        f 
      </mi> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            x 
          </mi> 
         </mstyle> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mi>
          p 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          d 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          d 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>, and its true value 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        f 
      </mi> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            x 
          </mi> 
         </mstyle> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mi>
          t 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>, normalized by 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        f 
      </mi> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mstyle mathvariant="bold" mathsize="normal"> 
          <mi>
            x 
          </mi> 
         </mstyle> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mi>
          t 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref>.</p>
   <p>The terms that emerge in the generation of four charged leptons in proton-proton collisions, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        p 
      </mi> 
      <mi>
        p 
      </mi> 
      <mo>
        → 
      </mo> 
      <msubsup> 
       <mi>
         l 
       </mi> 
       <mn>
         1 
       </mn> 
       <mo>
         + 
       </mo> 
      </msubsup> 
      <msubsup> 
       <mi>
         l 
       </mi> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
      </msubsup> 
      <msubsup> 
       <mi>
         l 
       </mi> 
       <mn>
         2 
       </mn> 
       <mo>
         + 
       </mo> 
      </msubsup> 
      <msubsup> 
       <mi>
         l 
       </mi> 
       <mn>
         2 
       </mn> 
       <mo>
         − 
       </mo> 
      </msubsup> 
     </mrow> 
    </math>, where each lepton pair is mediated by an electrically neutral electroweak gauge boson, such as a 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       Z 
     </mi> 
    </math> boson or a photon ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       γ 
     </mi> 
    </math>), are represented by the functions 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> in Equation (1). This process’s leading-order function ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mn>
          00 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>) equals the square of the scattering amplitude at the tree level. Higher terms have graphs with internal legs that form a closed loop, whereas graphs without such legs are connected with a tree-level amplitude. For instance, adding the second-order term results in a time penalty of 1500 times greater accuracy in predicting the rate of creation of four electrons <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref>-<xref ref-type="bibr" rid="scirp.143858-10">
     [10]
    </xref>.</p>
   <p>2) Let’s talk about asymmetry. The functions in question are maps 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           n 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </msubsup> 
      <mo>
        ≡ 
      </mo> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        : 
      </mo> 
      <msup> 
       <mi>
         ℝ 
       </mi> 
       <mi>
         n 
       </mi> 
      </msup> 
      <mo>
        → 
      </mo> 
      <mi>
        ℝ 
      </mi> 
     </mrow> 
    </math>, where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          4 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          8 
        </mn> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        j 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mn>
          0 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math>. The feature space, or domain of the functions, is filled in from a uniform distribution and linearly transferred to the unit hypercube <xref ref-type="bibr" rid="scirp.143858-10">
     [10]
    </xref>. For instance, the physical phase-space coordinates in the 4-dimension are: the process total energy 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msqrt> 
       <mrow> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mrow> 
          <mn>
            12 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
      </msqrt> 
     </mrow> 
    </math>, having a di-boson system scattering angle of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         θ 
       </mi> 
       <mo>
         ⋆ 
       </mo> 
      </msup> 
     </mrow> 
    </math>, with masses of the two bosons, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mn>
          34 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mn>
          56 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>. Since the bosons are believed to be off their mass shell, these masses are not fixed in general <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref> <xref ref-type="bibr" rid="scirp.143858-9">
     [9]
    </xref>. The 8-dimension case gives additional angles with leptons in the final state, and the 2-dimension case gives fixed masses. As a result, various physics analyses will call for various regressors. The 4D regressors, on the other hand, are more versatile and do not have any fixed physical parameters <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref>. The smaller number of necessary functions in the third column of <xref ref-type="table" rid="table1">
     Table 1
    </xref> is obtained by leveraging the symmetry properties discussed below derived from physics domain knowledge. For the data used in Ref. <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref>, it stems from the symmetries manifesting in the scattering process that was simulated. In <xref ref-type="table" rid="table2">
     Table 2
    </xref>, the last column indicates whether summing the functions has a physics meaning; in the cases where it does, i.e. 2D and 8D, only the single regressor of the sum of the functions is required. The complete functions, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           n 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math>, for any dimension 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       n 
     </mi> 
    </math>, is full. Certain combinations of the external particles that the method specifies allow pairs of functions to be mapped into each other. Thus, in feature space, the second coordinate, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math>, is subject to a linear transformation both separately and in conjunction with the permutation of the third and fourth coordinates, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mn>
         3 
       </mn> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mn>
         4 
       </mn> 
      </msub> 
     </mrow> 
    </math>. For instance, in 4D, the number of independent functions is reduced from 162 to 25 by two permutations, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         π 
       </mi> 
       <mrow> 
        <mn>
          12 
        </mn> 
       </mrow> 
      </msub> 
      <mo>
        : 
      </mo> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        ↔ 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         π 
       </mi> 
       <mrow> 
        <mn>
          34 
        </mn> 
       </mrow> 
      </msub> 
      <mo>
        : 
      </mo> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         3 
       </mn> 
      </msub> 
      <mo>
        ↔ 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         4 
       </mn> 
      </msub> 
     </mrow> 
    </math> as seen in <xref ref-type="table" rid="table3">
     Table 3
    </xref>. Here, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
     </mrow> 
    </math> represents a particle with label 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       i 
     </mi> 
    </math>.</p>
   <table-wrap id="table1">
    <label>
     <xref ref-type="table" rid="table1">
      Table 1
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.143858-"></xref>Table 1. The dimension determines how many of the resulting functions-technically known as helicity amplitudes-there are <xref ref-type="bibr" rid="scirp.143858-8">
       [8]
      </xref>.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="31.50%"><p style="text-align:center">Variable</p></td> 
      <td class="custom-bottom-td acenter" width="35.17%"><p style="text-align:center">2D</p></td> 
      <td class="custom-bottom-td acenter" width="33.33%"><p style="text-align:center">4D and 8D</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="31.50%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msqrt> 
           <mrow> 
            <msub> 
             <mi>
               s 
             </mi> 
             <mrow> 
              <mn>
                12 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </msqrt> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td acenter" width="35.17%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mrow> 
           <mo>
             [ 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               m 
             </mi> 
             <mrow> 
              <mn>
                34 
              </mn> 
             </mrow> 
            </msub> 
            <mo>
              + 
            </mo> 
            <msub> 
             <mi>
               m 
             </mi> 
             <mrow> 
              <mn>
                56 
              </mn> 
             </mrow> 
            </msub> 
            <mo>
              , 
            </mo> 
            <mn>
              1 
            </mn> 
            <mtext>
                
            </mtext> 
            <mtext>
              TeV 
            </mtext> 
           </mrow> 
           <mo>
             ] 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td acenter" width="33.33%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mrow> 
           <mo>
             [ 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               m 
             </mi> 
             <mrow> 
              <mn>
                34 
              </mn> 
             </mrow> 
            </msub> 
            <mo>
              + 
            </mo> 
            <msub> 
             <mi>
               m 
             </mi> 
             <mrow> 
              <mn>
                56 
              </mn> 
             </mrow> 
            </msub> 
            <mo>
              , 
            </mo> 
            <mn>
              3 
            </mn> 
            <mtext>
                
            </mtext> 
            <mtext>
              TeV 
            </mtext> 
           </mrow> 
           <mo>
             ] 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="31.50%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            cos 
          </mi> 
          <msup> 
           <mi>
             θ 
           </mi> 
           <mo>
             ⋆ 
           </mo> 
          </msup> 
         </mrow> 
        </math></p></td> 
      <td class="acenter" width="35.17%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mrow> 
           <mo>
             [ 
           </mo> 
           <mrow> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
            <mo>
              , 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mo>
             ] 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
      <td class="acenter" width="33.33%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mrow> 
           <mo>
             [ 
           </mo> 
           <mrow> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
            <mo>
              , 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mo>
             ] 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="31.50%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             m 
           </mi> 
           <mrow> 
            <mn>
              34 
            </mn> 
           </mrow> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             m 
           </mi> 
           <mrow> 
            <mn>
              56 
            </mn> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="acenter" width="35.17%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             m 
           </mi> 
           <mi>
             Z 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            91.1876 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            GeV 
          </mtext> 
         </mrow> 
        </math></p></td> 
      <td class="acenter" width="33.33%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mrow> 
           <mo>
             [ 
           </mo> 
           <mrow> 
            <mn>
              50 
            </mn> 
            <mo>
              , 
            </mo> 
            <mn>
              130 
            </mn> 
           </mrow> 
           <mo>
             ] 
           </mo> 
          </mrow> 
          <mtext>
              
          </mtext> 
          <mtext>
            GeV 
          </mtext> 
         </mrow> 
        </math></p></td> 
     </tr> 
    </table>
   </table-wrap>
   <table-wrap id="table2">
    <label>
     <xref ref-type="table" rid="table2">
      Table 2
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.143858-"></xref>Table 2. Symmetry characteristics minimize the quantity of necessary functions <xref ref-type="bibr" rid="scirp.143858-8">
       [8]
      </xref>.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="23.72%"><p style="text-align:center">Dimensionality</p></td> 
      <td class="custom-bottom-td acenter" width="23.75%"><p style="text-align:center">Total functions</p></td> 
      <td class="custom-bottom-td acenter" width="30.23%"><p style="text-align:center">Independent functions</p></td> 
      <td class="custom-bottom-td acenter" width="22.31%"><p style="text-align:center">Sum is physical?</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="23.72%"><p style="text-align:center">2D</p></td> 
      <td class="custom-top-td acenter" width="23.75%"><p style="text-align:center">18</p></td> 
      <td class="custom-top-td acenter" width="30.23%"><p style="text-align:center">5</p></td> 
      <td class="custom-top-td acenter" width="22.31%"><p style="text-align:center">Yes</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="23.72%"><p style="text-align:center">4D</p></td> 
      <td class="acenter" width="23.75%"><p style="text-align:center">162</p></td> 
      <td class="acenter" width="30.23%"><p style="text-align:center">25</p></td> 
      <td class="acenter" width="22.31%"><p style="text-align:center">No</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="23.72%"><p style="text-align:center">8D</p></td> 
      <td class="acenter" width="23.75%"><p style="text-align:center">8</p></td> 
      <td class="acenter" width="30.23%"><p style="text-align:center">4</p></td> 
      <td class="acenter" width="22.31%"><p style="text-align:center">Yes</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <table-wrap id="table3">
    <label>
     <xref ref-type="table" rid="table3">
      Table 3
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.143858-"></xref>Table 3. Symmetry representation <xref ref-type="bibr" rid="scirp.143858-8">
       [8]
      </xref>.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="27.46%"><p style="text-align:center">Permutation</p></td> 
      <td class="custom-bottom-td acenter" width="32.14%"><p style="text-align:center">Particle Symmetry</p></td> 
      <td class="custom-bottom-td acenter" width="40.40%"><p style="text-align:center">Coordinate Symmetry</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="27.46%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             π 
           </mi> 
           <mrow> 
            <mn>
              12 
            </mn> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td acenter" width="32.14%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            ↔ 
          </mo> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td acenter" width="40.40%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            → 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
        </math></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="27.46%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             π 
           </mi> 
           <mrow> 
            <mn>
              34 
            </mn> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="acenter" width="32.14%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             3 
           </mn> 
          </msub> 
          <mo>
            ↔ 
          </mo> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             4 
           </mn> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="acenter" width="40.40%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            → 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
        </math> and 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             3 
           </mn> 
          </msub> 
          <mo>
            ↔ 
          </mo> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             4 
           </mn> 
          </msub> 
         </mrow> 
        </math></p></td> 
     </tr> 
    </table>
   </table-wrap>
   <p>3) Describing the matrix method. The methodology can, in theory, be applied to any measurement; however, processes involving intermediate resonances and leading to many-particle final states are anticipated to yield the highest improvement in comparison to cut-based analysis techniques. Generally speaking, the MEM allows for the simultaneous determination of multiple unknown parameters (both experimental and theoretical parameters characterizing the detector response and the physics processes being measured) in a single measurement, thereby reducing systematic uncertainties <xref ref-type="bibr" rid="scirp.143858-11">
     [11]
    </xref>. The possibility that 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          s 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> will see a sample of chosen events in the detector is the foundation of the Matrix Element technique. The likelihood is computed as a function of the assumed values for each of the parameters to be monitored and is derived directly from the theoretical prediction for the detector resolution and the differential cross-sections of the relevant processes. The measurement of the parameters is obtained by minimising 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        − 
      </mo> 
      <mi>
        ln 
      </mi> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          s 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>, where the likelihood 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          s 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> for the total event sample is calculated by multiplying the likelihoods of observing each individual event <xref ref-type="bibr" rid="scirp.143858-11">
     [11]
    </xref> <xref ref-type="bibr" rid="scirp.143858-12">
     [12]
    </xref>. The majority of analysis techniques in experimental particle physics, in contrast, compare distributions from observed events in the detector with corresponding distributions from simulated events generated theoretically, passed through a detector simulation, and then reconstructed using the same event reconstruction software <xref ref-type="bibr" rid="scirp.143858-13">
     [13]
    </xref>. The sample likelihood 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          s 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> for 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       N 
     </mi> 
    </math> measured events to have measured properties 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        , 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mi>
         N 
       </mi> 
      </msub> 
     </mrow> 
    </math> can be written as:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          s 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mi>
           N 
         </mi> 
        </msub> 
        <mo>
          ; 
        </mo> 
        <mover accent="true"> 
         <mi>
           α 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           β 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           f 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
       </mrow> 
       <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> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          e 
        </mi> 
        <mi>
          v 
        </mi> 
        <mi>
          t 
        </mi> 
       </mrow> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          ; 
        </mo> 
        <mover accent="true"> 
         <mi>
           α 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           β 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           f 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(3)</p>
   <p>where the symbol 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
      <mi>
        α 
      </mi> 
      <mo>
        → 
      </mo> 
     </mover> 
    </math> denotes assumed values of the physics parameters to be measured, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
      <mi>
        β 
      </mi> 
      <mo>
        → 
      </mo> 
     </mover> 
    </math> stands for parameters describing the detector response that are to be determined, and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
      <mi>
        f 
      </mi> 
      <mo>
        → 
      </mo> 
     </mover> 
    </math> is defined below. The likelihood 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          e 
        </mi> 
        <mi>
          v 
        </mi> 
        <mi>
          t 
        </mi> 
       </mrow> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          ; 
        </mo> 
        <mover accent="true"> 
         <mi>
           α 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           β 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           f 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> to observe event 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
     </mrow> 
    </math> under the assumption of parameter values 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mover accent="true"> 
       <mi>
         α 
       </mi> 
       <mo>
         → 
       </mo> 
      </mover> 
      <mo>
        , 
      </mo> 
      <mover accent="true"> 
       <mi>
         β 
       </mi> 
       <mo>
         → 
       </mo> 
      </mover> 
     </mrow> 
    </math> and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
      <mi>
        f 
      </mi> 
      <mo>
        → 
      </mo> 
     </mover> 
    </math> is given as the linear combination:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"> <mrow> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          e 
        </mi> 
        <mi>
          v 
        </mi> 
        <mi>
          t 
        </mi> 
       </mrow> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          ; 
        </mo> 
        <mover accent="true"> 
         <mi>
           α 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           β 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           f 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <munder> 
       <mstyle displaystyle="true" mathsize="140%"> 
        <mo>
          ∑ 
        </mo> 
       </mstyle> 
       <mrow> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          s 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          P 
        </mi> 
       </mrow> 
      </munder> 
      <mtext>
          
      </mtext> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         P 
       </mi> 
      </msub> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mi>
         P 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          ; 
        </mo> 
        <mover accent="true"> 
         <mi>
           α 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           β 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(4)</p>
   <p>where the sum is over all individual processes 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       P 
     </mi> 
    </math> that could have led to the observed event 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mi>
         P 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          ; 
        </mo> 
        <mover accent="true"> 
         <mi>
           α 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
        <mo>
          , 
        </mo> 
        <mover accent="true"> 
         <mi>
           β 
         </mi> 
         <mo>
           → 
         </mo> 
        </mover> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is the likelihood to observe this event under the assumption that it was produced via process 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       P 
     </mi> 
    </math>, and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         P 
       </mi> 
      </msub> 
     </mrow> 
    </math> denotes the fraction of events from process 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       P 
     </mi> 
    </math> in the entire event sample, with 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mi>
          P 
        </mi> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           P 
         </mi> 
        </msub> 
       </mrow> 
      </mstyle> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. In total, the physics parameters 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
      <mi>
        α 
      </mi> 
      <mo>
        → 
      </mo> 
     </mover> 
    </math>, the detector response described by 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
      <mi>
        β 
      </mi> 
      <mo>
        → 
      </mo> 
     </mover> 
    </math>, and the event fractions 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
      <mi>
        f 
      </mi> 
      <mo>
        → 
      </mo> 
     </mover> 
    </math> are to be determined simultaneously from the minimization of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        − 
      </mo> 
      <mi>
        ln 
      </mi> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mi>
          s 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> <xref ref-type="bibr" rid="scirp.143858-12">
     [12]
    </xref>.</p>
   <p>The MEM is used to calculate 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          x 
        </mi> 
        <mo>
          | 
        </mo> 
        <mi>
          α 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, which is the likelihood of observing an experimental event in light of theoretical hypothesis 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       α 
     </mi> 
    </math>. Here, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       x 
     </mi> 
    </math> stands for the 4-momenta of any number of particles that have been detected in their final condition. The aim is to differentiate the parton level particles 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       y 
     </mi> 
    </math> generated at the contact point prior to hadronization and their detection from the experimentally observed particles 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       x 
     </mi> 
    </math>. 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       α 
     </mi> 
    </math> can be used to denote various models or any set of parameters (such as the mass of a resonance) <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>. The probability that a hard scattering will result in a partonic final state 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       y 
     </mi> 
    </math> for hadron colliders is proportional to the differential cross section, which is calculated as</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mtext>
        d 
      </mtext> 
      <mi>
        σ 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mi>
          y 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <msup> 
         <mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mn>
              2 
            </mn> 
            <mi>
              π 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mn>
           4 
         </mn> 
        </msup> 
        <msup> 
         <mrow> 
          <mrow> 
           <mo>
             | 
           </mo> 
           <mrow> 
            <mi mathvariant="double-struck">
              M 
            </mi> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 q 
               </mi> 
               <mn>
                 1 
               </mn> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 q 
               </mi> 
               <mn>
                 2 
               </mn> 
              </msub> 
              <mo>
                , 
              </mo> 
              <mi>
                y 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             | 
           </mo> 
          </mrow> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msup> 
       </mrow> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mi>
          s 
        </mi> 
       </mrow> 
      </mfrac> 
      <mtext>
        d 
      </mtext> 
      <mi>
        Φ 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         y 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(5)</p>
   <p>where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         q 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         q 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> are the initial state parton momentum fractions and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       s 
     </mi> 
    </math> is the center-of-mass energy. 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mtext>
        d 
      </mtext> 
      <mi>
        Φ 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         y 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is the n-body phase space of the final state 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       y 
     </mi> 
    </math>, while 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <mi mathvariant="double-struck">
            M 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               q 
             </mi> 
             <mn>
               1 
             </mn> 
            </msub> 
            <mo>
              , 
            </mo> 
            <msub> 
             <mi>
               q 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
            <mo>
              , 
            </mo> 
            <mi>
              y 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           | 
         </mo> 
        </mrow> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math> denotes the matrix element for the given process 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       α 
     </mi> 
    </math>.</p>
   <p>The parton distribution functions (PDF) 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         a 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         q 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (for each parton 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       q 
     </mi> 
    </math> of flavor 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       a 
     </mi> 
    </math>), efficiency 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        ϵ 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         y 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> to reconstruct and select the hadronic state 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       y 
     </mi> 
    </math>, and transfer function 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        T 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          x 
        </mi> 
        <mo>
          | 
        </mo> 
        <mi>
          y 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> normalized with respect to 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       x 
     </mi> 
    </math> are all involved in the transmission of the parton-level 4-momenta 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       y 
     </mi> 
    </math> to the experimentally observed ones 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       x 
     </mi> 
    </math>. The latter parameterizes the hadronization, the parton shower, and the detector response (which results in a blurring of the momenta of the detected particles due to its limited resolution) <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref> <xref ref-type="bibr" rid="scirp.143858-13">
     [13]
    </xref>. A convolution of the differential cross section with the transfer function and a total over the initial states yields the probability 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          x 
        </mi> 
        <mo>
          | 
        </mo> 
        <mi>
          α 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            x 
          </mi> 
          <mo>
            | 
          </mo> 
          <mi>
            α 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mn>
           1 
         </mn> 
         <mrow> 
          <msubsup> 
           <mi>
             σ 
           </mi> 
           <mi>
             α 
           </mi> 
           <mrow> 
            <mi>
              o 
            </mi> 
            <mi>
              b 
            </mi> 
            <mi>
              s 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
        </mfrac> 
        <mstyle displaystyle="true"> 
         <mrow> 
          <msub> 
           <mo>
             ∫ 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               q 
             </mi> 
             <mn>
               1 
             </mn> 
            </msub> 
            <mo>
              , 
            </mo> 
            <msub> 
             <mi>
               q 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
           </mrow> 
          </msub> 
          <mrow> 
           <mstyle displaystyle="true"> 
            <munder> 
             <mo>
               ∑ 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 α 
               </mi> 
               <mn>
                 1 
               </mn> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 α 
               </mi> 
               <mn>
                 2 
               </mn> 
              </msub> 
             </mrow> 
            </munder> 
            <mrow> 
             <mstyle displaystyle="true"> 
              <mrow> 
               <msub> 
                <mo>
                  ∫ 
                </mo> 
                <mi>
                  y 
                </mi> 
               </msub> 
               <mrow> 
                <mtext>
                  d 
                </mtext> 
                <msub> 
                 <mi>
                   q 
                 </mi> 
                 <mn>
                   1 
                 </mn> 
                </msub> 
                <mtext>
                  d 
                </mtext> 
                <msub> 
                 <mi>
                   q 
                 </mi> 
                 <mn>
                   2 
                 </mn> 
                </msub> 
               </mrow> 
              </mrow> 
             </mstyle> 
            </mrow> 
           </mstyle> 
          </mrow> 
         </mrow> 
        </mstyle> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mrow> 
          <msub> 
           <mi>
             α 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mo>
          × 
        </mo> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mrow> 
          <msub> 
           <mi>
             α 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mfrac> 
         <mrow> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mn>
                2 
              </mn> 
              <mi>
                π 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mn>
             4 
           </mn> 
          </msup> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               | 
             </mo> 
             <mrow> 
              <mi mathvariant="double-struck">
                M 
              </mi> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mrow> 
                <msub> 
                 <mi>
                   q 
                 </mi> 
                 <mn>
                   1 
                 </mn> 
                </msub> 
                <mo>
                  , 
                </mo> 
                <msub> 
                 <mi>
                   q 
                 </mi> 
                 <mn>
                   2 
                 </mn> 
                </msub> 
                <mo>
                  , 
                </mo> 
                <mi>
                  y 
                </mi> 
               </mrow> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
             </mrow> 
             <mo>
               | 
             </mo> 
            </mrow> 
           </mrow> 
           <mn>
             2 
           </mn> 
          </msup> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mi>
            s 
          </mi> 
         </mrow> 
        </mfrac> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            x 
          </mi> 
          <mo>
            | 
          </mo> 
          <mi>
            y 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mi>
          ϵ 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           y 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math>(6)</p>
   <p>where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         σ 
       </mi> 
       <mi>
         α 
       </mi> 
       <mrow> 
        <mi>
          o 
        </mi> 
        <mi>
          b 
        </mi> 
        <mi>
          s 
        </mi> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math> stands for the visible/observed cross-section and ensures that the probability is normalized. It is often computed a posteriori with 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         σ 
       </mi> 
       <mi>
         α 
       </mi> 
       <mrow> 
        <mi>
          o 
        </mi> 
        <mi>
          b 
        </mi> 
        <mi>
          s 
        </mi> 
       </mrow> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         σ 
       </mi> 
       <mi>
         α 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mi>
         ϵ 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         σ 
       </mi> 
       <mi>
         α 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <mrow> 
        <mo>
          ∫ 
        </mo> 
        <mrow> 
         <mtext>
           d 
         </mtext> 
         <msub> 
          <mi>
            σ 
          </mi> 
          <mi>
            α 
          </mi> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            y 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math> is the total cross-section and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mi>
         ϵ 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is the expectation of the selection efficiency. Define the MEM weights as 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        W 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          x 
        </mi> 
        <mo>
          | 
        </mo> 
        <mi>
          α 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msubsup> 
       <mi>
         σ 
       </mi> 
       <mi>
         α 
       </mi> 
       <mrow> 
        <mi>
          o 
        </mi> 
        <mi>
          b 
        </mi> 
        <mi>
          s 
        </mi> 
       </mrow> 
      </msubsup> 
      <mo>
        × 
      </mo> 
      <mi>
        P 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          x 
        </mi> 
        <mo>
          | 
        </mo> 
        <mi>
          α 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>. In addition, the weights can span several orders of magnitude which is why most of the time we will use the event information defined as 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         I 
       </mi> 
       <mi>
         α 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mrow> 
        <mn>
          10 
        </mn> 
       </mrow> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            x 
          </mi> 
          <mo>
            | 
          </mo> 
          <mi>
            α 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> or 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <msup> 
        <mi>
          I 
        </mi> 
        <mo>
          ′ 
        </mo> 
       </msup> 
       <mi>
         α 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mrow> 
        <mi>
          log 
        </mi> 
       </mrow> 
       <mrow> 
        <mn>
          10 
        </mn> 
       </mrow> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          W 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            x 
          </mi> 
          <mo>
            | 
          </mo> 
          <mi>
            α 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> which only differs by a constant term. Several complex processes are involved in the transfer function, and in order to make its integration easier, a number of assumptions are typically made. It is possible to factorize the transfer function for the various particles since each particle’s detection and measurement in the final state are independent, in first order. By factorizing the various parts of the measured 4-momentum, this argument can be advanced even further <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>. Thus, the transfer function is written as</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
      <mtr> 
       <mtd> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            x 
          </mi> 
          <mo>
            | 
          </mo> 
          <mi>
            y 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <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> 
        <msub> 
         <mi>
           T 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msup> 
           <mi>
             x 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
          <mo>
            | 
          </mo> 
          <msup> 
           <mi>
             y 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msup> 
           <mi>
             x 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
          <mo>
            | 
          </mo> 
          <msup> 
           <mi>
             y 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <msubsup> 
         <mi>
           T 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           E 
         </mi> 
        </msubsup> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msup> 
           <mi>
             x 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
          <mo>
            | 
          </mo> 
          <msup> 
           <mi>
             y 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msubsup> 
         <mi>
           T 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           η 
         </mi> 
        </msubsup> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msup> 
           <mi>
             x 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
          <mo>
            | 
          </mo> 
          <msup> 
           <mi>
             y 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msubsup> 
         <mi>
           T 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           ϕ 
         </mi> 
        </msubsup> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msup> 
           <mi>
             x 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
          <mo>
            | 
          </mo> 
          <msup> 
           <mi>
             y 
           </mi> 
           <mi>
             i 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math>(7)</p>
   <p>where the index 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       i 
     </mi> 
    </math> refers to the final-state particles. The resolutions in 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       η 
     </mi> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       ϕ 
     </mi> 
    </math> are specified as delta functions and are typically very narrow. Conversely, the energy resolution is contingent upon the particle characteristics and must replicate the behavior of the simulation detector effects, which are usually Gaussian in the case of rapid simulations <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref> <xref ref-type="bibr" rid="scirp.143858-11">
     [11]
    </xref> <xref ref-type="bibr" rid="scirp.143858-13">
     [13]
    </xref>.</p>
   <p>4) Drell-Yan process and weights. In this process, a virtual photon, or Z boson, is created when a quark from one hadron and an antiquark from another hadron annihilate. After that, this virtual particle decays into two leptons with opposing charges (e.g., electrons and muons). This method is important because it yields important information regarding parton distribution functions (PDFs). These PDFs characterize the distribution of momentum among the partons (quarks and gluons) of an incoming high-energy nucleon. Deep inelastic scattering (DIS) is strongly associated with the Drell-Yan mechanism. The Feynman diagram for the Drell-Yan process can be obtained by rotating the DIS Feynman diagram by 90 degrees <xref ref-type="bibr" rid="scirp.143858-14">
     [14]
    </xref>.</p>
   <p>5) DNN decisions and fitting with MEM. Fully linked layers with linear activations for the output layer and leaky ReLU activations for the hidden layers make up the DNN architectures used in Ref. <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref>, see <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>. The Leaky ReLU performs better than other activation functions like ReLU, softplus, and ELU <xref ref-type="bibr" rid="scirp.143858-9">
     [9]
    </xref> <xref ref-type="bibr" rid="scirp.143858-15">
     [15]
    </xref> <xref ref-type="bibr" rid="scirp.143858-16">
     [16]
    </xref> in a comparison study of activation functions in “Deep neural networks and skip connections,” which has demonstrated time affordability. In order to evaluate the training stage’s progress, the coefficient of determination, or 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         R 
       </mi> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math>, can be computed using,</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mn>
        1 
      </mn> 
      <mo>
        − 
      </mo> 
      <msup> 
       <mi>
         R 
       </mi> 
       <mn>
         2 
       </mn> 
      </msup> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <msub> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mi>
           i 
         </mi> 
        </msub> 
        <msup> 
         <mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              f 
            </mi> 
            <msub> 
             <mrow> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mrow> 
                <msub> 
                 <mstyle mathvariant="bold" mathsize="normal"> 
                  <mi>
                    x 
                  </mi> 
                 </mstyle> 
                 <mi>
                   i 
                 </mi> 
                </msub> 
               </mrow> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
             </mrow> 
             <mrow> 
              <mi>
                p 
              </mi> 
              <mi>
                r 
              </mi> 
              <mi>
                e 
              </mi> 
              <mi>
                d 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                c 
              </mi> 
              <mi>
                t 
              </mi> 
              <mi>
                e 
              </mi> 
              <mi>
                d 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              − 
            </mo> 
            <mi>
              f 
            </mi> 
            <msub> 
             <mrow> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mrow> 
                <msub> 
                 <mstyle mathvariant="bold" mathsize="normal"> 
                  <mi>
                    x 
                  </mi> 
                 </mstyle> 
                 <mi>
                   i 
                 </mi> 
                </msub> 
               </mrow> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
             </mrow> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                r 
              </mi> 
              <mi>
                u 
              </mi> 
              <mi>
                e 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msup> 
       </mrow> 
       <mrow> 
        <mi>
          N 
        </mi> 
        <msup> 
         <mi>
           σ 
         </mi> 
         <mn>
           2 
         </mn> 
        </msup> 
       </mrow> 
      </mfrac> 
     </mrow> 
    </math>(8)</p>
   <p>where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         σ 
       </mi> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math> is the true values’ variance over the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       N 
     </mi> 
    </math> validation points that are identified by the index 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       i 
     </mi> 
    </math>. Keep in mind that the mean-squared error, or the selected objective function, is proportional to 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mn>
        1 
      </mn> 
      <mo>
        − 
      </mo> 
      <msup> 
       <mi>
         R 
       </mi> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math>. While the mean-squared error alone does not allow us to compare different models self-consistently, the constant of proportionality, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         σ 
       </mi> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math>, standardizes it in a way that makes it a meaningful figure of merit during the training phase <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref> <xref ref-type="bibr" rid="scirp.143858-10">
     [10]
    </xref> <xref ref-type="bibr" rid="scirp.143858-13">
     [13]
    </xref>.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>Figure 1. The building block with skip connections in a DNN. The activation of Leaky ReLU is totally associated with the first two levels. After being added to the input via the skip link and having linear activation, the last layer is converted using a non-linear Leaky ReLU function. If the input and output dimensions for the block and transformation gate 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        
  I
 
       </mi>

      </math> are different, then the weight matrix 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        
  W
 
       </mi>

      </math> can be trained. To create the neural network, the blocks are layered one after the other <xref ref-type="bibr" rid="scirp.143858-8">
       [8]
      </xref>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2181306-rId272.jpeg?20250709100748" />
   </fig>
   <p>Depending on how sophisticated the process is, calculating an event’s weight with MoMEMta can take a few seconds to several minutes. It quickly becomes prohibitive to repeat this for every hypothesis 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       α 
     </mi> 
    </math> and every event. In real-world analyses with several hypotheses and perhaps extra model parameters, this frequently complicates the method’s use. To put it briefly, Ref. <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref> study’s method processes simulated samples using MoMEMta and generates event information 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <msup> 
      <mi>
        I 
      </mi> 
      <mo>
        ′ 
      </mo> 
     </msup> 
    </math> for various hypotheses. The outcome is then utilized to train a DNN together with MoMEMta inputs, which are the 4-momenta of every observable particle. The 4-momenta of all the detected particles and the missing transverse energy ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         P 
       </mi> 
       <mi>
         T 
       </mi> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       ϕ 
     </mi> 
    </math>) are the inputs of MoMEMta; as such, these are the inputs we wish to supply to the DNN <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>. Particles produced may be boosted in one or both directions, depending on the longitudinal difference in momentum between the initial partons that collide in the detector. The network’s capacity to explain the interesting portion of the matrix element will be hampered by the need to learn about the longitudinal boost in addition to the function in Equation (6). The situation is greatly improved by using the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         P 
       </mi> 
       <mi>
         T 
       </mi> 
      </msub> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       η 
     </mi> 
    </math>, and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       ϕ 
     </mi> 
    </math> angles for each particle as inputs since the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mtext>
        Δ 
      </mtext> 
      <mi>
        η 
      </mi> 
     </mrow> 
    </math> between two particles is well approximated and independent of the longitudinal boost <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>.</p>
  </sec><sec id="s3">
   <title>3. Proof of Concept and Application to 

    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
      <mi>
       
   t
  
      </mi>
  
      <mover accent="true"> 
   
       <mi>
        
    t
   
       </mi> 
   
       <mo>
        
    ¯
   
       </mo> 
  
      </mover> 
 
     </mrow>

    </math> Production</title>
   <p>Let’s use the MEM in this study to produce two opposite sign leptons and two jets (bjets) initiated by b quarks as detected particles as a proof of concept. The primary contributions to this topology make it intriguing—Drell-Yan 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        Z 
      </mi> 
      <mo>
        → 
      </mo> 
      <msup> 
       <mi>
         l 
       </mi> 
       <mo>
         + 
       </mo> 
      </msup> 
      <msup> 
       <mi>
         l 
       </mi> 
       <mo>
         − 
       </mo> 
      </msup> 
     </mrow> 
    </math> production with additional jets, and top quark pair production 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mover accent="true"> 
       <mi>
         t 
       </mi> 
       <mo>
         ¯ 
       </mo> 
      </mover> 
     </mrow> 
    </math> having leptonic decays of the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       W 
     </mi> 
    </math> bosons from top quarks—are very dissimilar in the way they are treated in the integration. While there are no missing particles in the former case, the later involves undiscovered neutrinos whose degrees of freedom must be taken into consideration. Considering the resonnant 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        H 
      </mi> 
      <mo>
        → 
      </mo> 
      <mi>
        Z 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mo>
          → 
        </mo> 
        <msup> 
         <mi>
           l 
         </mi> 
         <mo>
           + 
         </mo> 
        </msup> 
        <msup> 
         <mi>
           l 
         </mi> 
         <mo>
           − 
         </mo> 
        </msup> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mi>
        A 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mo>
          → 
        </mo> 
        <mi>
          b 
        </mi> 
        <mover accent="true"> 
         <mi>
           b 
         </mi> 
         <mo>
           ¯ 
         </mo> 
        </mover> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> process that results in the context of Two Higgs Doublet Models (2HDM)), and has been studied by the ATLAS and CMS collaborations <xref ref-type="bibr" rid="scirp.143858-17">
     [17]
    </xref> <xref ref-type="bibr" rid="scirp.143858-18">
     [18]
    </xref>. The unknown masses of the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       H 
     </mi> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       A 
     </mi> 
    </math> bosons will demonstrate the effectiveness of our method when the parameter space is multi-dimensional, which is precisely the situation where the classical integration is impracticable. The multiple resonances in this process also pose an interesting challenge from the integration point of view <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref> <xref ref-type="bibr" rid="scirp.143858-16">
     [16]
    </xref>. A synopsis of the events for which the weights have been calculated indicates that, in order to prevent the network from becoming unbalanced, only 500 K events for the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mover accent="true"> 
       <mi>
         t 
       </mi> 
       <mo>
         ¯ 
       </mo> 
      </mover> 
     </mrow> 
    </math> process have been employed in the training <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>. For both 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mi>
         A 
       </mi> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mi>
         H 
       </mi> 
      </msub> 
     </mrow> 
    </math>, the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        H 
      </mi> 
      <mo>
        → 
      </mo> 
      <mi>
        Z 
      </mi> 
      <mi>
        A 
      </mi> 
     </mrow> 
    </math> samples and weights are divided into 23 mass configurations up to 1 TeV. For each event 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mover accent="true"> 
       <mi>
         t 
       </mi> 
       <mo>
         ¯ 
       </mo> 
      </mover> 
     </mrow> 
    </math>, Drell-Yan, and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        H 
      </mi> 
      <mo>
        → 
      </mo> 
      <mi>
        Z 
      </mi> 
      <mi>
        A 
      </mi> 
     </mrow> 
    </math>, the event information 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         I 
       </mi> 
       <mi>
         α 
       </mi> 
       <mo>
         ' 
       </mo> 
      </msubsup> 
     </mrow> 
    </math> will be assessed 23 times using various mass parameters specific to the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        H 
      </mi> 
      <mo>
        → 
      </mo> 
      <mi>
        Z 
      </mi> 
      <mi>
        A 
      </mi> 
     </mrow> 
    </math> instance. The data given in Ref. <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref> also includes the number of faulty weights and the number that were recomputed using additional iterations. <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref> displays the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <msup> 
        <mi>
          I 
        </mi> 
        <mo>
          ′ 
        </mo> 
       </msup> 
       <mrow> 
        <mi>
          D 
        </mi> 
        <mi>
          Y 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> distributions for each of the three sample types. The weights from the MEM computed with MoMEMta and the ones from the DNN agree quite well. The model with six layers and 200 neurons, with RELU and SELU <xref ref-type="bibr" rid="scirp.143858-9">
     [9]
    </xref> <xref ref-type="bibr" rid="scirp.143858-15">
     [15]
    </xref> <xref ref-type="bibr" rid="scirp.143858-16">
     [16]
    </xref> activation functions for the hidden and output layers, respectively. Utilizing the Breit-Wigner resonances in a variable change allows for a reasonable computation time reduction (approximately 3.2 times slower than for the Drell-Yan weights) <xref ref-type="bibr" rid="scirp.143858-1">
     [1]
    </xref> <xref ref-type="bibr" rid="scirp.143858-8">
     [8]
    </xref>. <xref ref-type="fig" rid="fig3">
     Figure 3
    </xref> displays the corresponding 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <msup> 
        <mi>
          I 
        </mi> 
        <mo>
          ′ 
        </mo> 
       </msup> 
       <mrow> 
        <mi>
          t 
        </mi> 
        <mover accent="true"> 
         <mi>
           t 
         </mi> 
         <mo>
           ¯ 
         </mo> 
        </mover> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> distributions. Although there is less of a discrepancy in the weight distribution between the Drell-Yan and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mover accent="true"> 
       <mi>
         t 
       </mi> 
       <mo>
         ¯ 
       </mo> 
      </mover> 
     </mrow> 
    </math> samples, the Drell-Yan events have a longer tail. The distinct mass configurations 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mi>
         H 
       </mi> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mi>
         A 
       </mi> 
      </msub> 
     </mrow> 
    </math> that make up this sample are the source of the double peak observed in the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        H 
      </mi> 
      <mo>
        → 
      </mo> 
      <mi>
        Z 
      </mi> 
      <mi>
        A 
      </mi> 
     </mrow> 
    </math> scenario. Low weights are associated with high (pseudo)scalar masses, but low masses are more in line with the theory of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mover accent="true"> 
       <mi>
         t 
       </mi> 
       <mo>
         ¯ 
       </mo> 
      </mover> 
     </mrow> 
    </math>. Overall, there is good agreement between the weights from the DNN and those obtained classically <xref ref-type="bibr" rid="scirp.143858-2">
     [2]
    </xref>. Considering the application’s next-leading order (NLO) of MEM in 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mover accent="true"> 
       <mi>
         t 
       </mi> 
       <mo>
         ¯ 
       </mo> 
      </mover> 
     </mrow> 
    </math> production, we can examine the impact of missing higher-order effects in the likelihood computation as an example. With POWHEG <xref ref-type="bibr" rid="scirp.143858-19">
     [19]
    </xref> <xref ref-type="bibr" rid="scirp.143858-20">
     [20]
    </xref>, a single top-quark event is produced, and PYTHIA8 <xref ref-type="bibr" rid="scirp.143858-21">
     [21]
    </xref> is used to sprinkle it down <xref ref-type="bibr" rid="scirp.143858-12">
     [12]
    </xref>. It is possible to identify the specific ways in which the parton shower impacts the analysis by using the MEM to analyze these occurrences using fixed-order calculations. The extraction of the top-quark mass using the MEM from showering events produced using POWHEG and PYTHIA8 is depicted in the left plot of <xref ref-type="fig" rid="fig4">
     Figure 4
    </xref>. The likelihood function is exclusively computed in the Born approximation (blue) and with NLO adjustments (red) in the study displayed in <xref ref-type="fig" rid="fig4">
     Figure 4
    </xref>. To derive the estimator for the top-quark mass 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mover accent="true"> 
        <mi>
          m 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mi>
         t 
       </mi> 
      </msub> 
     </mrow> 
    </math> as the position of the minimum and the related statistical uncertainty 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mtext>
        Δ 
      </mtext> 
      <msub> 
       <mover accent="true"> 
        <mi>
          m 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mi>
         t 
       </mi> 
      </msub> 
     </mrow> 
    </math> as the breadth of the parabola, a parabola is fitted to the negative logarithm of the likelihood function (Log-Likelihood). By factorizing in two different factorization and renormalization scales in the likelihood calculation, the theoretical uncertainty resulting from missing higher orders is assessed. The missing higher-order adjustments in the corresponding likelihood calculations are the reason for the biases in the recovered estimators 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mover accent="true"> 
        <mi>
          m 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          B 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          n 
        </mi> 
       </mrow> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <mn>
        150.19 
      </mn> 
     </mrow> 
    </math> GeV and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mover accent="true"> 
        <mi>
          m 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          N 
        </mi> 
        <mi>
          L 
        </mi> 
        <mi>
          O 
        </mi> 
       </mrow> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <mn>
        163.75 
      </mn> 
     </mrow> 
    </math> GeV with regard to the input value for the top-quark mass 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         m 
       </mi> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          t 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <mn>
        173.2 
      </mn> 
     </mrow> 
    </math> GeV. When there is a discrepancy between the probability density used to calculate likelihood and the actual distribution of the events, the MEM is known to provide biased estimators. Hence, there is a need for the calibration of the method in introducing its associated uncertainties.</p>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Figure 2. Distributions of the event information 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <msub> 
   
         <msup> 
    
          <mi>
           
     I
    
          </mi> 
    
          <mo>
           
     ′
    
          </mo> 
   
         </msup> 
   
         <mrow> 
    
          <mi>
           
     D
    
          </mi>
    
          <mi>
           
     Y
    
          </mi>
   
         </mrow> 
  
        </msub> 
 
       </mrow>

      </math> from both MoMEMta and the DNN for the three samples Drell-Yan (left), 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   t
  
        </mi>
  
        <mover accent="true"> 
   
         <mi>
          
    t
   
         </mi> 
   
         <mo>
          
    ¯
   
         </mo> 
  
        </mover> 
 
       </mrow>

      </math>-(middle) and 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   H
  
        </mi>
  
        <mo>
         
   →
  
        </mo>
  
        <mi>
         
   Z
  
        </mi>
  
        <mi>
         
   A
  
        </mi>
 
       </mrow>

      </math> (right) events <xref ref-type="bibr" rid="scirp.143858-2">
       [2]
      </xref>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2181306-rId349.jpeg?20250709100749" />
   </fig>
   <fig id="fig3" position="float">
    <label>Figure 3</label>
    <caption>
     <title>Figure 3. Distributions of the event information 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <msub> 
   
         <msup> 
    
          <mi>
           
     I
    
          </mi> 
    
          <mo>
           
     ′
    
          </mo> 
   
         </msup> 
   
         <mrow> 
    
          <mi>
           
     t
    
          </mi>
    
          <mover accent="true"> 
     
           <mi>
             t 
           </mi> 
     
           <mo>
             ¯ 
           </mo> 
    
          </mover> 
   
         </mrow> 
  
        </msub> 
 
       </mrow>

      </math> from both MoMEMta and the DNN for the three samples: Drell-Yan (left), 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   t
  
        </mi>
  
        <mover accent="true"> 
   
         <mi>
          
    t
   
         </mi> 
   
         <mo>
          
    ¯
   
         </mo> 
  
        </mover> 
 
       </mrow>

      </math>-(middle) and 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   H
  
        </mi>
  
        <mo>
         
   →
  
        </mo>
  
        <mi>
         
   Z
  
        </mi>
  
        <mi>
         
   A
  
        </mi>
 
       </mrow>

      </math> (right) events <xref ref-type="bibr" rid="scirp.143858-2">
       [2]
      </xref>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2181306-rId356.jpeg?20250709100749" />
   </fig>
   <fig id="fig4" position="float">
    <label>Figure 4</label>
    <caption>
     <title>Figure 4. Left: Top-quark mass extraction via the MEM at leading order (LO) (blue) and NLO (red) from single top-quark events generated with POWHEG + PYTHIA8. Right: Same but with extended likelihoods functions <xref ref-type="bibr" rid="scirp.143858-12">
       [12]
      </xref>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2181306-rId363.jpeg?20250709100749" />
   </fig>
  </sec><sec id="s4">
   <title>4. Conclusion</title>
   <p>This study proposes the utilization of a Deep Neural Network (DNN) to approximate the integral of the Matrix Element Method (MEM) with the objective of expediting MEM computations. It is inferred from the few examined and documented example processes that, with the assistance of specialized tools like MoMEMta, a DNN can be effectively trained to closely replicate the outcomes of the direct numerical integration of the matrix element. Although the weights in this regression employing the DNN inherently contain errors, these are unlikely to significantly impact performance across various applications. The adoption of accelerated weight computations presents a plethora of opportunities, such as systematic research, probability scans, parameter scans, and, more broadly, the application of MEM to a wider array of physics analyses, including the discovery of novel physics phenomena.</p>
  </sec><sec id="s5">
   <title>Acknowledgements</title>
   <p>I wish to express my sincere gratitude to Professor Elena Long for her invaluable introduction to “Special Topics in Particle Physics”. The research by Simone Alioli et al. served as a significant impetus for this study.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.143858-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nguyen, N.T.T., Kenyon, G.T. and Yoon, B. (2020) A Regression Algorithm for Accelerated Lattice QCD That Exploits Sparse Inference on the D-Wave Quantum Annealer. Scientific Reports, 10, Article No. 10915. &gt;https://doi.org/10.1038/s41598-020-67769-x
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bury, F. and Delaere, C. (2021) Matrix Element Regression with Deep Neural Networks—Breaking the CPU Barrier. Journal of High Energy Physics, 2021, Article No. 20. &gt;https://doi.org/10.1007/jhep04(2021)020
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dery, L.M., Nachman, B., Rubbo, F. and Schwartzman, A. (2017) Weakly Supervised Classification in High Energy Physics. Journal of High Energy Physics, 2017, Article No. 145. &gt;https://doi.org/10.1007/jhep05(2017)145
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kuusela, M., Vatanen, T., Malmi, E., Raiko, T., Aaltonen, T. and Nagai, Y. (2012) Semi-Supervised Anomaly Detection—Towards Model-Independent Searches of New Physics. Journal of Physics: Conference Series, 368, Article ID: 012032. &gt;https://doi.org/10.1088/1742-6596/368/1/012032
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bruscino, N. (2016) Search for the Standard Model Higgs Boson Decaying into b
     <sup>-</sup> Produced in Association with Top Quarks Decaying Hadronically in Pp Collisions at = 8 TeV with the ATLAS Detector. 4th Annual Large Hadron Collider Physics, Lund, 13-18 June 2016, Sweden, 1-4. &gt;https://doi.org/10.22323/1.276.0192
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dalitz, R.H. and Goldstein, G.R. (1999) Test of Analysis Method for Top—Antitop Production and Decay Events. Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 455, 2803-2834. &gt;https://doi.org/10.1098/rspa.1999.0428
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Leigh, M., Raine, J.A., Zoch, K. and Golling, T. (2023) v-Flows: Conditional Neutrino Regression. SciPost Physics, 14, 159. &gt;https://doi.org/10.21468/scipostphys.14.6.159
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bishara, F., Paul, A. and Dy, J. (2024) High-Precision Regressors for Particle Physics. Scientific Reports, 14, Article No. 5294. &gt;https://doi.org/10.1038/s41598-024-52941-4
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nair, V. and Hinton, G.E. (2010) Rectified Linear Units Improve Restricted Boltzmann Machines. Proceedings of the 27th International Conference on International Conference on Machine Learning, Haifa, 21-24 June 2010, 807-814.
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Grazzini, M., Kallweit, S. and Wiesemann, M. (2018) Fully Differential NNLO Computations with MATRIX. The European Physical Journal C, 78, Article No. 537. &gt;https://doi.org/10.1140/epjc/s10052-018-5771-7
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Fiedler, F., Grohsjean, A., Haefner, P. and Schieferdecker, P. (2010) The Matrix Element Method and Its Application to Measurements of the Top Quark Mass. Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, 624, 203-218. &gt;https://doi.org/10.1016/j.nima.2010.09.024
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Martini, T., Kraus, M., Peitzsch, S. and Uwer, P. (2020) The Matrix Element Method as a Tool for Precision and Accuracy. Proceedings of European Physical Society Conference on High Energy Physics—PoS (EPS-HEP2019), Belgium, 10-17 July 2019, 1-9. &gt;https://doi.org/10.22323/1.364.0673
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Fiedler, F. (2010) Precision Measurements of the Top Quark Mass. &gt;https://api.semanticscholar.org/CorpusID:118787406 
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chen, L., Gao, J. and Liang, Z. (2014) Nuclear Dependencies of Azimuthal Asymmetries in the Drell-Yan Process. Physical Review C, 89, Article ID: 035204. &gt;https://doi.org/10.1103/physrevc.89.035204
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sun, Y., Wang, X. and Tang, X. (2015) Deeply Learned Face Representations Are Sparse, Selective, and Robust. 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Boston, 7-12 June 2015, 2892-2900. &gt;https://doi.org/10.1109/cvpr.2015.7298907
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Clevert, D., Unterthiner, T. and Hochreiter, S. (2015) Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs). &gt;https://api.semanticscholar.org/CorpusID:5273326 
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Saggio, A. (2020) Search for 2HDM Neutral Higgs Bosons through the Process → ZA → l
     <sup>+</sup>l
     <sup>−</sup> b with the CMS Detector. Proceedings of European Physical Society Conference on High Energy Physics—PoS (EPS-HEP2019), Belgium, 10-17 July 2019, 1-5. &gt;https://doi.org/10.22323/1.364.0361
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Petrucciani, G. (2013) Searches for a Heavy Higgs Boson Decaying into WW, ZZ in Final States with Hadronic Jets and Neutrinos. In: Petrucciani, G., Ed., The Search for the Higgs Boson at CMS, Scuola Normale, 147-163. &gt;https://doi.org/10.1007/978-88-7642-482-3_7
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alioli, S., Nason, P., Oleari, C. and Re, E. (2010) A General Framework for Implementing NLO Calculations in Shower Monte Carlo Programs: The POWHEG Box. Journal of High Energy Physics, 2010, Article No. 43. &gt;https://doi.org/10.1007/jhep06(2010)043
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alioli, S., Nason, P., Oleari, C. and Re, E. (2009) NLO Single-Top Production Matched with Shower in POWHEG: s-and t-Channel Contributions. Journal of High Energy Physics, 2009, 111. &gt;https://doi.org/10.1088/1126-6708/2009/09/111
    </mixed-citation>
   </ref>
   <ref id="scirp.143858-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sjöstrand, T., Ask, S., Christiansen, J.R., Corke, R., Desai, N., Ilten, P., et al. (2015) An Introduction to PYTHIA 8.2. Computer Physics Communications, 191, 159-177. &gt;https://doi.org/10.1016/j.cpc.2015.01.024
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>