Bob Marinier John Laird University of Michigan Electrical Engineering and Computer Science August 2, 2007.

Slides:



Advertisements
Similar presentations
Delta Confidential 1 5/29 – 6/6, 2001 SAP R/3 V4.6c PP Module Order Change Management(OCM)
Advertisements

You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Fundamentals of Probability
Advanced Piloting Cruise Plot.
Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
FIGURE 9.1 Control of temperature by process control.
Summary of Convergence Tests for Series and Solved Problems
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
Building Relationships
Richmond House, Liverpool (1) 26 th January 2004.
Differential Equations
Control and Feedback Introduction Open-loop and Closed-loop Systems
1 The tiling algorithm Learning in feedforward layered networks: the tiling algorithm writed by Marc M é zard and Jean-Pierre Nadal.
Copyright © 2001 by Houghton Mifflin Company. All rights reserved. 1 Economics THIRD EDITION By John B. Taylor Stanford University.
Data Structures: A Pseudocode Approach with C
ABC Technology Project
Hash Tables.
Copyright © Cengage Learning. All rights reserved.
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
2 |SharePoint Saturday New York City
VOORBLAD.
A Key to Economic Analysis
Chapter 6 The Mathematics of Diversification
2009 Foster School of Business Cost Accounting L.DuCharme 1 Determining How Costs Behave Chapter 10.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
0 Teams: Roles of Group Members. 1 What is a team? Two or more people ……….
Identifying Our Own Style Extended DISC ® Personal Analysis.
Do you have the Maths Factor?. Maths Can you beat this term’s Maths Challenge?
© 2012 National Heart Foundation of Australia. Slide 2.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Copyright © 2013, 2009, 2006 Pearson Education, Inc. 1 Section 5.4 Polynomials in Several Variables Copyright © 2013, 2009, 2006 Pearson Education, Inc.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Equal or Not. Equal or Not
Slippery Slope
Januar MDMDFSSMDMDFSSS
Determining How Costs Behave
Week 1.
1. 2 No lecture on Wed February 8th Thursday 9 th Feb Friday 27 th Jan Friday 10 th Feb Thursday 14: :00 Friday 16:00 – 19:00 HS N.
A Cognitive Architecture Theory of Comprehension and Appraisal: Unifying Cognitive Functions and Appraisal Bob Marinier John Laird University of Michigan.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
A SMALL TRUTH TO MAKE LIFE 100%
PSSA Preparation.
1 Soar Emote Bob Marinier John Laird University of Michigan.
Immunobiology: The Immune System in Health & Disease Sixth Edition
McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 16 Integrated Services Digital Network (ISDN)
Emotion-Driven Reinforcement Learning Bob Marinier & John Laird University of Michigan, Computer Science and Engineering CogSci’08.
Generating Appraisals with Sequence & Influence Networks Bob Marinier, SoarTech 29 th Soar Workshop June 2009.
Bob Marinier Oral Defense University of Michigan, CSE June 17, 2008 A Computational Unification of Cognitive Control, Emotion, and Learning.
COMPUTATIONAL MODELING OF INTEGRATED COGNITION AND EMOTION Bob MarinierUniversity of Michigan.
Bob Marinier Advisor: John Laird Functional Contributions of Emotion to Artificial Intelligence.
Presentation transcript:

Bob Marinier John Laird University of Michigan Electrical Engineering and Computer Science August 2, 2007

Introduction Want to build computational models of emotion, mood and feeling Computational models need to fill in a lot of blanks that are not addressed by most theories How are emotion, mood and feeling represented? How do they interact? On what principles do we answer these questions? Existing computational models lack principled models of the relationship between emotion, mood, and feeling 2

Introduction Want to build computational models of emotion, mood, and feeling Need specific algorithms and data structures for representing and manipulating these Existing computational models propose reasonable solutions But little attempt to define reasonable We present a more comprehensive theory of the integration of emotion, mood, and feeling We present explicit criteria for evaluating models of integration Human data would be best, but isnt available We propose functional, simple criteria We apply these criteria by building on existing models and suggesting actual functions 3

Appraisal theories Idea: Humans evaluate a situation with respect to their goals along a number of innate dimensions Novelty, Goal Relevance, Causality, Conduciveness Appraisals trigger emotional responses Mapping between appraisal values and emotions is fixed 4

Appraisals to emotions Scherer 2001JoyFearAnger SuddennessHigh/mediumHigh UnpredictabilityHigh Intrinsic pleasantnessLow Goal/need relevanceHigh Cause: agentOther/natureOther Cause: motiveChance/intentionalIntentional Outcome probabilityVery highHighVery high Discrepancy from expectationHigh ConducivenessVery highLow ControlHigh PowerVery lowHigh 5

Relationship between emotion, mood, and feeling Emotion: Result of appraisals Is about the current situation Mood: Average of recent emotions Provides historical context Feeling: Emotion + Mood What agent actually perceives 6

Representation of emotion, mood, and feeling Use a frame that contains the current value of each appraisal dimension (Gratch & Marsella 2004) Since appraisal-to-emotion mapping is fixed, this frame can represent the emotion For simplicity, use appraisal frames to represent emotion, mood, and feeling 7

