<!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>Moral AI: Moral AI with Aggregating Models Based on Normative Ethical Theory</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Masashi Takeshita</string-name>
          <email>takeshita.masashi.68@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rafal Rzepka</string-name>
          <email>rzepka@ist.hokudai.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kenji Araki</string-name>
          <email>araki@ist.hokudai.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Moral AI, Moral Uncertainty, Natural Language Processing, Language Models</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Information Science and Technology, Hokkaido University</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Graduate School of Information Science and Technology, Hokkaido University</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Moral AI has been studied in the fields of philosophy and artificial intelligence. Although most existing studies are only theoretical, recent developments in AI have made it increasingly necessary to implement AI with morality. On the other hand, humans are under the moral uncertainty of not knowing what is morally right. In this paper, we implement the Maximizing Expected Choiceworthiness (MEC) algorithm, which aggregates outputs of models based on three normative theories of normative ethics to generate the most appropriate output. MEC is a method for making appropriate moral judgments under moral uncertainty. Our experimental results suggest that the output of MEC correlates to some extent with commonsense morality and that MEC can produce equally or more appropriate output than existing methods.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Philosophy and artificial intelligence have long considered the creation of Moral AI by
which we mean artificial intelligence with morality 1. In philosophy, theoretical studies
have explored under what framework the creation of moral AI is desirable [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], while
the filed of AI is still exploring how to implement such a framework [e.g.
3, 4, 5].
      </p>
      <p>
        There are many reasons why Moral AI is essential. For example, if an AI is implemented
in automated driving technology, it will likely make morally wrong decisions if it cannot
correctly make moral judgments [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Similarly, if healthcare workers use AI for
decisionmaking support in the medical field, that AI must be able to make appropriate ethical
decisions [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Furthermore, as AI becomes more accessible and assists or advises us in
various aspects of our daily lives, it may lead us in the wrong direction if such AI ignores
morality.
nEvelop-O
China
(K. Araki)
4.0 International (CC BY 4.0).
      </p>
      <p>CEUR
Workshop
Proceedings
htp:/ceur-ws.org
ISN1613-073</p>
      <p>CEUR</p>
      <p>Workshop Proceedings (CEUR-WS.org)</p>
      <sec id="sec-1-1">
        <title>1We use “moral” and “ethical” interchangeably.</title>
        <p>
          In recent years, large language models (LLMs) have been developed, and the
implementation of morality has become essential, but most of previous research on moral AIs
has been done without implementation [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. The social impact of foundation models [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ],
such as the BERT [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and GPT series [e.g. 11], is significant, and it is essential to
implement appropriate ethics in these foundational models. Recently, users have an easy
access to output of LLMs, which is known to contain harmful content and discriminatory
bias [
          <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
          ]. Therefore, it has become more important to implement appropriate ethics
in LLM. But what ethics should we implement in AI?
        </p>
        <p>
          To answer this question, we create several models based on normative ethical theories
studied in normative ethics and implement an algorithm to aggregate the output of
these models (Figure 1). We call the algorithm Maximizing Expected Choiceworthiness
(MEC) algorithm [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. Existing research has created models and datasets solely based on
commonsense morality [e.g. 5]. However, relying directly on commonsense morality may
be inappropriate if it is incorrect. Therefore, we use findings of normative ethics and
implement Moral AI based on the normative theories studied there. It is possible to create
morally appropriate AI by not relying on commonsense morality as it is, but by referring
to various normative theories. Although this idea has already been proposed [
          <xref ref-type="bibr" rid="ref14 ref15">15, 14</xref>
          ], no
implementation and evaluation experiments have been conducted. Thus, we improve,
implement, and evaluate this idea.
        </p>
        <p>The structure of this paper is as follows. In Section 2 we describe existing research
on implementations of morality in AI, and on moral uncertainty, a central concept in
this research. In Section 3 we describe Maximizing Expected Choiceworthiness (MEC)
algorithm. Section 4 explains why MEC is desirable in the implementation of Moral AI
and Section 5 describes the experiments. Section 6 describes the experimental results,
which are discussed in Section 7.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <sec id="sec-2-1">
        <title>2.1. MoralQA and Moral AI</title>
        <p>
          AI researchers have been trying to implement AIs capable of making moral judgments
(we will call them Moral AI(s) in this paper) in various ways. In one of early examples,
Anderson et al. [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] have proposed MedEth, which learns by inductive logic programming
based on principles proposed by ethicists, and advises the user. MedEth is limited to
situations related to medical ethics, but its generalized version, GenEth [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], has also
been proposed.
        </p>
        <p>
          Since the advent of deep learning, researchers have studied MoralQA, which is to study
whether AI can predict human answers to questions about morality [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. There are two
types of datasets used in the MoralQA task: ones based on ethical theories and ones that
not. The ETHICS dataset [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] is created based on ethical theories. It consists of five
datasets: justice, utilitarianism, duty theory, virtue, and commonsense morality. Except
for commonsense morality, four datasets were created based on their respective theories
and concepts. Jin et al. [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] also developed a dataset called MoralExceptQA to assess
understanding of when it is acceptable to break the rules based on contractualism.
        </p>
        <p>
          One example of a QA dataset that is not explicitly based on ethical theory is Social
Chemistry 101 [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. Forbes et al. [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] asked crowdworkers a) to create situation-related
rules of thumb (RoTs) and to annotate b) which category of morality the RoTs belong to
and c) the moral evaluation of the actions in the situation. Another example of this type
of dataset is the Moral Stories dataset [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] which was created based on Social Chemistry
101. Moral Stories consists of norms, situations, related intentions and actions, and
consequences of actions. Jiang et al. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] have re-edited various commonsense morality
datasets, including Social Chemistry 101 and MoralStories, to compile approximately 1.7
million data from The Commonsense Norm Bank.
        </p>
        <p>
          As a model for solving MoralQA tasks, Jiang et al. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] created Delphi, which can
answer moral questions using the Commonsense Norm Bank. Delphi is a model based
on UNICORN [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], a model built on T5 [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], and further trained with Commonsense
Norm Bank. UNICORN is a model trained using RAINBOW [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], a collection of
CommonsenseQA datasets. Therefore, Delphi is a model trained on the commonsense
morality dataset and not on a dataset that explicitly references ethical theory.
        </p>
        <p>
          Jiang et al. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] suggested two approaches to the creation of Moral AI, top-down and
bottom-up [cf. 1], and stated that Delphi is based on a bottom-up approach. The
top-down approach is to create Moral AI by referring to moral theories and rules, while
the bottom-up approach is to create Moral AI based on data such as people’s intuition.
As we have seen, most of the existing research is bottom-up (the exception is Anderson
et al. [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]). However, there are problems with using a bottom-up approach alone, such
as being conservative because it is based on current commonsense morality and cannot
correct commonsense morality when it is wrong. As Jiang et al. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] correctly point out,
top-down and bottom-up approaches must be mutually influential. Because we train
AI models based on each moral theory, our study belongs to the top-down approach.
Therefore, our research is meant to complement the existing bottom-up approach.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Moral Uncertainty</title>
        <p>Moral uncertainty is “uncertainty that stems not from uncertainty about descriptive
