Answers.Body: <p>There are <a href="https://en.wikipedia.org/wiki/Multi-objective_optimization" rel="nofollow noreferrer">multi-objective optimization</a> problems, where the objective functions may be in conflict with each other, which can potentially have multiple <a href="https://en.wikipedia.org/wiki/Pareto_efficiency" rel="nofollow noreferrer">Pareto-optimal</a> solutions. The paper <a href="http://www.eng.auburn.edu/~aesmith/files/Multi-objective%20optimization%20using%20genetic%20algorithms.pdf" rel="nofollow noreferrer">Multi-objective optimization using genetic algorithms: A tutorial</a> (2006) gives a good overview of the multi-objective optimization problem with genetic algorithms, which can be called <a href="https://www.egr.msu.edu/~kdeb/papers/k2012009.pdf" rel="nofollow noreferrer">evolutionary multi-objective optimization (EMO)</a> or <a href="https://pdfs.semanticscholar.org/dc4e/c99d4201affa93f404c6b4e4f8538d07aeb5.pdf" rel="nofollow noreferrer">multi-objective optimization evolutionary algorithms</a> (MOEAs). </p>
  
  <p>A common multi-objective genetic algorithm is <a href="https://web.njit.edu/~horacio/Math451H/download/SrinivasDeb_GA.pdf" rel="nofollow noreferrer">NSGA</a> (or <a href="https://pdfs.semanticscholar.org/dc4e/c99d4201affa93f404c6b4e4f8538d07aeb5.pdf" rel="nofollow noreferrer">NSGA-2</a> and <a href="https://www.egr.msu.edu/~kdeb/papers/k2012009.pdf" rel="nofollow noreferrer">NSGA-3</a>), which stands for Non-dominated Sorting Genetic Algorithm, which is based on the concepts of non-dominated sorting, <a href="https://en.wikipedia.org/wiki/Pareto_efficiency" rel="nofollow noreferrer">Pareto front and optimality</a>, <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.8270&amp;rep=rep1&amp;type=pdf" rel="nofollow noreferrer">niches</a> (sub-populations), and elitism (the best individuals of the current population are carried over to the next generation). </p>
  
  <p>If you want to play with MOEAs, you may wanna try the Python <a href="https://deap.readthedocs.io/en/master/" rel="nofollow noreferrer"><code>deap</code></a> package, which supports, for example, the <a href="https://github.com/DEAP/deap/blob/master/examples/ga/nsga2.py" rel="nofollow noreferrer">NSGA-2</a> algorithm.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-11-09T02:03:50.707Z
Answers.Text: I've only fully read the paper NSGA-2, which I advise you to read, if you want to get into MOEAs. I've skimmed through the _Multi-objective optimization using genetic algorithms: A tutorial_.
Answers.UserDisplayName: nbro
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-11-09T02:02:52.607Z
Answers.LastActivityDate: 2019-11-09T02:13:16.137Z
Answers.LastEditDate: 2019-11-09T02:13:16.137Z
Answers.UserDisplayName: nbro
Answers.Body: <p>MOEAs sounds very cool, but I feel that you can't really talk about conflict in AI without discussing <a href="https://en.wikipedia.org/wiki/Generative_adversarial_network" rel="nofollow noreferrer">generative adversarial networks (GANs)</a>, which have been shown to have amazing performance by training a model to say detect in-between pictures of cats and dogs and an adversarial network being trained to create pictures to attempt to trick the training network as much as possible. The completely conflicting objectives of the networks enable both to be trained very well so the models, in the end, are much more robust and able to handle sometimes bizarrely generated edge cases. </p>
  
  <p>I also found this paper <a href="https://arxiv.org/abs/1910.04966" rel="nofollow noreferrer">Evolutionary Multi-Objective Optimization Driven by Generative Adversarial Networks (GANs)</a> (2019), which combines MOEAs and GANs, but there are potentially more related papers.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-11-09T05:31:04.927Z
Answers.LastActivityDate: 2019-11-10T01:45:09.517Z
Answers.LastEditDate: 2019-11-10T01:45:09.517Z
Answers.UserDisplayName: Michael Hearn
Body: <p>A recent question on AI and acting recalled me to the idea that in drama, there are not only conflicting motives between agents (characters), but a character may themselves have objectives that are in conflict.</p>
  
  <p>The result of this in performance is typically nuance, but also carries the benefit of combinatorial expansion, which supports greater novelty, and it occurs to me that this would be a factor in <a href="https://en.wikipedia.org/wiki/Affective_computing" rel="nofollow noreferrer">affective computing</a>.  </p>
  
  <p>(The actress Eva Green is a good example, where her performances typically involve indicating two or more conflicting emotions at once.)</p>
  
  <p>It occurs to me that this can even arise in the context of a formal game where achieving the most optimal outcome requires managing competing concerns.</p>
  
  <ul>
  <li>Is there literature or examples of AI with internal conflicting objectives?</li>
  </ul>
  