Appraisal frame representation Values are represented on one of two scales [0,1] : Dimension has endpoints that correspond to low and high intensity E.g., Suddenness [-1,1] : Dimension has endpoints that correspond to high intensity, with midpoint of low intensity E.g., Conduciveness 8

Appraisal frame representation Scherer 2001Range Suddenness[0,1] Unpredictability[0,1] Intrinsic pleasantness[-1,1] Goal/need relevance[0,1] Cause: agent (self)[0,1] Cause: agent (other)[0,1] Cause: agent (nature)[0,1] Cause: motive (intentional)[0,1] Cause: motive (negligence)[0,1] Cause: motive (chance)[0,1] Outcome probability[0,1] Discrepancy from expectation[0,1] Conduciveness[-1,1] Control[-1,1] Power[-1,1] 9

Cognition Emotion Mood Feeling Combination Function Pull (10% per cycle) Decay (1% per cycle) Active Appraisals Perceived Feeling Interaction between emotion, mood, and feeling 10

Criteria for combining emotion and mood Neal Reilly (1996, 2006) developed the basis for many of these criteria Assumption: Dimension Independence Can compute combination of each dimension in the frame separately v feeling = C(v mood, v emotion ) Output must fall in [0,1] or [-1,1] range 11

Criteria for combining emotion and mood Distinguishability of inputs Dont want a large range of inputs to map to a small range of outputs The agent wouldnt be able to distinguish between the inputs, and thus couldnt form diverse responses 12

Criteria for combining emotion and mood Limited range: Avoid going out of scale as much as possible Averaging doesnt make sense Example: If mood is one of mild conduciveness, and emotion is of strong conduciveness, feeling should be of stronger, not weaker conduciveness Output should be between the input with the maximum magnitude and the sum of the inputs 13

Criteria for combining emotion and mood Non-linear Consider these examples C(0.5, 0.5) = ? C(0.8, 0.9) = ? C(0.5, 0.9) = ? If sum the inputs, then first two are not distinguishable If max the inputs, then the last two are not distinguishable Relationship may be logarithmic 14

Criteria for combining emotion and mood Symmetry Emotion and mood contribute equally to feeling We have no reason to assume the function is symmetrical, but it seems like a reasonable place to start Symmetry around 0 C(x, 0) = C(0, x) = x C(0, 0) = 0 Symmetry of opposite values C(x, -x) = 0 Symmetry of all values C(x, y) = C(y, x) 15

Combination function Good Limited range Non-linear Problems Not centered at zero: C(0,0) = Doesnt work with negative values (not symmetrical) 16

Combination function Good Limited range Non-linear Centered at zero Problems Doesnt work with negative values (not symmetrical) 17

Combination function Good Limited range Non-linear Symmetrical Problems Distinguishability of inputs C(-0.1, 0.9) = C(-0.5, 0.9) =

Combination function Good Distinguishability of inputs C(-0.1, 0.9) = C(-0.5, 0.9) = Limited range Non-linear Symmetrical 19

Example 20 EmotionMoodFeeling Suddenness [0,1]0.235 Unpredictability [0,1] Intrinsic-pleasantness [-1,1] Goal-relevance [0,1] Causal-agent (self) [0,1]000 Causal-agent (other) [0,1]000 Causal-agent (nature) [0,1] Causal-motive (intentional) [0,1]000 Causal-motive (chance) [0,1] Causal-motive (negligence) [0,1]000 Outcome-probability [0,1] Discrepancy [0,1] Conduciveness [-1,1] Control [-1,1] Power [-1,1] Labelela-joyanx-worela-joy

Feeling intensity Often useful to compress feeling frame into a single intensity value 21

Feeling intensity criteria Limited range: Should map onto [0,1] No dominant appraisal: No single value should drown out all the others Cant just multiply values, because if any are 0, then intensity is 0 Realization principle: Expected events should be less intense than unexpected events 22

Intensity function Realization principle: Surprise factor OP = Outcome Probability DE = Discrepancy from Expectation 23 OP=lowOP=high DE=lowSF=highSF=low DE=highSF=lowSF=high

Intensity function No dominant appraisal Just average the rest of the appraisals together 24

Intensity function Normalize ranges to same size Treat values as magnitudes 25

Example 26 EmotionMoodFeeling Suddenness [0,1]0.235 Unpredictability [0,1] Intrinsic-pleasantness [-1,1] Goal-relevance [0,1] Causal-agent (self) [0,1]000 Causal-agent (other) [0,1]000 Causal-agent (nature) [0,1] Causal-motive (intentional) [0,1]000 Causal-motive (chance) [0,1] Causal-motive (negligence) [0,1]000 Outcome-probability [0,1] Discrepancy [0,1] Conduciveness [-1,1] Control [-1,1] Power [-1,1] Labelela-joyanx-worela-joy Intensity.127

Conclusion Contributions Proposed concrete distinction between emotion, mood and feeling Proposed common representation for these, including value ranges Listed criteria for models of mood-emotion combinations Listed criteria for models of feeling intensity Proposed functions that fulfill those criteria Future work Discover more criteria and alternative functions Demonstrate that usage of these functions confers a functional advantage Human data 27