A Computational Model of A Computational Model of Routine - - PowerPoint PPT Presentation

a computational model of a computational model of routine
SMART_READER_LITE
LIVE PREVIEW

A Computational Model of A Computational Model of Routine - - PowerPoint PPT Presentation

A Computational Model of A Computational Model of Routine Procedural Memory Routine Procedural Memory Frank Tamborello Frank Tamborello Department of Psychology Department of Psychology Rice University Rice University Houston, TX 77005


slide-1
SLIDE 1

A Computational Model of Routine Procedural Memory

Frank Tamborello Department of Psychology Rice University Houston, TX 77005 tambo@rice.edu http://chil.rice.edu/

A Computational Model of Routine Procedural Memory

Frank Tamborello Department of Psychology Rice University Houston, TX 77005 tambo@rice.edu http://chil.rice.edu/

slide-2
SLIDE 2

Overview

 Very Brief Introduction  Two Experiments, Very Briefly  ACT-R Model

2

slide-3
SLIDE 3

Context

3

slide-4
SLIDE 4

Contention Scheduling Model (CSM)

4

SCHEMAS SENSORY- PERCEPTUAL STRUCTURES Sensory Information TRIGGER DATA BASE PSYCHOLOGICAL PROCESSING STRUCTURES External & Internal Actions VERTICAL THREADS HORIZONTAL PROCESSING THREADS Motivational influence on activation Attentional resources add to or decrease activation values

slide-5
SLIDE 5

Simple Recurrent Network (SRN)

5

slide-6
SLIDE 6

GOMS

 GOAL: EDIT-MANUSCRIPT

 GOAL: EDIT-SUBTASK

repeat until no more subtasks

 GOAL: ACQUIRE-SUBTASK

✦ GET-NEXT-PAGE

if at end of manuscript page

✦ GET-NEXT-TASK

 GOAL: EXECUTE-SUBTASK

✦ GOAL: LOCATE-LINE

– [select: USE-QUOTED-STRING-METHOD – USE-LINEFEED-METHOD]

✦ GOAL: MODIFY-TEXT

– [select: USE-SUBSTITUTE-COMMAND – USE-MODIFY-COMMAND] – VERIFY-EDIT

6

slide-7
SLIDE 7

ACT-R

 Inputs:

 Knowledge

 IF-THEN rules (termed “productions”)  Declarative knowledge (“chunks”)  Subsymbolic parameters

 Simulated task environment/world

 Output: Time-stamped

behavior sequence

7

slide-8
SLIDE 8

Experiment Overview

 Task is a routine procedure  Subjects trained approximately one week before  Concurrent working memory task given

8

slide-9
SLIDE 9

1 2 6 ,7 3 4 5

8 9, 11 10 12

slide-10
SLIDE 10

1 2 3 , 4 5 6 7

8 9, 11 10 12

slide-11
SLIDE 11

static, intervening subtask procedure change, pre-change procedure change, post-change non-intervening semantic control

0.02 0.04 0.06 0.08 0.1 0.12 0.14 0.16 Mean T Mean Total Error Rate

  • tal Error Rate

Experiment 1 Condition Experiment 1 Condition

slide-12
SLIDE 12

1 2 3 , 4 5 6 7

8 9, 11 10 12

slide-13
SLIDE 13

1 2 3 4 5 6 7 8 9, 11 10 12

slide-14
SLIDE 14

4 1 3 2 5 6 7 8 9, 11 10 12

slide-15
SLIDE 15

static, different-scanner static, same-scanner change procedure, pre-change change procedure, post-change static subtask reordering

0.02 0.04 0.06 0.08 0.1 0.12 0.14 0.16 Mean T Mean Total Error Rate

  • tal Error Rate

Experiment 2 Condition Experiment 2 Condition

slide-16
SLIDE 16

The Model

 Model Goal: Simulate error rates across conditions and

trial types

 4 conditions  14 trial types total  not just error generation, but also recovery

 Highest human SEM error rate = 0.0415

 model should do no worse across the board

16

slide-17
SLIDE 17

Basic Model Functioning

17

Verify Error Recovery Retrieve Find Move Act Retrieve another action Try again to retrieve the action YES Error? Specify next action NO

slide-18
SLIDE 18

Procedure Change

18

Verify Error Recovery Retrieve Find Move Act Retrieve another action Try again to retrieve the action YES Error? Specify next action NO Current step = flagged step? NO YES Retrieve New Procedure's Step

slide-19
SLIDE 19

static, intervening subtask procedure change, pre-change procedure change, post-change non-intervening semantic control 0.02 0.04 0.06 0.08 0.1 0.12 0.14 0.16 Mean Error Rate Experiment 1 Condition humans model

slide-20
SLIDE 20

static, different-scanner static, same-scanner change procedure, pre-change change procedure, post-change static subtask reordering 0.02 0.04 0.06 0.08 0.1 0.12 0.14 0.16 Mean Error Rate Jammer, Experiment 2 Condition humans model

slide-21
SLIDE 21

static, different-scanner static, same-scanner change procedure static subtask reordering 0.02 0.04 0.06 0.08 0.1 0.12 0.14 0.16 Mean Error Rate Transporter, Experiment 2 Condition humans model

slide-22
SLIDE 22

Model Discussion

 Discrete, hierarchical goals

 governed basic behavior  enabled extensible behavior

22

slide-23
SLIDE 23

Basic Model Functioning

23

Verify Error Recovery Retrieve Find Move Act Retrieve another action Try again to retrieve the action YES Error? Specify next action NO

slide-24
SLIDE 24

Procedure Change

24

Verify Error Recovery Retrieve Find Move Act Retrieve another action Try again to retrieve the action YES Error? Specify next action NO Current step = flagged step? NO YES Retrieve New Procedure's Step

slide-25
SLIDE 25

1, 7 2 6 3 4 5 8 9, 11 10 12

slide-26
SLIDE 26

Model Discussion

 No quantitative, multi-condition error models in

literature

 Same model mechanisms across

 4 between-subjects conditions  14 trial types

26

slide-27
SLIDE 27

Future Work

 Extend model

 Step-level error  Step completion time

 Model training, too

27

slide-28
SLIDE 28

General Discussion

 Hierarchical, discrete goal representation matters

 …for changing circumstances  …for error recovery  …like CSM

 Botvinick & Plaut’s connectionist model too narrow

 No postcompletion errors  No error recovery  No adaptation of old procedures to new circumstances

28

slide-29
SLIDE 29

Acknowledgments

 Mike  Carissa Chang & Adam Purtee  Rick Cooper & Jay McClelland  Kristen

29

slide-30
SLIDE 30

Thank you!

 Questions?

30