matters, but about moral or evaluative matters.” [14, p.1]. Moral uncertainty arises not
from uncertainty about descriptive questions but from evaluative questions. For example,
in normative ethics, various theories have been proposed, such as utilitarianism and
deontology, and no one yet knows which is the correct theory. Which theory is favored
may still be open even if all the descriptive problems are solved.</p>
        <p>
          We must make moral decisions without knowing which theory is correct. Bogosian [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]
points out two problems with this moral uncertainty. First, moral disagreement makes
cooperation among engineers, policymakers, and philosophers dificult. In some cases, it
can become simply an ideological conflict. Second, if there is wide disagreement about
normative ethical theories, making moral judgments based on a single theory in the
presence of diverse positions is, statistically speaking, unlikely to be the right decision.
Because of the second problem, some philosophers avoid top-down approaches. However,
due to the existence of the first problem and moral disagreement, bottom-up approaches
are also unlikely to resolve moral dilemmas or politically divisive issues. Therefore,
        </p>
        <p>Input:
context sentence
and options (actions)
Utilitarianism</p>
        <p>Model</p>
        <p>Deontology</p>
        <p>Model</p>
        <p>Virtue Ethics</p>
        <p>Model
Aggregation by Maximizing Expected</p>
        <p>Choiceworthiness Algorithm</p>
        <p>Output:
ranking of options
implementing Moral AI based on a single principle is undesirable, and relying solely on a
bottom-up approach is problematic.</p>
        <p>
          Some researchers [
          <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
          ] proposed Maximizing Expected Choiceworthiness (MEC)
algorithm as a desirable decision-making approach in situations of moral uncertainty. We
will explain this idea below, particularly regarding AI implementations.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Maximizing Expected Choiceworthiness As a Solution to Moral</title>
    </sec>
    <sec id="sec-4">
      <title>Uncertainty</title>
      <p>Maximizing Expected Choiceworthiness (MEC) is one of the solutions to decision-making
problems in moral uncertain situations. This section describes this framework following
the explanation [cf. 14] by Bogosian [15, sec. 5].</p>
      <sec id="sec-4-1">
        <title>3.1. Preliminary Definition</title>
        <p>
          An AI chooses an action in a decision situation &lt; , ,  ,  ,  &gt; where  is the decision
maker,  is the time, and  is the set of possible actions (options) to take.  is the set of
normative theories under consideration. A theory   is a function of decision that produces
a cardinal or ordinal choiceworthiness score for actions   () for all actions  ∈  . (  )
is a credence function that assigns values in [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] to every   ∈  . A metanormative
theory is a function of decision-situations that produces an ordering of the actions in 
regarding their appropriateness.
        </p>
        <p>includes three kinds of moral theories: (1) theories that assign a cardinal ranking to
options, and these rankings are comparable, (2) theories that assign a cardinal ranking
to options, and these rankings are incomparable and (3) theories that assign ordinal
rankings to options. For example, typically, utilitarianism is a cardinal theory, and
deontology is an ordinal theory.</p>
        <p>
          In the case of current AI models, because they can output the probability of a given
