<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>with Physics-Informed Graph Neural Networks on Unstructured Meshes</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jens Decke</string-name>
          <email>jdecke@uni-kassel.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexander Heinen</string-name>
          <email>alexander.heinen@uni-kassel.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bernhard Sick</string-name>
          <email>bsick@uni-kassel.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christian Gruhl</string-name>
          <email>cgruhl@uni-kassel.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Physics Informed Neural Network, Graph Neural Network, Active Learning</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Intelligent Embedded Systems, University of Kassel</institution>
          ,
          <addr-line>34121 Kassel</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>68</fpage>
      <lpage>76</lpage>
      <abstract>
        <p>This paper investigates the use of Physics-Informed Neural Networks (PINNs) in active learning cycles. We defined two scenarios: one initially unsupervised and the other initially supervised. PINNs emphasize the integration of physical laws into neural networks to improve the predictive performance of vanilla neural networks and to enhance the eficiency of traditional methods for solving partial diferential equations (PDEs). Key contributions include adapting existing computational frameworks to enable the use of Graph Neural Networks for solving problems that require the calculation of gradients on unstructured triangle meshes, a query strategy focusing on the physical loss, and a comparative analysis of this strategy against random sampling across both defined scenarios. This work establishes a foundation for future research aimed at expanding the application of PhysicsInformed Graph Neural Networks (PIGNN) using active learning and addressing real-world problems in fluid dynamics and electrodynamics.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Solving partial diferential equations (PDEs) is of paramount interest in numerous fields of science