Tags: <machine-learning><reference-request><game-theory><goal-based-agents><affective-computing>
Title: AI with conflicting objectives?
UserDisplayName: DukeZhou
ThreadText: # AI with conflicting objectives?
  
  (Asked by: username_0 on 2019-11-09)
  
  A recent question on AI and acting recalled me to the idea that in drama, there are not only conflicting motives between agents (characters), but a character may themselves have objectives that are in conflict.
  
  The result of this in performance is typically nuance, but also carries the benefit of combinatorial expansion, which supports greater novelty, and it occurs to me that this would be a factor in [affective computing](https://en.wikipedia.org/wiki/Affective_computing).
  
  (The actress Eva Green is a good example, where her performances typically involve indicating two or more conflicting emotions at once.)
  
  It occurs to me that this can even arise in the context of a formal game where achieving the most optimal outcome requires managing competing concerns.
  
  * Is there literature or examples of AI with internal conflicting objectives?
  
  **Tags:** machine-learning, reference-request, game-theory, goal-based-agents, affective-computing
  
  ---
  
  ## 2 answers
  
  ### Answer by username_1 on 2019-11-09. Score: 2
  
  There are [multi-objective optimization](https://en.wikipedia.org/wiki/Multi-objective_optimization) problems, where the objective functions may be in conflict with each other, which can potentially have multiple [Pareto-optimal](https://en.wikipedia.org/wiki/Pareto_efficiency) solutions. The paper [Multi-objective optimization using genetic algorithms: A tutorial](http://www.eng.auburn.edu/~aesmith/files/Multi-objective%20optimization%20using%20genetic%20algorithms.pdf) (2006) gives a good overview of the multi-objective optimization problem with genetic algorithms, which can be called [evolutionary multi-objective optimization (EMO)](https://www.egr.msu.edu/~kdeb/papers/k2012009.pdf) or [multi-objective optimization evolutionary algorithms](https://pdfs.semanticscholar.org/dc4e/c99d4201affa93f404c6b4e4f8538d07aeb5.pdf) (MOEAs).
  
  A common multi-objective genetic algorithm is [NSGA](https://web.njit.edu/~horacio/Math451H/download/SrinivasDeb_GA.pdf) (or [NSGA-2](https://pdfs.semanticscholar.org/dc4e/c99d4201affa93f404c6b4e4f8538d07aeb5.pdf) and [NSGA-3](https://www.egr.msu.edu/~kdeb/papers/k2012009.pdf)), which stands for Non-dominated Sorting Genetic Algorithm, which is based on the concepts of non-dominated sorting, [Pareto front and optimality](https://en.wikipedia.org/wiki/Pareto_efficiency), [niches](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.8270&rep=rep1&type=pdf) (sub-populations), and elitism (the best individuals of the current population are carried over to the next generation).
  
  If you want to play with MOEAs, you may wanna try the Python [`deap`](https://deap.readthedocs.io/en/master/) package, which supports, for example, the [NSGA-2](https://github.com/DEAP/deap/blob/master/examples/ga/nsga2.py) algorithm.
  
  > **Comments:**
  > **username_1**: I've only fully read the paper NSGA-2, which I advise you to read, if you want to get into MOEAs. I've skimmed through the _Multi-objective optimization using genetic algorithms: A tutorial_.  
  
  ---
  
  ### Answer by username_2 on 2019-11-09. Score: 2
  
  MOEAs sounds very cool, but I feel that you can't really talk about conflict in AI without discussing [generative adversarial networks (GANs)](https://en.wikipedia.org/wiki/Generative_adversarial_network), which have been shown to have amazing performance by training a model to say detect in-between pictures of cats and dogs and an adversarial network being trained to create pictures to attempt to trick the training network as much as possible. The completely conflicting objectives of the networks enable both to be trained very well so the models, in the end, are much more robust and able to handle sometimes bizarrely generated edge cases.
  
  I also found this paper [Evolutionary Multi-Objective Optimization Driven by Generative Adversarial Networks (GANs)](https://arxiv.org/abs/1910.04966) (2019), which combines MOEAs and GANs, but there are potentially more related papers.
  
  
  ---
  
  