label in the range of [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ], we can interpret all outputs as cardinal values. However,
probability is not a choiceworthiness itself, so we treat the values assigned by AI models
based on ordinal theories as ordinal scale values.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Calculating Choiceworthiness</title>
        <p>Maximizing Expected Choiceworthiness (MEC) consists of four steps of calculating
choiceworthiness scores.</p>
        <p>Step 1: Merging commensurable cardinal theories
Given a set of  intertheoretically
comparable cardinal theories and  sets of actions assigned choiceworthiness scores by
each theory, these theories are merged into a single theory  :
(1)
(2)</p>
        <p>.
(3)
Step 2: Assigning choiceworthiness scores by ordinal theories
A modified Borda scoring
rule is used to generate scores for each action based on the ranking of actions which is
provided on each ordinal theory  , considering ties. These scores are represented as 
The score of an action is determined by the diference between the number of actions
inferior to it and the number of actions superior to it.
treat both  1 and  2 as “1” (e.g., wrong) equally.</p>
        <p>An AI model outputs the probability of given labels. Here, we have two ways of treating
this probability. First, we can treat this probability as a cardinal value. For example,
if an AI model outputs 0.8 for an action  1 and 0.6 for  2 for the probability that the
label is “1” (e.g., wrong), we treat  1 as having a higher choiceworthiness score than  2.
Second, we can use threshold and treat model outputs as ordinal values. For instance, if
an AI model outputs 0.8 for an action  1 and 0.6 for  2 and we set 0.5 as a threshold, we
 (  ) = ∑ (  )
  ( ) =

=1</p>
        <p>∑
=1   ( ) (  )</p>
        <p>∑</p>
        <p>=1  (  )
   ( ) =
| ∈  ∶ 
− | ∈  ∶ 
 ( ) &lt;   ( )|
 ( )⟩   ( )|
Step 3: Normalization</p>
        <p>
          To equalize the value of voting for each value system, all
choiceworthiness scores   () are divided by their respective standard deviations:
   () =
   () =
   ( ) =
 (
 (
  ()
   ()
 ( ) )
  ( ))
  ( )
 (  ( ))
where theories  means intertheoretically incomparable cardinal theories,  is a
representative set of actions (the “general set”), which actions may not be included  .
Bogosian [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] stated the choiceworthiness score should be divided by standard deviations
of 
 ( ), because we should think about whether each considered action “is
compara
tively important or comparatively unimportant from the point of view of a particular
theory” [15, p.597]. However, since it is dificult to select representative actions [cf.
14,
p.102], we treat
        </p>
        <p>as  in our experiment. This way of normalization relativizes the
choiceworthiness scores to  .</p>
        <p>Step 4: Aggregation</p>
        <p>Finally, we obtain expected choiceworthiness by following equation:
(4)
(5)
(6)
(7)

=1</p>
        <p>( ) = ∑    ( ) (  )
The decision maker selects the action  which maximizes 
 () .</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Why is MEC preferable in Moral AI?</title>
      <p>As described above, MEC algorithm aggregates the output of models based on each
normative ethical theory to output a final moral evaluation. There are at least three
reasons why this algorithm is desirable in Moral AI.</p>
      <p>First, if one creates models based on theories, one can, in principle, evaluate the output
of each theory-based model since there is a correct answer relative to the theory for every
question. For example, when creating a utilitarian model, the evaluation of the utilitarian
model can be evaluated by whether the model’s output is appropriate from a utilitarian
point of view. However, in the case of a model based on commonsense morality, not
theory, such as Delphi, it is dificult to evaluate the model because people sometimes
have difering opinions about moral problems such as moral dilemmas or political issues.</p>
      <p>Second, because MEC is a general framework, it can be used for the models developed
in this paper and other models that may be proposed or developed by others in the
future. Although we have only used three theories in this experiment, we can use existing
models such as Delphi and future proposed models to produce moral evaluations.</p>
      <p>Third, the models aggregated in the MEC need not necessarily be theory-based. For
example, if one wants to reflect cultural diversity, one can create a Delphi-like model for
each culture, and MEC can aggregate the output of each model. Of course, reflecting
the commonsense morality of each culture without being based on ethical theory makes
evaluation dificult, as noted in the first point, but the ability to reflect cultural diversity
in this way is another advantage of MEC being a general framework. Although we did
not use a model that reflects cultural diversity in our experiments, we plan to develop it
in the future.</p>
      <p>We did not use a model reflecting cultural diversity in this experiment, but plan to
develop one in the future.</p>
    </sec>
    <sec id="sec-6">
      <title>5. Experiment</title>
      <sec id="sec-6-1">
        <title>5.1. Implementation</title>
        <p>
          To calculate expected choiceworthiness, we need AI models based on ethical theories. For