and engineering, as they form the foundation for modeling a wide range of physical phenomena.
PDEs describe the behavior of physical systems over space and time, governing processes such as
heat transfer [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], fluid dynamics [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], structural mechanics [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and electromagnetics [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Accurate and
eficient solutions to PDEs are crucial for advancing research and development in these areas, making
them a focal point of computational and analytical studies [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Traditional methods for solving PDEs,
such as finite element (FEM), finite diference, and finite volume methods, can be computationally
intensive, especially for high-dimensional problems and complex geometries. In recent years,
PhysicsInformed Neural Networks (PINNs) have emerged as a powerful alternative computational framework
that integrates machine learning with fundamental physical laws to address these challenges [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ].
      </p>
      <p>By embedding physical constraints directly into the neural network’s loss function   
cf. Eq. (1),
they utilize both data loss</p>
      <p>, cf. Eq. (2) and physics loss   , cf. Eq. (3) components. With  as the
weighting factor for the data component of the total loss and N vertices.</p>
      <p>=  ⋅</p>
      <p>+   ,

=
= ( )
1
 =1
∑(  −  ,
2
) ,
nEvelop-O
LGOBE
https://www.uni-kassel.de/eecs/ies/ (B. Sick)</p>
      <p>PINNs ofer several advantages over traditional methods and ensure that the solutions are not only
data-consistent but also physically accurate. Additionally, PINNs can naturally incorporate
multiphysics problems and seamlessly handle high-dimensional spaces, providing a flexible and eficient
CEUR
Workshop
Proceedings</p>
      <p>
        ceur-ws.org
ISSN1613-0073
approach to solving complex PDEs. In Fig. 1 an active learning (AL) cycle with a PINN as Model is
depicted. The queries from the Selector are directed towards an Oracle which is in our case a FEM
simulation. The AL cycle uses Eq. (1) where   measures the mean squared error between a predicted
 and a true   solution variable (for instance, the prediction of the electric potential), and is therefore
trained in a supervised manner. While the physics loss Eq. (3)   corresponds to the residual ( )
and ensures adherence to the PDE. This loss term operates solely unsupervised on the predicted solution
variable  . This integration allows PINNs to handle sparse data efectively, making them particularly
useful in real-world applications where data is limited [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>We use this AL cycle to train the PINN starting from two diferent initial states. In Scenario U the
model is initially trained completely unsupervised, using the physics-informed loss (3) only, and then
data is provided by the oracle to continue the following iterations using    on the additional data
to support the unsupervised training. In Scenario S, we use ground-truth data for supervised training
right from the start and therefore use    as a loss function.</p>
      <p>
        The choice of mesh plays a crucial role in the implementation of PINNs, as it defines the discretization
of the problem domain. Structured meshes, with their equidistantly distributed cells, ofer computational
eficiency and simplicity by enabling straightforward application of automatic diferentiation algorithm
to compute spatial gradients [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In contrast, unstructured meshes provide the flexibility to handle
complex geometries and allow for adaptivity in regions requiring higher resolution. Graph Neural
Networks (GNNs) are ideal for solving PDEs on unstructured meshes because they adeptly handle
the complex, irregular topologies of these meshes by learning node relationships directly. However,
the computation of spatial gradients in unstructured meshes is more complex due to the irregular
neighborhoods of their triangular cells. The design of the mesh significantly afects the distribution
of data points, the precision of diferential operator evaluations, and the enforcement of boundary
conditions. For this reason, we combine a GNN with a physics-informed loss function to develop a
Physics-Informed Graph Neural Network PIGNN. For that, we have to adapt an existing TensorFlow
library to enable the computation of field gradients on unstructured meshes in our PyTorch model.
      </p>
      <p>In summary, PINNs represent a sophisticated method for solving PDEs by integrating neural networks
with physical laws. Enhancing these networks through AL by physical loss residuals, rather than explicit
uncertainty quantification, allows for a more straightforward yet efective refinement process. Strategic
mesh design further augments the model, making PIGNNs a versatile tool for a wide range of applications
in science and engineering.</p>
      <p>Contributions
1. We adapt an existing TensorFlow implementation to calculate field gradients on
twodimensional triangle meshes for our PyTorch model. We use this implementation to build a
physical loss function representing the Poisson equation with Dirichlet boundary conditions
on an unstructured mesh.
2. We propose a simple yet efective query strategy utilizing the physical loss function.
3. We develop and evaluate two distinct PINN-based active learning scenarios, initially
unsupervised and initially supervised, comparing our query strategy with random sampling.</p>
      <p>The remainder of this article is structured as follows: in Section 2 we summarize the related work
before we introduce our methodology in Section 3. Our preliminary results are presented in Section 4.
The article concludes with a summary of our findings and an outlook for future work in Section 5.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        In this section, we propose related work to the topics of GNNs and PINNs as well as AL and PINNs.
GNNs and PINNs: Solving mesh-based PDEs with neural networks is an increasingly progressive
topic of research. Typical data-driven solution methods come from the fields of computer vision and
graph-based learning [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, these methods lack information about the underlying physics of
the problems at hand.
      </p>
      <p>
        Initial studies have demonstrated that combining GNNs and PINNs yields excellent results in various
scientific and engineering applications. GNNs excel at processing data represented as graphs, which
is particularly useful for handling complex relationships in unstructured meshes [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]. To leverage
PINNs on unstructured meshes there is an existing package [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] which was initially developed for
TensorFlow. In that way, the capabilities of GNNs can be efectively utilized to design PINNs with the
ability to solve equations containing field gradients.
      </p>
      <p>
        AL and PINNs: AL for regression tasks is highly efective in reducing the computational load
associated with simulating PDEs. By strategically selecting the most informative samples for extensive
simulation, AL can significantly enhance eficiency [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ]. However, for specific applications like
design optimization, where the goal is to systematically identify the optimal design parameters that
satisfy specified performance criteria, it is essential to customize the query strategies. This customization
ensures that iterative algorithms efectively find the best design with minimal PDE evaluations, aligning
the AL process with the optimization objectives and constraints of the physical system described by
PDEs [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>
        The idea of combining PINNs with AL is gaining increasing attention. Recent works have taken
initial steps in this direction, employing uncertainty sampling via Monte Carlo dropout [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] to select
informative samples. Another study proposed an adaptive sampling strategy based on Christofel
functions [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. In contrast to these approaches, our work focuses exclusively on a score-sampling
strategy based on the physical loss.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <p>Our methodology is structured as follows: first, we introduce the data derived from the Poisson equation,
which is a second-order PDE. Subsequently, we present our model, query strategy, and oracle. Finally,
we present our experimental setup.</p>
      <p>Data: As dataset we use the charge density input array and the FEM simulated solutions of the Poisson
equation together with the mesh, featuring a circular bounded domain (Ω ⊂ ℝ ), and the associated edge
indices. As input scalar field  we use a random distribution of circular areas with randomly chosen
radii. Although the Poisson equation can be applied to a variety of physics problems, our goal is to
calculate the electric potential field  of a given constant charge density distribution  , represented by
the circle areas which is expressed in Eq. (4). Here Δ represents the Laplacian operator:
−Δ = 
 = 0
in Ω
on Ω
In this equation, Ω denotes the boundary of the domain Ω. In Fig. 2, the input features (Fig. 2a) and
the ground-truth solution (Fig. 2b) of a random sample are exemplarily illustrated.</p>
      <p>As illustrated in Fig. 2c, we employ an unstructured triangular mesh to discretize the domain. This
type of mesh allows us to accurately capture the geometry and boundary conditions of complex domains.
The physical loss   of the Poisson equation (Eq. (4)) is defined in Eq. ( 5):
 
= ( ) =</p>
      <p>
        ‖Δ +  ‖ 2   Ω
{ ‖ ‖2   Ω
To compute this loss, it is necessary to obtain the second spatial derivative, indicated by the Laplace
operator. This computation requires considering the spatial dependencies of the mesh cells. While the
Automatic Diferentiation (AD) algorithm [
        <xref ref-type="bibr" rid="ref17 ref8">8, 17</xref>
        ] is typically used for uniform and structured meshes,
it cannot be applied to unstructured meshes used in our study because it struggles with eficiently
propagating derivatives through the complex and irregular connections. Therefore, specialized
techniques are needed to handle the unstructured nature of the mesh and accurately compute the required
gradients for the physical loss.
      </p>
      <p>
        Model: We utilize our PIGNN to eficiently handle the intricate geometries of the domain. The
GNN’s structure is particularly well-suited for capturing the relationships and dependencies within
unstructured data. As GNN type we chose six chebyshev spectral graph convolutional (ChebConv)
layers as the main model and two feed-forward layers as encoder and decoder. The ChebConv layers
(4)
(5)
(a) Features
(b) Ground-Truth
(c) Triangular mesh
 -hop convolutional operator aggregates information of vertices that are in a radius of  -hops from
the central vertex in contrast to the more popular 1-hop graph convolutional layers, which only take
into account directly connected nodes. Using a  -factor of six allows our model to recognize bigger
structures and helps to minimize the prediction error. To enhance the model’s capability in dealing with
complex mesh geometries, we integrate it with the MeshGradientPy package [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], which computes
ifeld gradient estimates on every cell based on linear interpolation and then uses an averaging method
to obtain gradient values on vertices. This integration is crucial for accurately resolving the Laplacian,
as specified in Eq. (5). By doing so, we can efectively calculate the unsupervised physical loss   ,
ensuring that the model adheres to the underlying physical laws governing the problem domain. Since
the package is developed for Tensorflow, we adapted the implementation for integration with PyTorch.
Query Strategy: During inference, we can compute the physics residuals ( ) without needing
ground-truth values. These residuals are derived from the physical loss   , highlighting samples of
the PIGNN’s predictions that deviate from expected physical behavior. To improve the performance of
our PIGNNs, we employ an innovative strategy that leverages the physical loss   during inference
to guide AL and retraining.
      </p>
      <p>In Eq. (6) our query strategy is depicted. Let  be the set of all samples  that are inferred, and  be
a subset of  containing the  samples with the highest   values. The subset  is forwarded to the
Oracle for target value acquisition.</p>
      <p>= { ∈  ∣ 
 () ∈ Top (  )}
(6)</p>
      <p>
        In contrast to uncertainty sampling in AL, this strategy works by evaluating the physical residuals,
which quantify how well the predicted solution variable  adheres to the governing physical laws; thus,
no additional uncertainty estimation method is required. By identifying samples where the model’s
predictions are less reliable, we can target specific areas for model improvement. The advantage of this
approach is that we can quantify the physical loss in an unsupervised manner, thereby eliminating the
need for costly epistemic uncertainty quantification methods [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>This unsupervised quantification of physical loss simplifies the AL process, allowing the model to
autonomously identify and focus on regions with high residuals. These high-residual areas indicate
where the model’s predictions are most inaccurate, guiding the addition of new data points or retraining
eforts to these critical areas. This method not only streamlines the training process but also ensures
robust model enhancement by continuously refining the model based on its internal assessments of
physical law adherence. This approach is particularly valuable in scenarios where obtaining
groundtruth data is expensive or impractical, as it maximizes the use of available information to improve model
performance and reliability.</p>
      <p>Oracle: Focusing on samples with high physical residuals, the Oracle generates additional data in
these regions, thereby improving the model’s performance. The Model uses its internal physics-based
evaluations to guide its learning process, leveraging both the supervised and unsupervised capabilities
of the PIGNN to ensure its predictions remain physically consistent. The Selector identifies high-residual
samples and the Oracle provides the corresponding true values, which are then included in the training
of the Model for fine-tuning. This active interaction between the Oracle and the Model allows for
targeted improvements in areas where the model’s predictions are less reliable enhancing the model’s
performance cost-efectively.</p>
      <p>Experimental Setup: Our experimental setup is designed to evaluate two distinct scenarios and is
depicted in Fig. 1:</p>
      <p>In Scenario U, we start with a pool of 1500 samples with ground-truth solution data determined
from FEM simulations (oracle). The PIGNN is initially trained on 600 randomly selected samples in
an unsupervised manner using the physics-based loss function   (cf. Eq. (3)) only, therefore, no
ground-truth data is provided. After this initial training phase, the model is evaluated on the remaining
900 samples, calculating physics residuals to identify the 60 samples with the highest residuals (cf.
Eq.(6)). The ground-truth values for these high-residual samples are then obtained from the Oracle
and added to the training set, enabling the use of the total loss Eq. (1) on these additionally acquired
samples. This iterative process of identifying and adding 60 high-residual samples continues until the
cycle iterates 5 times. This scenario is termed unsupervised since the majority of the training is based
on the unsupervised physical loss (cf. Eq. (3)) only, except for the samples added by the oracle.</p>
      <p>In Scenario S, we defined a supervised scenario, therefore, using the ground-truth data of the initial
600 randomly selected samples. The total loss    (cf. Eq. (1)) is applied to both, the initial samples
and the samples acquired over five iterations, which are provided by the oracle.</p>
      <p>For both scenarios, after each iteration, the PIGNN is tested on a separate test dataset of 1500 samples
to evaluate its prediction performance and adherence to physical laws. Additionally, we compare these
methods to a random selection strategy, where 60 random samples are acquired for the training set in
each iteration. This comparison assesses the eficiency of the proposed selection strategy guided by the
physical loss   .</p>
    </sec>
    <sec id="sec-4">
      <title>4. Preliminary Results and Discussion</title>
      <p>The results of our experiments, are summarized in Fig. 3 and will be discussed in the following: First,
we can observe that our proposed query strategy outperforms the random strategy in both scenarios. It
is evident that after the first iteration, Scenario S, which was trained supervised to optimize the total
loss    , surpasses Scenario U, where the model was trained solely using the unsupervised loss   .
However, after four AL cycles, Scenario U demonstrates superior performance compared to Scenario S.
This indicates that the initial unsupervised training is a viable approach for our PIGNN. Considering
that substantial resources are saved by determining the ground-truth values for the initial training pool
— which in our example involved 600 samples — and given that one FEM simulation in industrial use
cases can take days or even weeks of computing time, the advantages become even more apparent. An
adaptive approach that only simulates the most valuable samples presents significant benefits.</p>
      <p>
        However, an in-depth analysis of the consistency of multiple runs using various seeds was beyond
the scope of this work. Additionally, we did not conduct any hyper-parameter tuning or investigate
AL parameters such as the initial pool size, the acquisition size, or the total budget. Consequently,
the observed fluctuations in the results may be attributed to these factors. These fluctuations may be
primarily due to the limited number of experiments performed and the non-optimized hyperparameters,
which were not adjusted due to the significant efort required, especially in the context of active
learning [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
      </p>
      <p>Other typical AL query strategies were also not considered. Another critical parameter is  , which
serves as the weighting factor between the two components of the loss function (cf. Eq. (1)). An
incorrectly chosen  can lead to the optimization being dominated by one part of the loss function,
either   or   , at the expense of the other. These aspects need to be elaborated in future work.</p>
      <p>Electric potential u [V]</p>
      <p>In Fig. 4 a randomly chosen test sample of the final iteration of Scenario U is depicted. It shows that
our AL strategy in combination with the PIGNN is capable of providing high-performing predictions in
Fig. 4b. In Fig. 4c the absolute deviation e.g. the L1-error between the prediction and the ground-truth
solution is depicted.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion, Limitations and Future Work</title>
      <p>
        Our experiments show that our PIGNN is generally suitable for use in AL scenarios. Our proposed
query strategy is built upon the network’s physical loss, which can be evaluated unsupervised. In
future work, we aim to apply our methodology and model to real-world problems and more complex
datasets from the field of fluid dynamics [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and electrodynamics [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Further, we plan to investigate
other acquisition sizes, total budgets, and the initial selection of samples as well as optimization of
hyperparameters which is in general not trivial in deep AL.
      </p>
      <p>
        Currently, our PIGNN is validated on a circular problem domain solving the Poisson equation on an
unstructured triangular mesh. In the future, we plan to employ this model for more complex geometries
and physical problems. For the above-mentioned datasets, we intend to solve the Maxwell equations on
an unstructured mesh for modeling an electric motor and address turbulent flow in a U-bend applying
the Navier-Stokes equations on a graded mesh. Another work compares methods from the fields of
computer vision and graph learning on these two datasets [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. We aim to extend this comparison to
include PINNs. These advancements will help validate the robustness and versatility of our PIGNN
in solving a wider range of complex real-world problems. Furthermore, we want to contribute with
the help of AL to face the problems of data scarcity in the realm of solving computationally expensive
PDEs.
      </p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgment</title>
      <p>This research has been funded by the Federal Ministry for Economic Afairs and Climate Action (BMWK)
within the project ”KI-basierte Topologieoptimierung elektrischer Maschinen (KITE)” (19I21034C).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Perdikaris</surname>
          </string-name>
          , G. E. Karniadakis,
          <article-title>Physics-Informed Neural Networks for Heat Transfer Problems</article-title>
          ,
          <source>Journal of Heat Transfer</source>
          <volume>143</volume>
          (
          <year>2021</year>
          )
          <article-title>060801</article-title>
          . URL: https://doi.org/10.1115/ 1.4050542. doi:
          <volume>10</volume>
          .1115/1.4050542.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Decke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Wünsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gruhl</surname>
          </string-name>
          ,
          <article-title>From structured to unstructured:a comparative analysis of computer vision and graph models in solving mesh-based pdes</article-title>
          ,
          <year>2024</year>
          . arXiv:
          <volume>2406</volume>
          .
          <fpage>00081</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Haghighat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raissi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moure</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Juanes</surname>
          </string-name>
          ,
          <article-title>A physics-informed deep learning framework for inversion and surrogate modeling in solid mechanics</article-title>
          ,
          <source>Computer Methods in Applied Mechanics and Engineering</source>
          <volume>379</volume>
          (
          <year>2021</year>
          )
          <article-title>113741</article-title>
          . URL: https://www.sciencedirect.com/ science/article/pii/S0045782521000773. doi:https://doi.org/10.1016/j.cma.
          <year>2021</year>
          .
          <volume>113741</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Botache</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Decke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ripken</surname>
          </string-name>
          , et al.,
          <article-title>Enhancing multi-objective optimization through machine learning-</article-title>
          <source>supported multiphysics simulation</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S. H.</given-names>
            <surname>Rudy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Brunton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Proctor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. N.</given-names>
            <surname>Kutz</surname>
          </string-name>
          ,
          <article-title>Data-driven discovery of partial diferential equations</article-title>
          ,
          <source>Science Advances</source>
          <volume>3</volume>
          (
          <year>2017</year>
          )
          <article-title>e1602614</article-title>
          . URL: https: //www.science.org/doi/abs/10.1126/sciadv.1602614. doi:
          <volume>10</volume>
          .1126/sciadv.1602614. arXiv:https://www.science.org/doi/pdf/10.1126/sciadv.1602614.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Raissi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Perdikaris</surname>
          </string-name>
          , G. Karniadakis,
          <article-title>Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial diferential equations</article-title>
          ,
          <source>Journal of Computational Physics</source>
          <volume>378</volume>
          (
          <year>2019</year>
          )
          <fpage>686</fpage>
          -
          <lpage>707</lpage>
          . URL: https://www.sciencedirect.com/ science/article/pii/S0021999118307125. doi:https://doi.org/10.1016/j.jcp.
          <year>2018</year>
          .
          <volume>10</volume>
          .045.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Cuomo</surname>
          </string-name>
          , V. S. di
          <string-name>
            <surname>Cola</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Giampaolo</surname>
            , G. Rozza,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Raissi</surname>
            ,
            <given-names>F. Piccialli,</given-names>
          </string-name>
          <article-title>Scientific machine learning through physics-informed neural networks: Where we are and what's next</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2201</volume>
          .
          <fpage>05624</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Baydin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. A.</given-names>
            <surname>Pearlmutter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Radul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Siskind</surname>
          </string-name>
          ,
          <article-title>Automatic diferentiation in machine learning: a survey</article-title>
          ,
          <source>J. Mach. Learn. Res</source>
          .
          <volume>18</volume>
          (
          <year>2017</year>
          )
          <fpage>5595</fpage>
          -
          <lpage>5637</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>H.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Zahr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Physics-informed graph neural galerkin networks: A unified framework for solving pde-governed forward and inverse problems</article-title>
          ,
          <source>Computer Methods in Applied Mechanics and Engineering</source>
          <volume>390</volume>
          (
          <year>2022</year>
          )
          <article-title>114502</article-title>
          . URL: http://dx.doi.org/10.1016/j.cma.
          <year>2021</year>
          .
          <volume>114502</volume>
          . doi:
          <volume>10</volume>
          .1016/j.cma.
          <year>2021</year>
          .
          <volume>114502</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Thangamuthu</surname>
          </string-name>
          , G. Kumar,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bishnoi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bhattoo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. M. A.</given-names>
            <surname>Krishnan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ranu</surname>
          </string-name>
          ,
          <article-title>Unravelling the performance of physics-informed graph neural networks for dynamical systems</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>35</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2022</year>
          , pp.
          <fpage>3691</fpage>
          -
          <lpage>3702</lpage>
          . URL: https://proceedings.neurips.cc/paper_files/paper/2022/ file/17b598fda495256bef6785c2b76c3217-Paper-Datasets_and_Benchmarks.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Mancinelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Livesu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Puppo</surname>
          </string-name>
          ,
          <article-title>A comparison of methods for gradient field estimation on simplicial meshes</article-title>
          ,
          <source>Computers &amp; Graphics</source>
          <volume>80</volume>
          (
          <year>2019</year>
          )
          <fpage>37</fpage>
          -
          <lpage>50</lpage>
          . doi:https://doi.org/10.1016/j. cag.
          <year>2019</year>
          .
          <volume>03</volume>
          .005.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <article-title>Active learning query strategies for classification, regression, and clustering: A survey</article-title>
          ,
          <source>J. Comput. Sci. Technol</source>
          .
          <volume>35</volume>
          (
          <year>2020</year>
          )
          <fpage>913</fpage>
          -
          <lpage>945</lpage>
          . URL: https://doi.org/10.1007/s11390-020-9487-4. doi:
          <volume>10</volume>
          .1007/s11390- 020- 9487- 4.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>L.</given-names>
            <surname>Rauch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Aßenmacher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Huseljic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wirth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bischl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sick</surname>
          </string-name>
          ,
          <article-title>Activeglae: A benchmark for deep active learning with transformers</article-title>
          ,
          <source>in: Machine Learning and Knowledge Discovery in Databases: Research Track</source>
          , Springer Nature Switzerland,
          <year>2023</year>
          , p.
          <fpage>55</fpage>
          -
          <lpage>74</lpage>
          . URL: https://doi.org/10. 1007/978-3-
          <fpage>031</fpage>
          -43412-
          <issue>9</issue>
          _
          <fpage>4</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Decke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gruhl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rauch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sick</surname>
          </string-name>
          , DADO -
          <article-title>Low-cost query strategies for deep active design optimization</article-title>
          ,
          <source>in: 2023 International Conference on Machine Learning and Applications (ICMLA)</source>
          , IEEE,
          <year>2023</year>
          , pp.
          <fpage>1611</fpage>
          -
          <lpage>1618</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Aikawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ueda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tanaka</surname>
          </string-name>
          ,
          <article-title>Improving the eficiency of training physics-informed neural networks using active learning, New Generation Computing (</article-title>
          <year>2024</year>
          )
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>J. M. Cardenas</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Adcock</surname>
            ,
            <given-names>N. Dexter,</given-names>
          </string-name>
          <article-title>Cs4ml: A general framework for active learning with arbitrary data based on christofel functions</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>36</volume>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>B. van Merrienboer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Breuleux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bergeron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lamblin</surname>
          </string-name>
          ,
          <article-title>Automatic diferentiation in ml: Where we are and where we should be going</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>31</volume>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>D.</given-names>
            <surname>Huseljic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Herde</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kottke</surname>
          </string-name>
          ,
          <article-title>Separation of aleatoric and epistemic uncertainty in deterministic deep neural networks</article-title>
          ,
          <source>in: 2020 25th International Conference on Pattern Recognition (ICPR)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>9172</fpage>
          -
          <lpage>9179</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>D.</given-names>
            <surname>Huseljic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Herde</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hahn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sick</surname>
          </string-name>
          ,
          <article-title>Role of hyperparameters in deep active learning</article-title>
          ,
          <source>in: Workshop on Interactive Adaptive Learning (IAL)</source>
          ,
          <source>ECML PKDD</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J.</given-names>
            <surname>Decke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Wünsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sick</surname>
          </string-name>
          ,
          <article-title>Dataset of a parameterized U-bend flow for deep learning applications</article-title>
          ,
          <source>Data in Brief</source>
          <volume>50</volume>
          (
          <year>2023</year>
          )
          <fpage>109477</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>