this purpose, we fine-tune DeBERTa-v3 large [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]23 on datasets included in ETHICS [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
DeBERTa-v3 is an ELECTRA-style pretrained model. ELECTRA [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] is a model
pretrained through Replaced Token Detection (RTD). RTD is a model training method
where some tokens in the original sentence are masked, Generator (Masked Language
Model [cf. 10]) fills the masked tokens with words using, and Detector detects the words
iflled in the mask. He et al. [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] improved the RTD by Gradient-Disentangled Embedding
Sharing. While the gradient is shared between Generator and Detector during training
in ELECTRA, the gradient is split between Generator and Detector in DeBERTa-v3.
        </p>
        <p>
          For fine-tuning DeBERTa-v3, we use three datasets: “utilitarianism”, “deontology”
and “virtue”. These theories are the most endorsed theories in normative ethics [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]45.
We set all (  ) to 1. Bogosian [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] suggested some ways of assigning (  ), one of which
is to assign the philosopher’s endorsement rate. According to PhilPapers Survey [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], the
supporters of each theory ( consequentialism, deontology, and virtue ethics) are roughly
equal (32%, 31%, and 37%, respectively). Therefore we assign hypothetically equal values
in this experiment. Hyperparameters are shown on Table 1.
        </p>
        <p>
          There are two problems with using ETHICS dataset. First, this dataset was created by
nonspecialist crowdworkers. Second, this dataset was not annotated directly according
to each normative theory. For example, according to utilitarianism, an action is right if
and only if the action maximizes the total well-being of all sentient beings afected by
the action. However, Hendrycks et al. [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] asked crowdworkers to evaluate the well-being
of the person who is presented in the given sentence, not all sentient beings. Hence, this
dataset is not perfectly based on moral theories. Nevertheless, we use ETHICS in our
experiment because it is the only dataset created based on ethical theories. As already
        </p>
        <sec id="sec-6-1-1">
          <title>2https://huggingface.co/microsoft/deberta-v3-large</title>
          <p>3We do not have enough computational resources to fine-tune large models such as T5 11 . We use
DeBERTa-v3large because it is one of the best performing models.</p>
          <p>4https://survey2020.philpeople.org/survey/results/4890
5PhilPapers Survey did not use “utilitarianism” but “consequentialism”. Utilitarianism is a particular
type of consequentialism, therefore we can use the “utilitarianism” dataset as a consequentialist dataset.</p>
          <p>6https://pytorch.org/docs/stable/generated/torch.optim.AdamW.html
mentioned, an advantage of our approach is that such a dataset and AI models can be
refined based on moral theories. We plan to develop a more theory-informed dataset
than ETHICS in the future.</p>
          <p>
            In using each model for MEC, the following input-output structure is used. First, the
utilitarian model outputs a scalar value and treats it directly as a choiceworthiness score,
following the construct of Hendrycks et al. [
            <xref ref-type="bibr" rid="ref18">18</xref>
            ]. Next, for the deontology model, we
use the form “I am a human [SEP]   ” as input, following the input form of the Role
subtask, and treat its output value (the probability that the   is permissible) as the
choiceworthiness score, where   denotes an action statement under consideration. This
input form is intended to allow the model to determine whether an action is morally
permissible or impermissible as a human being. Finally, for the virtue ethics model,
we first list all character trait terms in the “virtue” train set and assign sentiment by
SenticNet [
            <xref ref-type="bibr" rid="ref28">28</xref>
            ]. Terms not included in SenticNet are excluded. As a result, we collected
695 character trait terms and their sentiment. Let   be the term of a character trait,
the input format is “  [SEP]   ”, and the sentiment of   with the highest probability is
treated as the choiceworthiness score of   .
          </p>
        </sec>
      </sec>
      <sec id="sec-6-2">
        <title>5.2. Evaluation</title>
        <p>
          We assess the performance of our model through a evaluation process, which involves
two distinct methods
5.2.1. Experiment 1: Evaluate the performance and generalizability of each model using
the ETHICS dataset
First, we assess the results for the test set of each sub-dataset, i.e., “utilitarianism”,
“deontology”, and “virtue”. We also use “commonsense” in ETHICS to evaluate generalizability
of our models. We expect the accuracy of MEC in this dataset to be superior to the
accuracy of each model because of aggregation. In the case of the “commonsense” dataset,
we set the threshold of the utilitarianism model for classification using 1,000 samples
train data of the “commonsense” dataset. For the other two models (the deontology and
the virtue ethics model), the output is positive if it is greater than zero and negative
otherwise.
Second, we compare our model with Delphi [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] by asking three Ph.D. students majoring
in philosophy 7.
        </p>
        <p>There are two kinds of evaluation: each output and the overall. First, we asses the
output of our models using 40 sampled data (20 pairs) of test sets of “commonsense”
in ETHICS dataset. We ask the annotators if the outputs of each of the models were
properly theory-based, respectively. We also asked whether the Delphi’s outputs and
the aggregated output (i.e. MEC’s output) were consistent with the annotators’ moral
judgments.</p>
        <p>Second, in overall evaluation, we ask the Ph.D. students to compare Delphi and MEC
model with three metrics and the reasons:
1. Which is preferred: one answer output to one question (like Delphi) or a comparative
ranking for options (like MEC)? Why?
a) The former is more preferable than the latter.
b) The latter is more preferable than the former.
c) Both are preferable.</p>
        <p>d) Both are not preferable.
2. When a non-expert in ethics were to use Delphi or MEC as an AI advisor in moral
deliberation, which model would be helpful? Why?
a) Delphi is more helpful than MEC.
b) MEC is more helpful than Delphi.
c) Both are helpful.</p>
        <p>d) Both are not helpful.
3. When an expert in ethics were to use Delphi or MEC as an AI advisor in moral
deliberation, which model would be helpful? Why?
a) Delphi is more helpful than MEC.
b) MEC is more helpful than Delphi.
c) Both are helpful.</p>
        <p>d) Both are not helpful.</p>
        <p>
          We ask people to evaluate these models as AI advisors for two reasons. First, when
people use these models, they ask the AI for opinions about ethics and use it as a
decision-making tools [
          <xref ref-type="bibr" rid="ref16 ref3">3, 16</xref>
          ]. Second, there may be a kind of explanation of the model’s
output by showing users not only the aggregated results of the MEC outputs but also
the outputs of each model on which the aggregation is based. If this explains the model’s
output, it should be more useful in moral deliberation. In contrast, since Delphi does
not know the reason for its outputs, we believe that the outputs from MEC are superior
in this respect, and we use this metric to confirm this. Also, for these reasons, MEC
may be helpful to non-expert but not to experts in ethics. Therefore, we examine this
hypothesis through questions 2 and 3.
        </p>
        <p>7We asked, in English, three Japanese Ph.D. students who are fluent in English. There might be
some minor language problems, but we do not think they significantly influence the results.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>6. Results</title>
      <sec id="sec-7-1">
        <title>6.1. Experiment 1: performance and generalizability of each model using the</title>
      </sec>
      <sec id="sec-7-2">
        <title>ETHICS dataset</title>
        <p>We show the results of ETHICS dataset as the test set in Tables 2 and 3. Except for
utilitarianism dataset, DeBERTa results are better than BERT, RoBERTa, and ALBERT
results, which are fine-tuned with all train data. It also outperforms the T5 and Delphi,
which are fine-tuned with 100 sampled train data. The higher accuracy for the other
models on the utilitarian dataset is likely because this task was designed as a binary
classification task.</p>
        <p>Regarding the results for the commonsense dataset, since MEC is an ensemble model of
each theory-based model, the results are better than the other three models as expected.
In addition, each model outperforms the random baseline even though it was not
finetuned on the commonsense dataset. These results indicate that the verdict based on each
theory correlates to some extent with the commonsense morality verdict. This correlation
suggests generalizability from learning on each theory to commonsense morality. However,
the accuracy of each theory-based model on this dataset is relatively low, and we will
examine how it could achieve higher performance in the future.</p>
      </sec>
      <sec id="sec-7-3">
        <title>6.2. Experiment 2: Comparison with Delphi by asking Ph.D. students</title>
        <p>In Table 5 we show the results of the questioning Ph.D. students majoring in philosophy
. We asked three annotators to evaluate 20 paired sentences, but they were not able to
evaluate four paired sentences because of a lack of context. Therefore, we are showing
the results for 16 pairs. Delphi and MEC showed little diference in the results. Delphi,
trained on the “commonsense” dataset, was expected to be more accurate than MEC,
but this was not the case.</p>
        <p>We also show the results based on each theory (see Table 6) only for the paired sentences
answered by all three students because some paired sentences were not evaluated due to a
lack of context. All three models used in MEC had a high percentage of correct answers.</p>
        <p>Next, Table 4 shows the results of the overall evaluation of Delphi and MEC. Regarding
the first question, most annotators preferred to give one answer to one question, as in
Delphi. The reasons given were that people only care about the absolute evaluation
(non-comparative evaluation) of the alternatives and that it does not work well when
the evaluations are in the same order. On the other hand, one annotator answered that
it is preferable to provide a ranking of options, as in the MEC. The reason is that if
only a single answer is output and diferent from the expectation, the impression is that
it cannot be used as a reference. However, if it is output as a ranking, it is likely to
generate a certain degree of acceptance.</p>
        <p>For the second question, there was only one answer that MEC is more helpful than
Delphi, and the reason was “because referencing multiple positions seems more plausible.
The remaining answers were that both are not helpful because reasons are essential in
moral deliberation, but neither model provides any.</p>
        <p>Concerning the third question, all annotators indicated that both systems are not
helpful, and the reason given was that neither model provided a reason. In the case of
the experts, it seems to be more preferable to think for themselves.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>7. Discussion</title>
      <sec id="sec-8-1">
        <title>7.1. On the performance of MEC and theory-based models</title>
        <p>As seen from the results of Experiment 1 (Table 2), DeBERTa-v3 yielded superior
performance compared to the baseline model, T5 and Delphi. In addition, Experiment 2
(Table 6) also showed that DeBERTa-v3 is reliable enough to be used in this experiment,
as it produces appropriate results based on each theory. However, the evaluation of the
ETHICS dataset on the Hard Test set is still low and needs further improvement for a
practical use.</p>
        <p>All models outperform the random baseline for the results for the MEC “commonsense”
dataset in Experiment 1, suggesting that each theory generally reflects commonsense
morality. Although it is said that utilitarianism is generally counterintuitive, this theory
reflects some of our commonsense morality. The results suggest utilitarianism is not
entirely uncorrelated with commonsense morality. Moreover, other theories may also
make counterintuitive judgments in some cases (e.g. Kantian obligation to never lie). The
advantage of being theory-based is that theory-based judgment does not follow directly
from our commonsense morality. Therefore, it is desirable that the model based on each
theory does not perfectly agree with our commonsense moral evaluations. Nevertheless,
a theory-based model must correlate with common sense morality because if it is too
diferent from common sense morality, people will not want to use such a model. The
extent to which commonsense morality and the evaluation of each theory should be
correlated, and the extent to which they should not be correlated, is a controversial
problem. Furthermore, we will examine situations where there is a discrepancy between
commonsense morality judgments and theoretical judgments since the “commonsense”
dataset does not cover controversial or politically divisive topics.</p>
      </sec>
      <sec id="sec-8-2">
        <title>7.2. Comparing MEC with Delphi</title>
        <p>Annotators answered that models such as Delphi and MEC are not helpful in moral
deliberation, both for experts and non-experts, because they do not provide reasons, i.e.,
they do not explain their choices. This result rejects our original hypothesis that MEC is
a kind of explanation because the model outputs the results of theory-based models. It
may not be an explanation unless the models also provide reasons for why the model
on which each theory is based produces the output it does. We can solve this problem
by preparing a template for the output of each theory-based model. For example, a
utilitarian model could have a template such as ”Action A is more choiceworthy than
action B because action A has higher utility than action B.” In addition, it would be
desirable if it is possible to explain, for example, why action A has higher utility than
action B [cf. 31]. We will investigate what type of output format is appropriate in the
future.</p>
        <p>One of the annotators also stated that MEC could be more helpful depending on its use.
For example, Delphi and MEC would promote moral deliberation if users reconsidered
their judgment based on their output. In this case, MEC can provide aggregated outputs
and the outputs of each theory-based model, respectively, promoting moral deliberation
more than Delphi. Takeshita [32] suggests a variety of possible uses for such Moral
AI, some of which would assist users in moral deliberation and help them make more
appropriate moral decisions than those not used. In the future, we will investigate what
outputs can better support users’ moral deliberation.</p>
        <p>Next, regarding the comparison between experts and non-experts, it was found that
both MEC and Delphi were not helpful for experts, as we hypothesized. However, our
hypothesis that MEC is helpful for non-experts was not supported because, as already
mentioned, MEC does not provide reasons or explanations. On the other hand, one of
the annotators stated that MEC is more likely to guide the user’s moral judgment more
appropriately because it refers to multiple theories. This result was expected, because
the output of the MEC algorithm is more appropriate than if it were based on only a
single theory since it maximizes the expected choice worthiness. Thus, in some cases,
MEC may be useful to non-experts. We will explore in which cases MEC may be helpful
to non-experts.</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>8. Conclusion</title>
      <p>In this paper, we implemented and evaluated Maximizing Expected Choiceworthiness
algorithm. This algorithm aggregates the output of models based on multiple normative
theories to generate a morally correct output. Furthermore, this model produces
appropriate outputs under moral uncertainty when the morally correct theory is unknown.
Experimental results show that MEC is more compatible with commonsense morality
than a single model and performs as well as Delphi, an existing method. However, this
model does not provide enough reasons or explanations, and we plan to create models
that provide more reasons or explanations in the future.
The dataset based on each theory included in the ETHICS dataset used in this study
does not precisely match the evaluation based on each theory discussed in Section 5.1.
Therefore, the model created in this study may not be ideally based on each theory.
Moreover, the scale of the experiments is small. In Experiment 2, where the model is
evaluated by asking Ph.D. students, only a maximum of 16 pairs of sentences are used.
Furthermore, we did not evaluate our model in complex cases such as moral dilemmas.</p>
    </sec>
    <sec id="sec-10">
      <title>Ethical and Social Implications</title>
      <p>There is no guarantee that the output of the model implemented in this study is morally
correct. Continued refinement of this model will yield more appropriate outputs, but the
current model is inadequate. We also do not recommend that users rely on the output of
our model (or its improved versions) to make decisions. Our model is only a decision
support tool, not a substitute for user decision-making.</p>
      <p>Our model can contribute to the AI safety. Moreover, as ethical theory developed
and models based on them can be created, MEC algorithm will make AI behavior more
ethically appropriate.</p>
    </sec>
    <sec id="sec-11">
      <title>Acknowledgement References</title>
      <p>This work was supported by JSPS KAKENHI Grant Number JP22J21160. We would
like to thank the anonymous reviewers for their valuable comments.
[30] Z. Lan, M. Chen, S. Goodman, K. Gimpel, P. Sharma, R. Soricut, ALBERT: A
lite BERT for self-supervised learning of language representations, in: International
Conference on Learning Representations, 2020. URL: https://openreview.net/forum?
id=H1eA7AEtvS.
[31] Y. Bang, N. Lee, T. Yu, L. Khalatbari, Y. Xu, S. Cahyawijaya, D. Su, B. Wilie,
R. Barraud, E. J. Barezi, A. Madotto, H. Kee, P. Fung, Towards answering
openended ethical quandary questions, arXiv preprint arXiv:2205.05989 (2022).
[32] M. Takeshita, A defense of moral AI enhancement (in Japansese), Applied Ethics
14 (2023) 3–20.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Allen</surname>
          </string-name>
          ,
          <article-title>Moral machines: Teaching robots right from wrong</article-title>
          , Oxford University Press,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Allen</surname>
          </string-name>
          , I. Smit, W. Wallach, Artificial morality:
          <article-title>Top-down, bottom-up, and hybrid approaches</article-title>
          ,
          <source>Ethics and information technology 7</source>
          (
          <year>2005</year>
          )
          <fpage>149</fpage>
          -
          <lpage>155</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Armen, MedEthEx: a prototype medical ethics advisor</article-title>
          ,
          <source>in: Proceedings of the National Conference on Artificial Intelligence</source>
          , volume
          <volume>21</volume>
          , Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press;
          <year>1999</year>
          ,
          <year>2006</year>
          , p.
          <fpage>1759</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Rzepka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Araki</surname>
          </string-name>
          ,
          <article-title>What people say? web-based casuistry for artificial morality experiments</article-title>
          ,
          <source>in: Artificial General Intelligence</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>178</fpage>
          -
          <lpage>187</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Hwang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bhagavatula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Bras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dodge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sakaguchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Forbes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Borchardt</surname>
          </string-name>
          , S. Gabriel,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tsvetkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Etzioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Rini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <article-title>Can machines learn morality? the Delphi experiment</article-title>
          ,
          <source>arXiv preprint arXiv:2110.07574</source>
          (
          <year>2021</year>
          ). URL: https://arxiv.org/abs/2110.07574. doi:
          <volume>10</volume>
          .48550/ ARXIV.2110.07574.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E.</given-names>
            <surname>Awad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dsouza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schulz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Henrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharif</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-F.</given-names>
            <surname>Bonnefon</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Rahwan</surname>
          </string-name>
          ,
          <article-title>The moral machine experiment</article-title>
          ,
          <source>Nature</source>
          <volume>563</volume>
          (
          <year>2018</year>
          )
          <fpage>59</fpage>
          -
          <lpage>64</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Braun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hummel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Beck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dabrock</surname>
          </string-name>
          ,
          <article-title>Primer on an ethics of AI-based decision support systems in the clinic</article-title>
          ,
          <source>Journal of Medical Ethics</source>
          <volume>47</volume>
          (
          <year>2021</year>
          )
          <fpage>e3</fpage>
          -
          <lpage>e3</lpage>
          . URL: https://jme.bmj.com/content/47/12/e3. doi:
          <volume>10</volume>
          .1136/medethics-2019
          <source>-105860</source>
          . arXiv:https://jme.bmj.com/content/47/12/e3.full.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Tolmeijer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kneer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sarasua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Christen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <article-title>Implementations in machine ethics: A survey, ACM Computing Surveys (CSUR) 53 (</article-title>
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bommasani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Hudson</surname>
          </string-name>
          , E. Adeli,
          <string-name>
            <given-names>R.</given-names>
            <surname>Altman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Arora</surname>
          </string-name>
          , S. von Arx,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bohg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bosselut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Brunskill</surname>
          </string-name>
          , et al.,
          <article-title>On the opportunities and risks of foundation models</article-title>
          ,
          <source>arXiv preprint arXiv:2108.07258</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <source>Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://www. aclweb.org/anthology/N19-1423. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          -1423.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Neelakantan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shyam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          , et al.,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gehman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gururangan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Smith,</surname>
          </string-name>
          <article-title>RealToxicityPrompts: Evaluating neural toxic degeneration in language models, in: Findings of the Association for Computational Linguistics: EMNLP 2020, Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>3356</fpage>
          -
          <lpage>3369</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .findings-emnlp.
          <volume>301</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .findings-emnlp.
          <volume>301</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ganguli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lovitt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kernion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kadavath</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Schiefer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ndousse</surname>
          </string-name>
          , et al.,
          <article-title>Red teaming language models to reduce harms: Methods, scaling behaviors, and lessons learned</article-title>
          ,
          <source>arXiv preprint arXiv:2209.07858</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>M. MacAskill</surname>
          </string-name>
          , K. Bykvist, T. Ord, Moral uncertainty, Oxford University Press,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bogosian</surname>
          </string-name>
          ,
          <article-title>Implementation of moral uncertainty in intelligent machines</article-title>
          ,
          <source>Minds and Machines</source>
          <volume>27</volume>
          (
          <year>2017</year>
          )
          <fpage>591</fpage>
          -
          <lpage>608</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>M. Anderson</surname>
            ,
            <given-names>S. L.</given-names>
          </string-name>
          <string-name>
            <surname>Anderson</surname>
          </string-name>
          ,
          <article-title>GenEth: A general ethical dilemma analyzer, Paladyn</article-title>
          ,
          <source>Journal of Behavioral Robotics</source>
          <volume>9</volume>
          (
          <year>2018</year>
          )
          <fpage>337</fpage>
          -
          <lpage>357</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Levine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gonzalez Adauto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kamal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sachan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mihalcea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tenenbaum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Schölkopf</surname>
          </string-name>
          ,
          <article-title>When to make exceptions: Exploring language models as accounts of human moral judgment</article-title>
          , in: S. Koyejo,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Belgrave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Oh (Eds.),
          <source>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>28458</fpage>
          -
          <lpage>28473</lpage>
          . URL: https://proceedings.neurips.cc/paper_files/paper/2022/file/ b654d6150630a5ba5df7a55621390daf-Paper-Conference.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hendrycks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Burns</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Basart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Critch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Steinhardt</surname>
          </string-name>
          ,
          <article-title>Aligning AI with shared human values</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2021</year>
          . URL: https://openreview.net/forum?id=dNy_RKzJacY.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Forbes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Hwang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Shwartz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          , Social chemistry 101:
          <article-title>Learning to reason about social and moral norms</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>653</fpage>
          -
          <lpage>670</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          . emnlp-main.
          <volume>48</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .emnlp-main.
          <volume>48</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>D.</given-names>
            <surname>Emelin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. Le</given-names>
            <surname>Bras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Hwang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Forbes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          , Moral Stories:
          <article-title>Situated reasoning about norms, intents, actions, and their consequences</article-title>
          ,
          <source>in: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>698</fpage>
          -
          <lpage>718</lpage>
          . URL: https: //aclanthology.org/
          <year>2021</year>
          .emnlp-main.
          <volume>54</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .emnlp-main.
          <volume>54</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>N.</given-names>
            <surname>Lourie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. Le</given-names>
            <surname>Bras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bhagavatula</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Choi,</surname>
          </string-name>
          <article-title>Unicorn on rainbow: A universal commonsense reasoning model on a new multitask benchmark</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>35</volume>
          ,
          <year>2021</year>
          , pp.
          <fpage>13480</fpage>
          -
          <lpage>13488</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rafel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Exploring the limits of transfer learning with a unified text-to-text transformer</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>21</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>67</lpage>
          . URL: http: //jmlr.org/papers/v21/
          <fpage>20</fpage>
          -
          <lpage>074</lpage>
          .html.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , W. Chen,
          <article-title>Debertav3: Improving deberta using ELECTRAstyle pre-training with gradient-disentangled embedding sharing</article-title>
          ,
          <source>arXiv preprint arXiv:2111.09543</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>K.</given-names>
            <surname>Clark</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>T.</given-names>
            <surname>Luong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          , Electra:
          <article-title>Pre-training text encoders as discriminators rather than generators</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2020</year>
          . URL: https://openreview.net/forum?id=r1xMH1BtvB.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bourget</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chalmers</surname>
          </string-name>
          ,
          <article-title>Philosophers on philosophy: The philpapers 2020 survey</article-title>
          , ms.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>I.</given-names>
            <surname>Loshchilov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hutter</surname>
          </string-name>
          ,
          <article-title>Decoupled weight decay regularization</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2019</year>
          . URL: https://openreview.net/forum? id=
          <fpage>Bkg6RiCqY7</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Paszke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Massa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lerer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bradbury</surname>
          </string-name>
          , G. Chanan,
          <string-name>
            <given-names>T.</given-names>
            <surname>Killeen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Gimelshein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Antiga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Desmaison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kopf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>DeVito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tejani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chilamkurthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Steiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chintala</surname>
          </string-name>
          ,
          <string-name>
            <surname>Pytorch:</surname>
          </string-name>
          <article-title>An imperative style, high-performance deep learning library</article-title>
          , in: H.
          <string-name>
            <surname>Wallach</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Larochelle</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Beygelzimer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <article-title>d'Alché-</article-title>
          <string-name>
            <surname>Buc</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Fox</surname>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>32</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2019</year>
          . URL: https://proceedings.neurips.cc/paper_files/paper/2019/file/ bdbca288fee7f92f2bfa9f7012727740-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>E.</given-names>
            <surname>Cambria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Decherchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xing</surname>
          </string-name>
          , K. Kwok,
          <article-title>SenticNet 7: A commonsensebased neurosymbolic AI framework for explainable sentiment analysis</article-title>
          ,
          <source>in: Proceedings of the Thirteenth Language Resources and Evaluation Conference</source>
          , European Language Resources Association, Marseille, France,
          <year>2022</year>
          , pp.
          <fpage>3829</fpage>
          -
          <lpage>3839</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .lrec-
          <volume>1</volume>
          .
          <fpage>408</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          , V. Stoyanov,
          <article-title>RoBERTa: A robustly optimized BERT pretraining approach</article-title>
          , Computing Research Repository arXiv:
          <year>1907</year>
          .
          <volume>11692</volume>
          (
          <year>2019</year>
          ). arXiv:
          <year>1907</year>
          .11692.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>